Prime-restriction metric for pretentious distance Created 2026-10-07 Updated 2026-11-05
For unit-modulus prime values, pretentious distance is the Euclidean metric on the finite vectors . On whole arithmetic functions it is only a pseudometric: it sees neither values on prime powers nor primes above the cutoff. Even for every cutoff, the functions one and have distance zero but differ on nonsquarefree integers. The norm representation proves the triangle inequality and identifies exactly the quotient on which separation holds.
Primes congruent to five modulo eight from odd squares plus four Created 2026-10-06 Updated 2026-11-05
There are infinitely many prime numbers congruent to five modulo eight. Suppose instead that they form a finite list , and put , with if the list is empty. Then is an odd number and
For every prime factor of , the integer is nonzero modulo and . Thus a square root of minus one modulo a prime exists for , which forces . All prime factors are therefore one or five modulo eight. Their product is five modulo eight, so at least one prime factor is five modulo eight. Yet none of the divides , since . This contradicts completeness of the list.
Primes represented by x squared plus three y squared Created 2026-10-13 Updated 2026-11-05
A prime number has an integer representation exactly when or . The case three is , and two is impossible.
For necessity when , reducing the equation modulo three gives . The value cannot be zero, so it is one.
Conversely, for , the quadratic character of minus three shows that is a quadratic residue modulo . Thus the discriminant criterion for prime representation by a binary quadratic form produces a positive definite form of discriminant representing . It is primitive because .
Enumeration of reduced binary quadratic forms gives only and at discriminant : the bound is , and the integrality and boundary conditions leave those two. The second is imprimitive, so proper equivalence carries the representing form to . This proves sufficiency. Examples are and .
Positive integers are equivalent when they have the same finite set of prime factors. Equivalently, each divides a positive power of the other. This equivalence relation is induced by the radical of an integer; its equivalence classes correspond to finite prime supports. The empty support gives the singleton , and every nonempty support gives an infinite class by varying exponents.
Prime valuation Created 2026-09-24 Updated 2026-10-13
For a prime number and a positive integer , the prime valuation is the exponent of in the prime factorization of , equivalently
Thus because divides but does not; , and . In particular . Multiplication adds prime valuations, , and the fundamental theorem of arithmetic makes comparison of prime valuations an exact test for divisibility between positive integers. This definition extends to a nonzero integer by taking its absolute value; for zero one commonly sets .
Primitive binary quadratic form Created 2026-09-24 Updated 2026-11-05
An integral binary quadratic form is primitive when . This condition concerns its polynomial coefficients, rather than the values of a particular representing pair. For example, is primitive, while has a common divisor two and represents only even integers.
Primitivity is invariant under proper equivalence. Expanding an integer change of variables expresses every new polynomial coefficient as an integer linear combination of the old ones, so every common divisor of the old coefficients divides the new ones. The integer inverse gives the converse. Their greatest common divisor, called the content, is therefore unchanged.
A primitive representation separately means in . Even a primitive form can have nonprimitive representations: for . A representation of a prime number, however, must use a coprime pair, since a common divisor would force to divide that prime. This observation drives the discriminant criterion for prime representation by a binary quadratic form.
Primitive Diophantine solution Created 2026-10-20 Updated 2026-11-05
A primitive Diophantine solution is an integer tuple satisfying the equation whose coordinates have greatest common divisor one. For homogeneous equations, this removes common integer scale factors.
Primitive nonnegative matrix Created 2026-10-05 Updated 2026-11-05
A square nonnegative matrix is primitive if some positive integer power has strictly positive entries. It is therefore an irreducible nonnegative matrix. The Perron–Frobenius theorem gives a leading eigenvalue whose modulus is strictly larger than that of every other eigenvalue. Every strictly positive matrix is primitive; the two-cycle permutation matrix is irreducible but not primitive.
Primitive polynomial Created 2026-09-24 Updated 2026-11-05
For a polynomial over a unique factorization domain, primitive means that its polynomial content, in the gcd convention, is a unit. Thus its coefficients have no common nonunit divisor. For example, is primitive in , whereas has content two. Gauss lemma for polynomials makes products of primitive polynomials primitive.
This convention differs from requiring the coefficient ideal to be the unit ideal over an arbitrary commutative ring. The polynomial over the unique factorization domain is primitive in the gcd sense, although its coefficient ideal is proper. The distinction matters when transferring integer content arguments to more general coefficient rings.
Primitive real-analytic Eisenstein series Created 2026-10-14 Updated 2026-11-05
For this Eisenstein series also equals , where consists of translations and their negatives. It is modular invariant. The nonholomorphic Eisenstein series summed over all nonzero integer pairs instead equals : separate each pair into a positive integer times a primitive pair. This normalization matters in Rankin–Selberg unfolding.
Principal Dirichlet character Created 2026-10-05 Updated 2026-11-05
The principal Dirichlet character modulo is one on integers coprime to and zero on all other integers. Its Dirichlet L-function is , so it has a simple pole at one. For it is induced from the character of modulus one and is not a primitive Dirichlet character.
Principal hook lengths of a partition Created 2026-09-28 Updated 2026-11-05
The principal hook lengths are along the main diagonal. They are strictly decreasing positive integers, and their sum is the size of the partition.
Probabilistic number theory Created 2026-10-06 Updated 2026-11-05
Probabilistic number theory treats an integer chosen uniformly from as a random object and studies the distribution of its arithmetic functions. The distribution changes with , and limit theorems describe the behavior as grows.
For a fixed prime , the probability that divides the chosen integer is , approaching . For finitely many distinct primes, the joint divisibility frequencies similarly approach products of these probabilities. This motivates models of the number of prime factors and helps explain why logarithmic scales and normal distributions appear in integer statistics. Such independence is an asymptotic model with specified ranges, not an assumption valid for every growing collection of primes.
Probable prime 2026-11-05
A probable prime is an integer that passes a specified necessary test for primality without thereby receiving a proof of primality. The qualification must identify the test and bases. For example, an odd passing a Fermat test to base satisfies , but a composite can satisfy that congruence.
The Miller-Rabin primality test imposes a stronger condition on a chain of modular squares. Yet passes even that test to base 2: writing , one has . A pass therefore means “not disproved by this test”, whereas a failing witness proves compositeness. With independent uniformly sampled bases, the standard worst-case error bound decreases exponentially with the number of rounds; it is a conditional test-error bound, not automatically the posterior probability that the particular input is prime.[ref]
Procedure type 2026-10-31
A data type describing a callable procedure's parameter types and any return type. A traversal callback taking an integer and producing no data result can be passed using an Oberon declaration such as Visit = PROCEDURE(x: INTEGER).
Profinite group Created 2026-09-28 Updated 2026-11-05
A profinite group is an inverse limit of finite discrete groups. For a directed compatible system, its elements are tuples whose coordinates agree under all transition homomorphisms. Multiplication and inversion operate coordinatewise. The inverse-limit topology is inherited from the product of the finite discrete spaces.
The product is compact and Hausdorff, and the compatibility equations define a closed subset. Conditions on finitely many coordinates give clopen neighbourhoods; in particular kernels of finite quotient projections form an identity-neighbourhood basis. Conversely, every compact Hausdorff totally disconnected topological group is recovered from its finite quotients by open normal subgroups.
For example, the additive group of p-adic integers is . Compatibility says that a residue modulo reduces to the preceding residue modulo . The ordinary integers map densely into this group. Compactness belongs to the completed inverse limit; the profinite topology on the integers is not compact. [ref]
Programming language Created 2026-10-13 Updated 2026-10-14
A programming language specifies how programs are written and what their execution means. Its type system describes which operations may be combined; an abstract syntax tree records the structure on which these rules act. The examples under type system use a small teaching language with integers, Boolean values and function types.
// Target: computer-science.bigb
Program variable 2026-11-05
A program variable is a named binding or storage abstraction used to supply a value during execution of a computer program. Its precise meaning belongs to the programming language semantics: some languages describe mutable storage locations, while others emphasize names associated with values. The current semantic environment and program state determine what an occurrence denotes. A mathematical variable and a program variable consequently need not obey the same rules.
For example, in Python, executing x = 3 followed by x = x + 1 first evaluates the right-hand program expression using the old binding and then binds x to the resulting integer 4. This variable assignment is a change in the program state, not the equation .[ref]
Binding a second name does not necessarily copy the underlying data. After a = list() and b = a, executing b.append(7) changes the list also reached through a. By contrast, b = list() rebinds only b. Distinguishing changes to data from changes to names makes shared mutable structures easier to reason about.[ref]
Progressive number 2026-10-20
A positive integer for which some division with integers and has as consecutive terms of a geometric progression in some order. Writing a reduced common ratio as with and , the three terms have the form for a positive integer .