Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Number Theory

256 missions · 161 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

Open95Completed161All256
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 27 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 41 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 85 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 159 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

2 thms1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 151 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 241 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 6101 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 97041 PrimesResearch Paper

Schnirelmann showed around 1930, by elementary means, that some absolute constant kkk makes every integer n>1n > 1n>1 a sum of at most kkk primes. For odd nnn:

1 thm1 active userReviewed
Captain: LG

Brocard's Conjecture: Four Primes Between Consecutive Prime SquaresOpen Problem

For n≥1n \ge 1n≥1 let pnp_npn​ denote the nnn-th prime. Brocard's conjecture, named after Henri Brocard, asserts that for every n≥2n \ge 2n≥2 there are at least four primes strictly between pn2p_n^2pn2​ and pn+12p_{n+1}^2pn+12​ (Wikipedia). It belongs to the family of "primes between consecutive squares" problems together with Legendre's conjecture, and it is a concrete, elementary-looking…

4 thms1 active userReviewed
🏆Completed
Captain: xuanji

Every Odd Number Greater Than 1 is the Sum of at Most 100001 PrimesResearch Paper

Goldbach's problem asks whether every integer greater than 111 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 kkk such that every integer n>1n > 1n>1 is a sum of at most kkk primes. His argument is elementary. It uses an upper-bound sieve and…

1 thm1 active userReviewed
🏆Completed
Captain: Yuxuan Xu

Equal Sums of Two Squares: Parametrization and Infinite Primitive FamiliesResearch Paper

The representation function r2(n)=#{(a,b)∈Z2:a2+b2=n}r_{2}(n)=\#\{(a,b)\in\mathbb Z^{2}:a^{2}+b^{2}=n\}r2​(n)=#{(a,b)∈Z2:a2+b2=n} is one of the oldest objects in number theory. Fermat characterised the integers with r2(n)>0r_{2}(n)>0r2​(n)>0 — those in which every prime congruent to 333 modulo 444 occurs to an even power — and Euler's proof supplied the closed form r2(n)=4 (d1(n)−d3(n))r_{2}(n)=4\,(d_{1}(n)-d_{3}(n))r2​(n)=4(d1​(n)−d3​(n)), where dj(n)d_{j}(n)dj​(n) counts…

13 thms1 active userReviewed
🏆Completed
Captain: willcook

