Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Number Theory

219 missions · 139 completed

The study of the integers and the structures built from them — prime numbers, and the rational, algebraic, and ppp-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 LLL-functions.

Missions

Open80Completed139All219
🏆Completed
Combinatorics·Captain: aarontcao

Shao's three units theorem: density 5/8 forces a three-fold additive basisResearch Paper

Let mmm be an odd squarefree positive integer and let AAA be a set of units modulo mmm with ∣A∣>58φ(m)|A| > \frac{5}{8}\varphi(m)∣A∣>85​φ(m). Then A+A+A=Z/mZA + A + A = \mathbb{Z}/m\mathbb{Z}A+A+A=Z/mZ: every residue class, unit or not, is a sum of three elements of AAA.

10 thms4 active usersReviewed
🏆Completed
Algebra·Captain: Lucas

Grothendieck-Teichmüller: the graded Lie algebra grt_1 and the Deligne-Drinfeld-Ihara conjectureOpen Problem

The Grothendieck-Teichmüller group organises a family of symmetries that act on braided monoidal categories, on quantised universal enveloping algebras, on the little-discs operad, and on the ring of periods of the projective line minus three points. Three versions exist: a profinite one GT^\widehat{GT}GT, introduced by Grothendieck and Drinfeld and containing…

29 thms4 active usersReviewed
🏆Completed
AlgebraRepresentation Theory·Captain: Lucas

Ngo's Fundamental Lemma II: Isogenies of Root Data and Paired GroupsResearch Paper

Waldspurger's non-standard fundamental lemma is an identity between stable orbital integrals on the Lie algebras of two reductive groups that are not isomorphic, and not even isogenous as algebraic groups, but whose root data become identified after tensoring with Q\mathbb{Q}Q. The basic example is the pair (Sp2n,SO2n+1)(\mathrm{Sp}_{2n}, \mathrm{SO}_{2n+1})(Sp2n​,SO2n+1​), whose root…

4 thms4 active usersReviewed
🏆Completed
Analytic Number TheoryHarmonic Analysis·Captain: dbenbenn

New large value estimates for Dirichlet polynomials (Guth–Maynard 2026)Research Paper

This mission formalizes L. Guth and J. Maynard, New large value estimates for Dirichlet polynomials, Ann. of Math. (2) 203 (2026) 623–675, doi:10.4007/annals.2026.203.2.6 (arXiv:2405.20552v2, whose page numbers are used).

34 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Integer Factorization: Why Two-Item Joint Replenishment Is Hard 2: For Odd Composite M, Every Optimal Plan of an Explicit Two-Item Periodic JRP Instance Has q₂ = M and 1 < gcd(q₁, M) < MResearch Paper

