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
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
🏆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
🏆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
🏆Completed
Captain: wamlart

Elementary Number Theory: Primes, Congruences, and Secrets I: Sums of Two SquaresTextbook

Writing a positive integer as a sum of two squares is an elementary question with a precise general answer. Some integers have such a representation and others do not; checking a few small inputs does not explain the distinction. A criterion expressed through prime factorization instead decides the question for every positive integer. This project follows…

5 thms1 active userReviewed
🏆Completed
Algebra·Captain: tomasz

Senthil Kumar: Weierstrass elliptic and zeta valuesResearch Paper

Formalization status, 29 September 2026: the main theorem and all nine linked milestones are Proved, with zero Open leaves. The selected proof uses the now-Proved Philippon Theorem 2.1 and the completed Weierstrass application bridges. The linked statements retain their explicit formalization conventions and intermediate variants.

482 thms1 active userReviewed
🏆Completed
Pure Mathematics·Captain: tabbott

The Hardy-Littlewood Method I: Weyl's InequalityTextbook

The Hardy--Littlewood circle method is the principal analytic tool for counting solutions to additive equations in integers. Introduced by Hardy and Ramanujan for the partition function and developed by Hardy and Littlewood in their Partitio Numerorum series (1920--1928), it produces asymptotic formulae for the number of representations of a large integer nnn…

16 thms1 active userReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: ShouqiaoWang

Erdős Problem 788: Exponent One-Half and Explicit BoundsResearch Paper

Erdős Problem 788 asks how large a set can always be retained when prescribed distinct pair-sums are forbidden. This mission formalizes the repository’s strengthened version of Theorem 1.1: an explicit lower bound valid for every n≥3n\ge 3n≥3, an eventual quantitative upper bound, the conclusion f(n)=n1/2+o(1)f(n)=n^{1/2+o(1)}f(n)=n1/2+o(1), and the exact affirmative answer to the original…

6 thms1 active userReviewed
PreviousPage 7 of 7Next

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