2-adic absolute value 2026-10-14
The 2-adic absolute value is the p-adic absolute value for the prime number . It is defined on the rational numbers by for and , and extends to their P-adic number completion . For a nonzero integer, count factors of two until the remaining factor is odd; for a rational number, subtract the denominator's count from the numerator's count.
The associated metric reverses a familiar comparison:Although is eight units from on the ordinary number line, it agrees with modulo , whereas already disagrees modulo . The 2-adic absolute value measures that agreement. The value also shows why this Non-Archimedean absolute value must be distinguished from the ordinary absolute value .
Ordinary absolute value and 2-adic absolute value give different distance patterns for the same sixteen integers
. Details. In the left panel, differences farther from the diagonal grow in ordinary absolute value. In the right panel, nonzero even differences are closer than odd differences, and each further factor of two halves the 2-adic absolute value. The highlighted pairs have opposite distance rankings. The repeated pattern is the nested congruence class structure of an ultrametric space, visible without adding any new points.
2-adic valuation Created 2026-09-24 Updated 2026-11-05
Aart Blokhuis 2026-11-05
Aart Blokhuis is a mathematician working in finite geometry and combinatorics. With G. Eric Moorhouse, he calculated characteristic- rank formulas for the point-hyperplane incidence matrix of a set system associated with finite quadrics, and applied them to bounds and nonexistence results for ovoids.[ref]
The coefficient field is essential to this method. For an elementary illustration, the integer matrix has rank two over , but rank one over . Relations revealed by reduction modulo a prime number can therefore constrain configurations that a characteristic-zero calculation misses. His paper on few-distance sets provides another example of turning geometric restrictions into algebraic counting bounds.[ref]
https://research.tue.nl/files/2441775/53747.pdf. Author thesis, Few-distance sets, title and mathematical development
Let be distinct prime numbers. Every group of group order is Abelian if and only if does not divide .
For sufficiency, the Sylow theorems make the number of Sylow p-subgroups one of , congruent to one modulo . The divisibility hypothesis excludes both nontrivial choices, so that subgroup is normal. The number of Sylow subgroups for is one of , congruent to one modulo . The choice is impossible because . If divided , primality and would force , hence ; this pair violates the hypothesis. Thus the other Sylow subgroup is normal too. Their intersection is trivial, and their group commutators lie in that intersection, so the group is their direct product of groups. A group of prime-square order is abelian: its nontrivial center of a group is either the whole group or has cyclic quotient, and a cyclic central quotient also forces commutativity. Both factors are therefore abelian.
For necessity, suppose . The multiplicative group of a finite field is cyclic, so contains of order . Let the cyclic group act on the additive group of by mapping its generator to multiplication by . This is a well-defined nontrivial group action, since . The resulting semidirect product has order and is nonabelian, because the generator does not commute with a nonzero field element. Thus a nonabelian group of this order exists exactly when .
Fix a prime number . Take the full subcategory of finitely generated abelian groups with no element of order . It is closed under finite direct sums and subgroups. If is the -primary torsion subgroup, the map is a reflection into this subcategory: every map to an allowed group kills . Therefore ordinary kernels in a category and reflected cokernels in a category supply all finite categorical limits and colimits. No nonzero finitely generated group has zero reflection, so the epimorphisms are precisely surjections and are all conormal epimorphisms. Multiplication by on is a monomorphism but not a normal monomorphism: its cokernel here is , whose kernel is , not . Multiplication by is normal; composing it with itself gives this nonnormal monomorphism.
Affine Galois group of a prime-radical splitting field Created 2026-10-14 Updated 2026-11-05
For distinct or equal prime numbers , the polynomial is Eisenstein at . Its splitting field over has Galois group a subgroup of , which is nontrivial because a degree- radical cannot belong to a degree- cyclotomic field. Thus the full Galois group has order . On roots indexed by , all automorphisms act as . Equality of orders identifies the group with the full affine group over a finite field.
// Target: algebra.bigb
Agrawal–Biswas primality test Created 2026-09-24 Updated 2026-11-05
The Agrawal–Biswas primality test tests a formal polynomial identity in :For , the identity holds exactly when is a prime number. Testing a formal polynomial is stronger than evaluating it at residues.
The randomized algorithm first handles prime numbers at most thirteen, divisibility by them, and perfect powers. For remaining , choose a monic polynomial of polynomial degree , with independent uniform lower coefficients modulo . Compute the remainder of modulo using exponentiation by squaring. A nonzero remainder proves compositeness. The monic polynomial permits division even when the coefficient ring has zero divisors.
Every prime number passes. After preprocessing, a composite number is rejected with probability at least per trial, so independent trials give error at most . Keeping remainders below polynomial degree makes the computation polynomial time in the bit length of .[ref]
A group of prime order is cyclic Created 2026-10-18 Updated 2026-11-05
Let have group order equal to a prime number . Choose any . By Lagrange's theorem, the order of a group element divides , and it is greater than one. It is therefore , so the cyclic subgroup generated by is all of . This proves that every nonidentity element generates , and is isomorphic to the additive group of integers modulo .
Algebraic number theory Created 2026-09-24 Updated 2026-10-18
Algebraic number theory studies integer factorization, divisibility, prime ideals, and units after extending the rational numbers to a number field. Its basic objects are a number field and its ring of integers : the counterparts of and . The field norm turns multiplication in into multiplication of rational numbers, and takes algebraic integers to integers. These connections let linear algebra and Euclidean geometry answer arithmetic questions.[ref]
https://www.jmilne.org/math/CourseNotes/ANT.pdf. J. S. Milne, Algebraic Number Theory, introduction and Chapter 2
A first example is with ring of integers . The integer acquires the factorizationEach factor has field norm . Neither is a unit, and each is an irreducible element: any factorization into two nonunits would factor the prime number into two integers of absolute value greater than one. Arithmetic in a larger ring thus reveals structure invisible in ordinary integer factorization.
There is also a complication: unique factorization of elements can fail, as in the failure of unique factorization in the ring of integers generated by square root of minus five. The general replacement is prime ideal factorization. The ideal class group measures the obstruction to making every ideal a principal ideal.
The historical motivation is visible in Richard Dedekind's original 1877 exposition: he begins with ordinary integer factorization, passes to Gaussian integers, and then uses a quadratic example to explain why ideals are needed. His later section establishes unique factorization of ideals in a number field. This is a direct record of the development of the theory, rather than a claim that all its ideas originated in one year.[ref]
https://www.numdam.org/item/BSMA_1877_2_1_1_69_0.pdf. Richard Dedekind, Sur la théorie des nombres entiers algébriques, 1877, Section II, §§5–10
[ref]https://www.numdam.org/item/BSMA_1877_2_1_1_207_1.pdf. Dedekind, continuation, 1877, §25
Almost-primes from an upper-bound sieve and Buchstab identity Created 2026-09-28 Updated 2026-11-05
Let be a product of fixed pairwise nonproportional linear polynomials with positive integer leading coefficients. Assume admissibility: no prime number divides for every integer . There are constants such that, for all large , at least values have no prime factor of below . These are almost prime values with a bounded total number of prime factors, counted with multiplicity.
A rigorous positive count needs a lower-bound sieve input, obtainable from the fundamental lemma of sieve theory. If counts roots modulo squarefree , then the polynomial root density in a sieve gives . Take distribution level and sifting limit . The total remainder up to is , while Mertens' theorems give . Choosing sufficiently small makes the main-term error in the fundamental lemma of sieve theory less than half the main term, proving the lower count.[ref]
Some sieve theory by Terence Tao (254A Notes 4). Corollary 19; equation (26) and Corollary 21 illustrate the two-linear-form case
Since , each surviving nonzero value has at most prime factors, with multiplicity. The Buchstab identity organizes the removal of successive prime factors, and upper-bound sieves control removed terms; merely observing convergence of a prime tail does not establish that its subtraction leaves a positive main term.
Arithmetic derivative Created 2026-10-20 Updated 2026-11-05
The arithmetic derivative on positive integers is specified by for each prime number and the product rule . These conditions force . For a prime factorization they giveRepeated use of the product rule proves necessity. Conversely, the fundamental theorem of arithmetic makes this formula well-defined, and the addition of prime exponents under multiplication verifies the product rule. Thus it proves existence as well as uniqueness.[ref]
How to Differentiate a Number by Victor Ufnarovski and Bo Åhlander. §1, Theorem 1, printed p. 2: factorization formula, uniqueness and verification of the Leibniz rule
For example, . Despite its name, the arithmetic derivative does not preserve addition: , whereas . Its analogy with an ordinary derivative preserves the product rule while sacrificing the usual sum rule.
Base-p digit sum Created 2026-09-28 Updated 2026-10-18
For a nonnegative integer and integer base , write its base-p expansion asThe base- digit sum is , with . When is a prime number, the Legendre formula becomesTo see the connection, divide the base-p expansion by and discard the fractional part. Swapping the resulting finite sums and using a finite geometric series givesIn particular, , so and . The leading numeral digit contributes thirteen, the next contributes eight, the next one, and the units contribute zero. Thus the base-p digit sum compresses the same contribution ledger into information already present in positional notation.
Bertrand's postulate Created 2026-10-07 Updated 2026-11-05
For every integer , there is a prime number strictly between and . This supplies cyclic prime moduli comparable to an integer interval's length in additive combinatorics.
Biquadratic residue 2026-10-24
Bi-unitary divisor Created 2026-10-20 Updated 2026-11-05
A positive divisor of a positive integer is bi-unitary when the greatest common unitary divisor of and is . The comparison uses unitary divisors, so it differs from requiring the ordinary greatest common divisor to be one.
For with a prime number and , consider , where . The only possible nontrivial common unitary divisor of and occurs when . Consequently every divisor is bi-unitary except when is even.
For example, the bi-unitary divisors of are ; only is excluded. Its unitary divisors are just and , showing that these two notions differ substantially. For a general positive integer, apply the prime-power condition independently to each prime factor in its prime factorization.
Bo Åhlander 2026-11-05
Bo Åhlander coauthored a study of the arithmetic derivative with Victor Ufnarovski. The operation is determined on positive integers by assigning one to each prime number and imposing the product rule. Thus the derivative of is , illustrating an arithmetic analogue of differentiation built from integer factorization.[ref]
Carmichael function Created 2026-09-24 Updated 2026-10-20
For an integer , the Carmichael function is the exponent of a finite group for the unit group : the least positive integer for whichHere the greatest common divisor condition selects the units. Euler's totient function counts them; the Carmichael function gives their least common return exponent.[ref]
Modulo eight, the units are , and their squares are all congruent to one. Their multiplicative orders are , so although . Modulo fifteen, the units have multiplicative orders . For example, the powers of two return through . Thus although ; the multiplicative order of four is only two.
The three quantities are related byA common return exponent must be a multiple of every multiplicative order, hence of their least common multiple. Conversely, that least common multiple makes every unit return to one. Lagrange's theorem makes each multiplicative order divide the group order , proving the final divisibility. The Carmichael function applies to all units at once, while the multiplicative order concerns a chosen unit.
For the prime factorization with distinct prime numbers and , the formulas areThese are least common multiples, rather than products: . The convention handles the trivial case separately.[ref]
The Chinese remainder theorem for unit groups explains the least common multiple: a power returns to one in every prime power component exactly when it is a multiple of each component's exponent of a finite group. For an odd prime power, the unit group is a cyclic group of group order . For , the unit group modulo is a direct product of groups , generated by the classes of and five, so its exponent of a finite group is .[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. Section 7.5, pp. 203–205, Theorem 7.28 and its proof
This gives a uniform reduction for modular exponentiation: for a unit and a nonnegative integer , reduce modulo . For example, because . The unit hypothesis matters: , but . Computing the formula assumes the prime factorization is available. The same common-exponent viewpoint explains Carmichael numbers: a composite number passes the Fermat primality test for every unit base exactly when . For example, .
Carmichael number Created 2026-09-24 Updated 2026-10-18
A Carmichael number is a composite number for whichEvery unit modulo satisfies the same modular congruence supplied by Fermat's little theorem for a prime number. The name refers to Robert Daniel Carmichael. The coprime qualification is essential: a nonunit can expose a prime factor through a greatest common divisor calculation. A Carmichael number is therefore a Fermat pseudoprime to every coprime base, rather than to every nonzero residue class.[ref]
Carmichael Numbers and Korselt's Criterion by Keith Conrad. Definition 1, printed p. 1: composite input and coprime bases
For example,The factors are distinct prime numbers. Their predecessor numbers all divide , so Korselt criterion applies. More explicitly, for any integer coprime to , Fermat's little theorem givesThe Chinese remainder theorem combines these into . This proves all coprime bases pass from three short divisibility checks, rather than from a long table of sampled bases.
Equivalently, a composite is a Carmichael number exactly when for every integer , including nonunits. The equivalence follows from Korselt criterion: modulo each prime factor, either is zero or its nonzero power returns to one, and squarefreeness combines those congruences. This does not say a nonunit satisfies . For instance gives , while ; the greatest common divisor already supplies the factor three.[ref]
The Carmichael function supplies another compact description: a composite is Carmichael exactly when . For , and . In contrast, Euler's totient function gives , which does not divide . The least common return exponent, rather than the number of units, controls this test.
The obstruction is useful to know when interpreting a Fermat primality test: even checking every coprime base cannot certify primality. The passing-base fraction for the Fermat test makes this failure quantitative. Stronger primality tests require additional structure, such as the squaring conditions in a Miller-Rabin primality test.
The historical record predates the name. Václav Šimerka's 1885 paper lists on printed page 224, together with factorizations. This is an early published list of examples, independently of their later name.[ref]
Zbytky z arithmetické posloupnosti by Václav Šimerka. Zbytky z arithmetické posloupnosti, printed p. 224, §9: list beginning with 561 and 1105; archive title sheet identifies Václav Šimerka and 1885
Let be a prime number, let with , and let be the sum of partition sizes at level of the core tower of a partition . ThenIndeed . Carrying units from position to position decreases by . Normalization to the base- digits therefore gives , with equality exactly when no carry is needed. The P-adic valuation of a symmetric-group character degree from the core tower is the difference divided by .
Characteristic of an integral domain 2026-10-31
The positive characteristic of a ring which is an integral domain is a prime number. The characteristic cannot be one because . If its least positive value were with , minimality would make and nonzero, while would give zero divisors.
The analogous result holds for a nonzero commutative nonunital ring without zero divisors, using the characteristic of a rng. If were composite and minimal, choose with . For every , , so cancellation forces for every , contradicting minimality of .


