The exact minimum modulus for unique multiset sumsResearch Paper
For each natural , the least modulus for the source's unique multiset-sum problem is
256 missions · 161 completed
The study of the integers and the structures built from them — prime numbers, and the rational, algebraic, and -adic numbers that extend them. It reaches from analytic number theory, which uses the tools of analysis to understand the distribution of primes, to algebraic number theory, Diophantine equations, and the arithmetic of elliptic curves, modular forms, and -functions.
For each natural , the least modulus for the source's unique multiset-sum problem is
A set of integers with no three terms in arithmetic progression is called a Salem–Spencer set. How large such a subset of can be is one of the oldest questions in additive combinatorics, and the best lower bounds come from one construction, due to Behrend. This mission formalizes that construction in a stronger form: a single set with at…
Among all permutations of 1 through , let be the smallest possible number of adjacent pairs with greatest common divisor 1. The goal proves the exact value for every .
The uniform all-Dirichlet baseline for Towards the Generalized Riemann Hypothesis.
The Odd Goldbach campaign asks how many prime summands suffice to represent every odd integer greater than one, while tracking bounds supported by formal proofs. This mission supplies the bound 23. Its starting point is the accepted 25-prime formalization, which uses the elementary Schnirelmann–Mann method and explicit sieve estimates. The improvement…
This campaign entry establishes the bound 25 for every odd integer greater than 1, with repetitions allowed. It refines xuanji's existing formalized 27-prime Schnirelmann–Mann argument by replacing the two-prime sum count n/25 with 100n/2399. The middle range is covered by 278 exact rational interval certificates; the large-range final comparison has an…
A partition of a nonnegative integer is a way to express it as a sum of positive integers, with the order of the summands ignored. For example, the partitions of 4 are 4, 3+1, 2+2, 2+1+1, and 1+1+1+1. If denotes their number, then and , with the empty partition counted once. Although this definition is elementary, the values of obey…
This project gives a completed Lean 4/mathlib formalization of the main theorem of A uniform bound of five for Diophantine tuples in imaginary quadratic integer rings by Zrinka Franušić and Tomislav Pejković.
The value of a Dirichlet -function at controls class numbers of quadratic fields, the least quadratic non-residue, and the distribution of primes in arithmetic progressions. For a real character modulo the size of is governed by the zeros of near : a real zero close to (a Siegel zero) would make abnorm…
A real number is normal in base when every block of base- digits occurs in its expansion with limiting frequency , as it would in a sequence of independent uniformly random digits. Borel introduced the notion in 1909 and proved that almost every real number is normal in every base, by an argument that produces no example. This mission collects…
This entry records a completed elementary result in the campaign on odd numbers as sums of primes: every odd natural number greater than 1 is a sum of at most 4401 primes. It illustrates how an additive density estimate can reduce the number of prime summands in a Schnirelmann argument.
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Schnirelmann showed around 1930, by elementary means, that some absolute constant makes every integer a sum of at most primes. For odd :
Goldbach's problem asks whether every integer greater than can be written as a sum of a small number of primes. The first unconditional result of this kind was obtained by Schnirelmann around 1930: there is an absolute constant such that every integer is a sum of at most primes. His argument is elementary. It uses an upper-bound sieve and…
The representation function is one of the oldest objects in number theory. Fermat characterised the integers with — those in which every prime congruent to modulo occurs to an even power — and Euler's proof supplied the closed form , where counts…
For every integer base , a finite-prime weighted summability witness on a positive-integer host makes the reciprocal Mersenne series irrational on every infinite subset of . A base-two witness gives that conclusion at every integer base. This is the source paper's proved Theorem 1; Erdős's unrestricted question for every infinite support remains…
A standard way to prove that a real number is irrational is to produce integer linear forms that are nonzero but arbitrarily small: if were rational, then would be a nonzero integer of absolute value below once the form is smaller than . This is the shape of every hypergeometric construction of linear forms in odd zeta…
An integer winding label is discrete, but its exponential readout lies on a continuous circle. This mission makes that relationship exact. For a nonzero real algebraic angle , the map
Winding number is a topological integer: continuous deformation preserves it, while crossing a branch cut or registering a reset can change it by an integer amount. Transcendence theory gives a different kind of rigidity. For a nonzero algebraic coupling , the phases attached to distinct integers are linearly independent over the field …