Prescribed ramification and residue degree for a Laurent series field Created 2026-10-14 Updated 2026-11-05
For arbitrary positive integers , the displayed extension has degree , ramification index , and residue degree . If , its unique extended absolute value on a field is . A basis consists of , where the form an basis of and . Regrouping a Laurent series by its exponent modulo proves the basis assertion. When divides the extension can be inseparable; the valuation calculation still applies.
Primary ideal Created 2026-09-24 Updated 2026-11-05
A proper ideal of a commutative ring is primary when and imply for some positive integer . Equivalently, every zero divisor of the nonzero quotient ring is nilpotent. Its radical of an ideal is a prime ideal.
For example, is primary in when is prime and . In contrast, is not primary: , but and no power of three lies in . Requiring the ideal to be proper excludes the unit ideal, for which the elementwise implication would otherwise hold vacuously.
Primary torsion subgroup at a prime Created 2026-10-07 Updated 2026-11-05
For an abelian group , its -primary torsion subgroup is . It is zero exactly when , since a nonzero element of -power order has a multiple of order . Multiplication by an integer prime to is an automorphism on it.
Prime counting 2026-10-20
Prime counting evaluates the prime-counting function: it determines how many prime numbers do not exceed a given bound. A number-theoretic sieve can construct the whole table up to a moderate bound, while methods such as the Lehmer prime-counting algorithm group whole classes of integers to evaluate much larger arguments without listing every prime number.
Prime-exponent difference Created 2026-10-20 Updated 2026-11-05
For positive integers and a prime , their prime-exponent difference is , where is the exponent in prime factorization. This is the exponent of in the positive rational number , and it may be negative.
For and , the differences are at and at , giving . The quotient is an integer exactly when every difference is nonnegative. It is a rational th power exactly when every difference is divisible by , making exponent differences useful for perfect-power and divisibility tests.
For distinct primes , let consist of the positive integers having no other prime factors, including . The map from a number to its exponent tuple is a bijection from to when . The fundamental theorem of arithmetic proves that the tuple is uniquely defined and that equality of tuples implies equality of numbers. Every nonnegative tuple gives the allowed number , proving surjectivity. Multiplication of numbers corresponds to coordinatewise addition of tuples, with corresponding to the zero tuple.
Prime factor Created 2026-09-24 Updated 2026-10-20
A prime factor of a nonzero integer is a prime number satisfying . For , the distinct prime factors are , while counting repeated factors gives six prime entries. A prime factorization retains their multiplicities: knowing only the distinct prime factors does not distinguish from . A negative integer has the same prime factors as its absolute value.
Prime field Created 2026-10-03 Updated 2026-10-14
The prime field of a field is its smallest subfield: the arithmetic forced upon us by the identity element . Every subfield must contain , its repeated sums, their additive inverses, and the multiplicative inverses of nonzero results. In characteristic zero these operations produce a copy of the rational numbers . In positive characteristic of a field , they produce a copy of , with addition and multiplication given by modular arithmetic.
For example, inside the field with four elements, repeated addition of gives . Thus its prime field is , and the other two elements cannot be reached by repeatedly adding . This is why a finite field need not consist entirely of ordinary integer residues: a larger finite field extends the arithmetic of its prime field with additional elements.
The positive characteristic of a field must be a prime number. If its least vanishing multiple of were with , then would exhibit zero divisors. The absence of zero divisors rules this out. The prime field supplies the scalars when viewing as a vector space; its basis then explains the possible sizes of a finite field.
Prime gap Created 2026-10-20 Updated 2026-11-05
The prime gap is the difference between consecutive prime numbers. For the primes , the first gaps are . Every gap after the first is even because both endpoint primes are odd.
Prime gaps are unbounded: for any , the consecutive integers are all composite, since each is divisible by its corresponding summand. Thus there are arbitrarily long prime-free intervals. This elementary argument proves existence without determining how large gaps typically are near a specified bound.
Prime ideal Created 2026-09-24 Updated 2026-11-05
A proper ideal of a commutative ring is prime when implies or . Equivalently, the nonzero quotient ring is an integral domain. The properness condition excludes the unit ideal, which would satisfy the elementwise implication vacuously.
For a positive integer , is prime in exactly when is a prime number, while the zero ideal is also prime because is an integral domain. The ideal is not prime: the product of the classes of two and three vanishes in , although neither class is zero. Prime ideals are the points of the spectrum of a ring.
Prime ideal factorization Created 2026-09-24 Updated 2026-11-05
Every nonzero ideal of the ring of integers of a number field factors uniquely as a finite product of nonzero prime ideals. Thus each has integer valuations , almost all zero, determined by the factorization of its principal ideal.
The prime ideals of with are the zero ideal and the principal ideals generated by nonconstant primitive polynomials that are irreducible in .
To prove the description, invert the nonzero integers to obtain the localization . The extension of an ideal consists of the polynomials with and . Its contraction is : if and , the defining condition puts , so primeness gives . The prime ideal correspondence for localization makes this extension a proper prime ideal of .
If , its extension has a nonzero generator because is a principal ideal domain. Dividing this generator by its rational polynomial content gives an integer-coefficient primitive polynomial generating the same extended ideal. Divisibility descent by Gauss lemma for polynomials then gives in . The proper prime ideal in makes irreducible there. Conversely, any such polynomial generates a prime ideal in whose contraction is and whose intersection with is zero.
The intersection condition is essential: is a maximal ideal of , since its quotient ring is , but it is not principal. A common divisor of and must be a unit, which would generate the whole ring.
For a formal group law over any commutative ring , the invariant differential of a formal group law satisfies . Its coefficient is a unit in a ring, so . If , this means . When , the integer Bézout's identity implies , even if is a zero divisor. Put those coefficients into and the exponents divisible by into .
Prime number Created 2026-09-24 Updated 2026-10-13
A prime number is a positive integer whose only positive divisors are and . The first ten prime numbers are . In contrast, is a composite number because it has a positive divisor strictly between one and itself. The integer one is neither a prime number nor a composite number: the lower bound is part of the definition. Equivalently, the divisor function satisfies for a prime number, whereas and for every composite number .
Prime numbers are the building blocks of positive integers under multiplication. The fundamental theorem of arithmetic says that every integer greater than one is a product of prime numbers, with a unique collection of factors when their order is ignored. For example, and . Their common factors reveal the greatest common divisor , and the combined maximum powers reveal the least common multiple . A complicated divisibility question becomes a comparison of prime exponents.
There is also a useful finite test. If a composite number equals with , then . Therefore some prime factor is at most , and trial division only needs to check prime numbers up to that square root. For , checking suffices; none divides , so it is a prime number. For , the same test finds , giving . To find many prime numbers together, the sieve of Eratosthenes reuses the work by marking multiples.
The division with remainder calculations for make the test explicit:Since , these are all the prime numbers at most its square root, and every remainder is nonzero. Thus the calculation certifies a prime number, without testing the integers individually. In contrast, gives a prime factor and proves that is a composite number.
The definition has a long history. Book VII of Euclid's Elements distinguishes prime numbers from composite numbers through their possible measures; Book IX, Proposition 20 establishes that no finite list exhausts the prime numbers. The modern argument under Euclid's theorem needs only divisibility, so it proves an infinite conclusion without estimating how frequently prime numbers occur. [ref]
https://mathcs.clarku.edu/~djoyce/elements/bookVII/defVII11.html. Euclid, Elements, Book VII, definitions 11–14, David Joyce's edition
[ref]https://mathcs.clarku.edu/~djoyce/elements/bookIX/propIX20.html. Euclid, Elements, Book IX, Proposition 20
. Prime number theorem in an arithmetic progression with an exceptional zero Created 2026-10-03 Updated 2026-11-05
Uniformly for , positive integer modulus , and ,where the second term occurs only when a real character has an exceptional zero .
The term involving is omitted if there is no exceptional zero. Using keeps the error meaningful at , where the statement reduces to the ordinary Prime number theorem error rather than falsely asserting an exact equality.
Prime power Created 2026-09-24 Updated 2026-11-05
A prime power is a positive integer of the form , where is a prime number and is a nonnegative integer.
Prime-power binomial congruence for a matrix Created 2026-09-24 Updated 2026-11-05
For an integer matrix and prime , the commuting-matrix binomial theorem and divisibility of for give
Prime-power ideal Created 2026-09-24 Updated 2026-11-05
Prime-proof number Created 2026-10-20 Updated 2026-11-05
An integer for which replacing any one decimal numerical digit by a different digit never produces a prime number. The convention must specify whether changes creating a leading zero are permitted. An exact test enumerates the allowed substitutions and applies primality testing to each result.
Prime representation when h of minus eight q equals two Created 2026-09-24 Updated 2026-11-05
Suppose is a prime number with and . For each prime number , there is an integer representationexactly when and as a Legendre symbol.
Necessity follows directly. Modulo , is a nonzero square. Since is odd, is odd, so modulo eight the value is one when is even and seven when is odd, using .
Conversely, the two conditions giveby quadratic reciprocity and the second supplementary law for quadratic reciprocity. The discriminant criterion for prime representation by a binary quadratic form therefore gives a primitive positive definite form of discriminant representing .
By two distinguished classes of discriminant minus eight q and the hypothesis , it reduces to or . Any odd value of the second form has odd , and is three or five modulo eight. It cannot represent this , so the first form must. For , the two reduced forms of discriminant are and ; the permitted prime seven is .