The joint replenishment problem (JRP) is a basic model of inventory coordination: several items are ordered from one supplier, each item pays its own ordering and holding costs, and an additional item-independent joint ordering cost rewards ordering the items at common times. Two accounting conventions are studied. In the periodic JRP (also called the…

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Integer Factorization: Why Two-Item Joint Replenishment Is Hard 1: For Odd Composite M, Every Optimal Plan of an Explicit Two-Item Aperiodic JRP Instance Has q₂ = M and 1 < gcd(q₁, M) < MResearch Paper

The joint replenishment problem (JRP) is one of the basic models of multi-item inventory control. Each item follows the economic order quantity (EOQ) model of Harris (1913): ordering costs a fixed amount, holding stock costs a rate proportional to the stock, and the classical trade-off between the two determines how often to reorder. In a JRP, items…

9 thms3 active usersReviewed
🏆Completed
CombinatoricsGroup Theory·Captain: Lucas

Landau's Function: Growth of the Maximal Order of a PermutationResearch Paper

How large can the order of a single permutation of nnn objects be? The answer, Landau's function g(n)g(n)g(n), is a basic invariant of the symmetric group SnS_nSn​: it is the maximum number of times a permutation can be iterated before it returns to the identity. Because the order of a permutation is the least common multiple of its cycle lengths, g(n)g(n)g(n) is also the largest…

13 thms3 active usersReviewed
🏆Completed
AnalysisCombinatorics·Captain: FormallyCorrect

Ramanujan's Notebooks (Berndt)Textbook

The notebooks Ramanujan kept in India record identities, evaluations, transformations and general principles, usually presented without proofs. They preserve a working mathematician's collection rather than a textbook arranged around a sequence of prerequisite theorems. The Tata Institute of Fundamental Research published an unedited facsimile edition in…

50 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOptimization·Captain: mikedeng1

Nonsmooth Optimization via Quasi-Newton Methods III: The Secant Method on |x| Generates the Alternating Binary Expansion of x₀Research Paper

Quasi-Newton methods such as BFGS were designed for smooth objectives, yet in practice they are routinely run on nonsmooth functions and they often work well there: on many nonsmooth problems the iterates converge to a minimizer at a linear rate, measured against the total number of function evaluations. Lewis and Overton (Math. Program. 141 (2013) 135–163)…

7 thms3 active usersReviewed
🏆Completed
Group TheoryTheoretical Computer Science·Captain: mikedeng1

New Techniques for Noninteractive Zero-Knowledge 3: The Subgroup-Decision (BGN) Commitment Is Perfectly Binding and Extractable, with a Perfectly Sound, Witness-Indistinguishable 0/1 ProofResearch Paper

A non-interactive zero-knowledge (NIZK) proof lets a prover convince a verifier that a statement is true by sending a single message, without revealing why it is true. NIZK proofs are a basic building block of public-key cryptography: chosen-ciphertext secure encryption, signature schemes and secure multi-party computation all use them. Groth, Ostrovsky and…

13 thms3 active usersReviewed
🏆Completed
Mathematical Logic·Captain: marwahaha

Single-fold Diophantine representationsOpen Problem

A Diophantine representation translates membership in a computably enumerable set into solvability of one polynomial equation. The source asks whether the entire auxiliary witness can always be made unique. The source is OpenAI's September 2026 manuscript.

48 thms3 active usersReviewed
🏆Completed
AlgebraCombinatorics·Captain: wurtle

The circulant Hadamard conjectureResearch Paper

A Hadamard matrix of order nnn is an n×nn\times nn×n matrix with entries ±1\pm1±1 whose rows are mutually orthogonal, HHT=nInHH^{\mathsf T}=nI_nHHT=nIn​. Such matrices are extremal for Hadamard's determinant bound and are used throughout coding theory, experimental design and signal processing. Imposing a circulant structure, where every row is a cyclic shift of the first, links the…

47 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: wurtle

Short Egyptian fractionsResearch Paper

An Egyptian-fraction expansion writes a positive rational number as a sum of distinct unit fractions 1/n1/n1/n. Every fraction a/ba/ba/b with 1≤a<b1\le a<b1≤a<b has one, by the greedy algorithm, but greedy expansions can be long. The basic quantitative question is how many terms are needed in the worst case for a fixed denominator bbb. Let N(a,b)N(a,b)N(a,b) be the least length of an…

58 thms3 active usersReviewed
🏆Completed
Probability·Captain: wurtle

The joint Dickman law for consecutive integersResearch Paper

Let P+(n)P^+(n)P+(n) be the largest prime factor of an integer n≥2n\ge2n≥2. The classical theory of smooth numbers (Dickman 1930, Ramaswami 1949, de Bruijn 1951) shows that log⁡P+(n)/log⁡n\log P^+(n)/\log nlogP+(n)/logn has a limiting distribution: the proportion of n≤Xn\le Xn≤X with P+(n)≤XaP^+(n)\le X^aP+(n)≤Xa tends to ρ(1/a)\rho(1/a)ρ(1/a), where ρ\rhoρ is the Dickman function. Multiplicative structure of nnn and of n+1n+1n+1 is expected…

13 thms3 active usersReviewed
🏆Completed
CombinatoricsProbabilityTheoretical Computer Science·Captain: mikedeng1

A New Class of Random Number Generators 1: For Prime m = bʳ + bˢ − 1, Every Nontrivial Add-with-Carry Sequence Is Periodic After r Steps, with Period the Order of b mod mResearch Paper

Simulation, Monte Carlo integration and randomized algorithms consume long streams of numbers that should behave like independent uniform draws. A deterministic generator with finite state is eventually periodic, so its period is the first figure of merit: a stream cannot be longer than its cycle. G. Marsaglia and A. Zaman, A new class of random number…

17 thms3 active usersReviewed
🏆Completed
AlgebraTheoretical Computer Science·Captain: mikedeng1

Factoring Polynomials with Rational Coefficients III: A Reduced Basis of the Lattice of Multiples of h mod p^k Finds the Irreducible Factor h₀ = gcd(b₁, …, b_t)Research Paper

Factoring a polynomial with rational coefficients into irreducible factors is one of the basic tasks of computer algebra. Before 1982 the standard method (Berlekamp's algorithm modulo a small prime, Hensel lifting, then recombination of the ppp-adic factors, as in Zassenhaus's approach) could take exponential time, because the number of ways to recombine…

9 thms3 active usersReviewed
🏆Completed
Linear algebra·Captain: mikedeng1

Factoring Polynomials with Rational Coefficients I: A Reduced Lattice Basis Satisfies |b_j|² ≤ 2^{n−1}·max|x_i|² for Any t Linearly Independent Lattice VectorsResearch Paper

A lattice in Rn\mathbb R^nRn is the set of integer combinations of nnn linearly independent vectors. Many problems in algorithmic number theory, cryptography and integer programming reduce to finding a short nonzero vector of a lattice, or a few short independent ones. Finding the shortest vector exactly is hard, but in 1982 A. K. Lenstra, H. W. Lenstra, Jr. and…

8 thms3 active usersReviewed
🏆Completed
Discrete GeometryLinear OptimizationOperations Research·Captain: mikedeng1

Integer Programming with a Fixed Number of Variables 1: If B(p,r) ⊂ τK ⊂ B(p,R) with R/r ≤ c₁ and τK Misses the Lattice, Fewer Than 1 + c₁c₂√n Lattice Hyperplanes H + kbₙ Meet B(p,R)Research Paper

The integer linear programming feasibility problem asks, for an integer m×nm\times nm×n matrix AAA and b∈Zmb\in\mathbb Z^mb∈Zm, whether some x∈Znx\in\mathbb Z^nx∈Zn satisfies Ax≤bAx\le bAx≤b. It is NP-complete, so no algorithm polynomial in the length of the data is expected. H. W. Lenstra, Jr. (Math. Oper. Res. 8 (1983) 538–548) showed that the picture changes when the number of…

10 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

Explicit Expanders of Every Degree and Size 1: For Distinct Primes q₁, q₂, Every Large n Has an LPS Vertex Count Q(q₁, q₂, s, t) Between n and n + o(n)Research Paper

An (n,d,λ)(n,d,\lambda)(n,d,λ)-graph is a ddd-regular graph on nnn vertices in which every eigenvalue of the adjacency matrix other than the top eigenvalue ddd has absolute value at most λ\lambdaλ. Graphs of this kind with λ\lambdaλ small compared with ddd are expanders. They are used in derandomization, error-correcting codes, sorting networks and many other constructions in…

6 thms3 active usersReviewed
🏆Completed
Captain: xuanji

The irrationality measure of π is at most 7.606309 (Salikhov 2008)Research Paper

The irrationality measure μ(π)\mu(\pi)μ(π) is the supremum of the μ\muμ for which ∣π−p/q∣<q−μ|\pi - p/q| < q^{-\mu}∣π−p/q∣<q−μ has infinitely many rational solutions p/qp/qp/q. Every irrational number has μ≥2\mu \ge 2μ≥2 (Dirichlet), almost every real number has μ=2\mu = 2μ=2, and it is conjectured that μ(π)=2\mu(\pi) = 2μ(π)=2. Known upper bounds:

11 thms3 active usersReviewed
🏆Completed
Captain: xuanji

The irrationality measure of π is at most 7.103205334138 (Zeilberger–Zudilin 2020)Research Paper

The irrationality measure μ(π)\mu(\pi)μ(π) is the supremum of the μ\muμ for which ∣π−p/q∣<q−μ|\pi - p/q| < q^{-\mu}∣π−p/q∣<q−μ has infinitely many rational solutions p/qp/qp/q. Every irrational number has μ≥2\mu \ge 2μ≥2 (Dirichlet), almost every real number has μ=2\mu = 2μ=2, and it is conjectured that μ(π)=2\mu(\pi) = 2μ(π)=2. Known upper bounds:

7 thms3 active usersReviewed
🏆Completed
Captain: xuanji

The irrationality measure of π is at most 8.016046 (Hata 1993)Research Paper

The irrationality measure μ(π)\mu(\pi)μ(π) is the supremum of the μ\muμ for which ∣π−p/q∣<q−μ|\pi - p/q| < q^{-\mu}∣π−p/q∣<q−μ has infinitely many rational solutions p/qp/qp/q. Every irrational number has μ≥2\mu \ge 2μ≥2 (Dirichlet), almost every real number has μ=2\mu = 2μ=2, and it is conjectured that μ(π)=2\mu(\pi) = 2μ(π)=2. Known upper bounds:

11 thms3 active usersReviewed
🏆Completed
Captain: marwahaha

Mahler's irrationality bound for π: 42Research Paper

The irrationality of π\piπ rules out an exact representation as a rational number. A quantitative question asks how closely rational numbers can approximate it as their denominators grow. The irrationality measure records the threshold exponent for exceptionally accurate rational approximations. This mission formalizes the historical upper-bound milestone …

3 thms3 active usersReviewed
🏆Completed
Captain: Lucas

Chebotarëv's Density Theorem (Stevenhagen–Lenstra 1996)Research Paper

Given a monic polynomial fff with integer coefficients, one can reduce it modulo each prime ppp and factor it over the finite field Fp\mathbb F_pFp​. The way fff factors changes with ppp, and the question of how often each factorization pattern occurs has a precise answer: Chebotarëv's density theorem (1922). It is the common generalization of Dirichlet's theorem on…

21 thms3 active usersReviewed
🏆Completed
ProbabilityQuantum InformationTheoretical Computer Science·Captain: mikedeng1

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer 3: The Success Probability of Quantum Order FindingResearch Paper

The security of the RSA cryptosystem rests on the assumed difficulty of factoring large integers, and the best known classical algorithms for factoring run in super-polynomial time. In 1994 Peter Shor showed that a quantum computer can factor an nnn-digit integer in time polynomial in nnn (Shor, SIAM J. Comput. 1997; conference version FOCS 1994). The algorithm…

12 thms3 active usersReviewed
PreviousPage 2 of 6Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me