Weighted support criteria for reciprocal Mersenne subseries (Erdős #257)Research Paper

For every integer base b≥2b\ge2b≥2, a finite-prime weighted summability witness on a positive-integer host HHH makes the reciprocal Mersenne series irrational on every infinite subset of HHH. 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…

4 thms1 active userReviewed
🏆Completed
Numerical Analysis·Captain: Yuxuan Xu

Research Notes on ζ(9): Constructions, Computations, and Open Problems(v0.1)Research Paper

A standard way to prove that a real number α\alphaα is irrational is to produce integer linear forms b+aαb+a\alphab+aα that are nonzero but arbitrarily small: if α=p/q\alpha=p/qα=p/q were rational, then bq+apbq+apbq+ap would be a nonzero integer of absolute value below 111 once the form is smaller than 1/q1/q1/q. This is the shape of every hypergeometric construction of linear forms in odd zeta…

8 thms1 active userReviewed
🏆Completed
Algebraic TopologyDynamical SystemsMathematical Physics·Captain: lisamegawatts

Winding Arithmetic III: Faithful Dense Phase CharacterResearch Paper

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 α\alphaα, the map

15 thms1 active userReviewed
🏆Completed
Algebraic TopologyDynamical SystemsMathematical Physics·Captain: lisamegawatts

Winding Arithmetic II: Conserved Phase BasesResearch Paper

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 α\alphaα, the phases eiαne^{i\alpha n}eiαn attached to distinct integers nnn are linearly independent over the field …

13 thms1 active userReviewed
🏆Completed
Combinatorics·Captain: moutei

Erdős #131: the ELRSS bound F(N) < 3·sqrt(N) + 1 (the open problem itself is NOT settled)Open Problem

What this mission proves, and what it does not. The goal theorem is the explicit upper bound F(N)<3N+1F(N)<3\sqrt N+1F(N)<3N​+1 of Erdős, Lev, Rauzy, Sándor and Sárközy (1999) — a published result, now formally verified here. Erdős problem #131 itself is NOT solved by this mission. Erdős asked for the order of growth of F(N)F(N)F(N), which is known only to lie between N1/5N^{1/5}N1/5 and …

16 thms1 active userReviewed
🏆Completed
Combinatorics·Captain: mysticflounder

Modular Schur numbers: a uniform closed form in the stable-colour regimeResearch Paper

A set of integers is sum-free when no two of its members add up to a third. Schur's theorem (1916) says that for every kkk there is a largest interval [1,N][1,N][1,N] that can be split into kkk sum-free classes, and the resulting Schur numbers S(k)S(k)S(k) are notoriously hard to compute: S(5)=160S(5) = 160S(5)=160 was settled only in 2018, by a SAT computation with a machine-checked proof…

19 thms1 active userReviewed
🏆Completed
AlgebraAnalysis·Captain: lisamegawatts

Lindemann–Weierstrass I: Exponential IndependenceResearch Paper

The exponential function turns addition into multiplication. When its inputs are algebraic numbers, that elementary identity meets a rigid arithmetic boundary: distinct algebraic exponents cannot produce an algebraic linear relation among their exponentials. This principle is the Lindemann–Weierstrass theorem, one of the central results of transcendence…

12 thms1 active userReviewed
🏆Completed
Captain: lisamegawatts

Integer Winding Transcendence I: Exponential Phase IndependenceTextbook

Integer winding is one of the simplest ways that continuous geometry produces discrete arithmetic. A loop in the circle has an integer winding number, while the complex exponential turns an additive parameter into a multiplicative phase. This mission asks what arithmetic information survives when those two constructions are combined. Its answer is a…

6 thms1 active userReviewed
Captain: davidloeffler

Kriz–Nordentoft: Horizontal p-adic L-functionsResearch Paper

Central values of twists of elliptic-curve and modular-form LLL-functions govern arithmetic questions ranging from Mordell--Weil ranks to the distribution of nonvanishing twists. Classical Iwasawa theory organizes twists whose conductors grow vertically through powers of one prime. Kriz and Nordentoft introduce a horizontal analogue in which the order of the…

7 thms1 active userReviewed
🏆Completed
AlgebraRepresentation Theory·Captain: LG

Ngo's Fundamental Lemma I: Discriminant, Resultant and the Transfer FactorResearch Paper

The fundamental lemma is a family of identities between orbital integrals on a reductive group and stable orbital integrals on a smaller group attached to it, its endoscopic group. Langlands isolated these identities in the 1970s as the last missing ingredient in the comparison of trace formulas, and Langlands and Shelstad formulated them precisely in 1987;…

7 thms1 active userReviewed
🏆Completed
Machine Learning·Captain: raver1975

The Alethean CatalogResearch Paper

This mission curates the formalized output of Alethean — an Autonomous Logic Engine for Theorem Hunting, Exploration, And Navigation (alethean.org). Alethean autonomously generates research directions, develops them into research papers, and formalizes their results in Lean 4 — an "ever-expanding registry of absolute mathematical truths," built with the Aris…

12 thms1 active userReviewed
Pure Mathematics·Captain: xbgxjack

Erdős Problem 287: Gaps Between Unit-Fraction DenominatorsOpen Problem

A unit fraction is the reciprocal 1/n1/n1/n of a positive integer. The number 111 can be written as a sum of distinct unit fractions in infinitely many ways — 1=12+13+161 = \tfrac12+\tfrac13+\tfrac161=21​+31​+61​, 1=12+14+16+1121 = \tfrac12+\tfrac14+\tfrac16+\tfrac1{12}1=21​+41​+61​+121​, and so on — and the combinatorics of such representations is one of the oldest recurring themes in Erdős's problem lists. Most…

13 thms1 active userReviewed
🏆Completed
Captain: Mayank Kumar

Fundamental Theorem of ArithmeticTextbook

Every introductory number theory course opens with the same fact: the integers factor into primes in exactly one way. Euclid's Elements (Book IX, Proposition 14) already proves a form of it for the case of two factorizations sharing no further structure, but the theorem is not stated in full generality — with existence and uniqueness as a single package —…

3 thms1 active userReviewed
Captain: xuanji

There is no Diophantine quintupleResearch Paper

Diophantine equations ask for integer solutions to arithmetic equations. One family of questions starts with a set of positive integers and imposes the same condition on every pair: their product, increased by one, must be a square. The question is how many distinct integers can satisfy all those conditions together. It connects a simple definition with a…

1 thm1 active userReviewed
PreviousPage 10 of 11Next

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