mathematics, Clifford's theorem on special divisors is a result of William K. Clifford (1878) on algebraic curves, showing the constraints on special linear...
6 KB (734 words) - 06:43, 5 December 2024
Riemann–Roch theorem. Clifford's theorem on special divisors is also a consequence of the Riemann–Roch theorem. It states that for a special divisor (i.e.,...
32 KB (4,966 words) - 09:47, 13 June 2025
Clifford's theorem may refer to: Clifford's theorem on special divisors Clifford theory in representation theory Hammersley–Clifford theorem in probability...
244 bytes (58 words) - 07:00, 28 December 2018
(complex analysis) Clifford's theorem on special divisors (algebraic curves) Corona theorem (complex analysis) de Branges's theorem (complex analysis)...
78 KB (6,292 words) - 23:25, 29 June 2025
Prime number (redirect from Euclidean prime number theorem)
the numbers with exactly two positive divisors. Those two are 1 and the number itself. As 1 has only one divisor, itself, it is not prime by this definition...
117 KB (14,179 words) - 23:31, 23 June 2025
eigenvalue comparison theorem Clifford's theorem on special divisors Cohn-Vossen's inequality Erdős–Mordell inequality Euler's theorem in geometry Gromov's...
9 KB (709 words) - 21:10, 14 April 2025
Moduli of algebraic curves Hurwitz's theorem on automorphisms of a curve Clifford's theorem on special divisors Gonality of an algebraic curve Weil reciprocity...
7 KB (600 words) - 19:55, 10 January 2024
that the divisors are pairwise coprime (no two divisors share a common factor other than 1). The theorem is sometimes called Sunzi's theorem. Both names...
43 KB (7,239 words) - 03:37, 18 May 2025
In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle...
94 KB (12,692 words) - 05:47, 14 May 2025
possible divisors up to n {\displaystyle n} are tested, some divisors will be discovered twice. To observe this, consider the list of divisor pairs of...
27 KB (3,833 words) - 09:23, 3 May 2025
important theorems relating to modular arithmetic: Carmichael's theorem Chinese remainder theorem Euler's theorem Fermat's little theorem (a special case of...
29 KB (3,646 words) - 13:08, 26 June 2025
positive common divisor in the preorder relation of divisibility. This means that the common divisors of a and b are exactly the divisors of their GCD....
36 KB (4,743 words) - 09:31, 18 June 2025
distance to the origin (zero point) Sigma function: Sums of powers of divisors of a given natural number. Euler's totient function: Number of numbers...
10 KB (1,065 words) - 15:31, 16 June 2025
number that is a perfect cube. Sphenic numbers always have exactly eight divisors. 8 is the base of the octal number system. A polygon with eight sides is...
25 KB (2,408 words) - 08:06, 26 June 2025
the squares of all four bends Is half the square of their sum Special cases of the theorem apply when one or two of the circles is replaced by a straight...
51 KB (6,411 words) - 13:40, 13 June 2025
Fractional ideal (redirect from Divisorial ideal)
{C}}_{K}\to 0} associated to every number field. One of the important structure theorems for fractional ideals of a number field states that every fractional ideal...
10 KB (1,611 words) - 01:49, 23 May 2025
There will be more values of m having c = m if p − 1 or q − 1 has other divisors in common with e − 1 besides 2 because this gives more values of m such...
60 KB (7,783 words) - 17:53, 28 June 2025
In linear algebra, the Cayley–Hamilton theorem (named after the mathematicians Arthur Cayley and William Rowan Hamilton) states that every square matrix...
65 KB (11,251 words) - 08:52, 2 January 2025
Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity,...
28 KB (4,467 words) - 20:39, 9 June 2025
Quaternion (section Lagrange's four-square theorem)
sedenions, which have zero divisors and so cannot be a normed division algebra. The unit quaternions give a group structure on the 3-sphere S3 isomorphic...
96 KB (12,674 words) - 14:32, 18 June 2025
Rosser, J.B. (1939). "An Informal Exposition of Proofs of Godel's Theorem and Church's Theorem". Journal of Symbolic Logic. 4 (2): 53–60. doi:10.2307/2269059...
61 KB (7,016 words) - 23:55, 19 June 2025
Ring (mathematics) (section Special kinds of rings)
field; cf. Tsen's theorem). Br ( R ) {\displaystyle \operatorname {Br} (\mathbb {R} )} has order 2 (a special case of the theorem of Frobenius). Finally...
99 KB (13,697 words) - 09:39, 16 June 2025
Discrete Fourier transform (redirect from Circular convolution theorem)
the star denotes complex conjugation. The Plancherel theorem is a special case of Parseval's theorem and states: ∑ n = 0 N − 1 | x n | 2 = 1 N ∑ k = 0 N...
76 KB (12,338 words) - 20:01, 27 June 2025
Certain non-zero integers map to zero in certain rings. The lack of zero divisors in the integers (last property in the table) means that the commutative...
35 KB (3,979 words) - 11:24, 23 May 2025
expansion, respectively. Norton's theorem In direct-current circuit theory, Norton's theorem (aka Mayer–Norton theorem) is a simplification that can be...
251 KB (31,179 words) - 19:07, 15 June 2025
Polynomial ring (section Bézout's theorem)
defined by the degree. Given a greatest common divisor of two polynomials, the other greatest common divisors are obtained by multiplication by a nonzero...
54 KB (8,646 words) - 05:26, 20 June 2025
Pythagorean triple (category Pythagorean theorem)
same for the three elements). The name is derived from the Pythagorean theorem, stating that every right triangle has side lengths satisfying the formula...
82 KB (11,398 words) - 23:28, 20 June 2025
another description in terms of divisors. These are formal objects which represent possible factorizations of numbers. The divisor group Div K is defined to...
40 KB (5,798 words) - 10:21, 25 April 2025
Symmetric group (section Cayley's theorem)
combinatorics. Cayley's theorem states that every group G {\displaystyle G} is isomorphic to a subgroup of the symmetric group on (the underlying set of)...
46 KB (6,212 words) - 00:39, 20 June 2025
odd prime, it passes the test because of two facts: by Fermat's little theorem, a n − 1 ≡ 1 ( mod n ) {\displaystyle a^{n-1}\equiv 1{\pmod {n}}} (this...
38 KB (5,639 words) - 20:26, 3 May 2025