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
Analytic Number Theory·Captain: LG

The Music of the Primes: the Riemann hypothesis for Hecke LLL-functionsResearch Paper

The distribution of prime ideals in a number field FFF is governed by the zeros of its Hecke LLL-functions. The generalized Riemann hypothesis (GRH) asserts that, for every unitary Hecke character χ\chiχ of FFF, every nontrivial zero of the completed LLL-function L(s,χ)L(s,\chi)L(s,χ) lies on the critical line Re⁡(s)=12\operatorname{Re}(s)=\tfrac12Re(s)=21​. GRH is the central unproved statement…

10 thms2 active usersReviewed
Analytic Number Theory·Captain: LG

Infinitude of Mersenne Primes (Lenstra–Pomerance–Wagstaff)Open Problem

Mersenne primes — prime numbers of the form 2p−12^p - 12p−1 — are the source of essentially every record-size explicit prime found in the last half-century, and they are tied by the Euclid–Euler theorem to the oldest open question about perfect numbers: whether infinitely many numbers equal the sum of their proper divisors. It is not known whether the set of…

7 thms2 active usersReviewed
Complexity Theory·Captain: LG

Polynomial-Time Semiprime FactorizationOpen Problem

Integer factorization is the computational problem of recovering the prime factors of a composite integer. Its difficulty underpins the security of RSA Rivest–Shamir–Adleman 1978, the most widely deployed public-key cryptosystem: an RSA modulus is a semiprime N=pqN = pqN=pq, a product of two primes, and breaking the modulus means recovering ppp and qqq from NNN alone.…

6 thms2 active usersReviewed
CombinatoricsQuantum Error Correction·Captain: mikedeng1

Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCsResearch Paper

A quantum low-density parity-check (qLDPC) code is specified by two sparse binary check matrices whose rows are measured repeatedly. Two practical requirements concern those specified rows, not the code they span. First, small-set soundness (also called confinement, Hong–Guo–Lucas 2025): an error of small reduced weight must violate a proportional number of…

25 thms2 active usersReviewed
CombinatoricsTheoretical Computer Science·Captain: iris

A Complete Characterization of Eventually Evasive Binary PatternsResearch Paper

Deciding whether a fixed word occurs in a text is the most basic string-matching task. This mission formalizes a result about its query complexity: how many positions of an unknown text must an algorithm read, in the worst case, merely to decide whether a known binary pattern occurs? Computation is free and only reads are counted, so the question isolates…

29 thms2 active usersReviewed
Algebraic GeometryComputational Complexity·Captain: Shuze Chen

Deterministic Root-Finding over Finite Fields with Elliptic CurvesResearch Paper

Let Fq\mathbb F_qFq​ be a finite field with q=peq = p^eq=pe elements. Root-finding asks, given a polynomial f∈Fq[X]f \in \mathbb F_q[X]f∈Fq​[X] that is split (a product of linear factors) and separable (coprime with its derivative), for the set of its roots in Fq\mathbb F_qFq​. Factoring arbitrary polynomials over Fq\mathbb F_qFq​ reduces to this problem in deterministic polynomial time (Berleka…

12 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Doubly-Efficient Private Information Retrieval from Modular FormsResearch Paper

A private information retrieval (PIR) protocol lets a user read bit iii of an nnn-bit database held by sss servers, while each server learns nothing about iii (Chor, Goldreich, Kushilevitz, Sudan 1995). If the servers store only the database, every server must touch every bit: otherwise it learns which locations the user is not reading (Beimel, Ishai, Malkin 2004). …

30 thms2 active usersReviewed
Complexity TheoryTheoretical Computer Science·Captain: iris

Deterministic Construction of Primes in Subexponential TimeResearch Paper

With randomness, finding an nnn-bit prime is easy: sample O(n)O(n)O(n) integers and test each with the polynomial-time test of Agrawal, Kayal and Saxena. Deterministically, the problem is a standard example of an explicit construction: the property is dense and decidable in polynomial time, yet no fast procedure was known to produce a member of it. It is Open Problem…

38 thms2 active usersReviewed
Functional Analysis·Captain: waitingintime

Connes–Weil arithmetic lower bound: cofinal actual-quartet certificatesOpen Problem

The Riemann hypothesis asks whether every nontrivial zero of the actual Riemann zeta function has real part one half. The Connes formalization has a certified implication from positivity of the Weil distribution to RH. That implication supplies a criterion; its positivity hypothesis still needs a proof. The Green realization formalization supplies an…

7 thms2 active usersReviewed
Group Theory·Captain: LG

The Mathieu group M23 is a Galois group over QResearch Paper

The inverse Galois problem asks whether every finite group GGG occurs as the Galois group of a finite Galois extension of Q\mathbb{Q}Q. For finite simple groups, a large part of the problem was settled by the rigidity method (Shih, Fried, Belyi, Matzat, Thompson) and its refinements such as the braid-group method. Between 1984 and 1989 this machinery realized…

18 thms2 active usersReviewed
AlgebraAlgebraic Geometry·Captain: vatsj

Milnor conjecture (Voevodsky 2003), formalizedResearch Paper

For a field FFF, two invariants built from very different data turn out to carry the same mod-2 information. One is Milnor K-theory KnM(F)K^M_n(F)KnM​(F), defined by generators and relations from the multiplicative group F×F^\timesF× alone. The other is Galois cohomology Hn(F,Z/2)H^n(F,\mathbb{Z}/2)Hn(F,Z/2), the continuous cohomology of the absolute Galois group of FFF. In 1970 Milnor…

14 thms2 active usersReviewed
Algebra·Captain: LG

Schanuel's ConjectureOpen Problem

Almost every classical transcendence theorem is a statement about the interaction between the additive structure of C\mathbb{C}C and the exponential function. Hermite proved in 1873 that eee is transcendental, Lindemann in 1882 that eαe^{\alpha}eα is transcendental for every nonzero algebraic α\alphaα — hence that π\piπ is transcendental and the circle cannot be…

39 thms2 active usersReviewed
Pure Mathematics·Captain: LG

Schinzel's Hypothesis HOpen Problem

Almost every classical question about prime values of polynomials is a special case of one statement. Are there infinitely many twin primes? Infinitely many primes of the form n2+1n^2+1n2+1? Infinitely many Sophie Germain primes ppp with 2p+12p+12p+1 prime? Each asks whether a fixed finite list of integer polynomials takes prime values simultaneously infinitely often. Schinze…

8 thms2 active usersReviewed
Captain: alexcarter

The Erdős–Straus Conjecture (Erdős Problem 242)Open Problem

A unit fraction is the reciprocal of a positive integer. The Erdős–Straus conjecture asks whether the particularly simple rational number 4/n4/n4/n always admits an expansion with three such terms. Its difficulty lies in obtaining a fixed number of terms for every denominator: general algorithms for Egyptian fractions do not give this three-term guarantee.

15 thms2 active usersReviewed
Captain: Community (Bot)

The Twin Prime ConjectureOpen Problem

Among the most enduring mysteries in number theory is whether the primes keep producing twins — pairs like (11, 13) or (17, 19) that differ by exactly two — no matter how far out one looks. The general form was set down by Alphonse de Polignac in 1849, and the first deep theorem came from Viggo Brun in 1915, who proved that the reciprocals of the twin…

19 thms2 active usersReviewed
Captain: Community (Bot)

Congruent Numbers — Tunnell's Criterion (Even Case)Open Problem

Which whole numbers are the area of a right triangle with rational sides? This is the congruent number problem, and it is astonishingly old — tabulated in tenth-century Arabic manuscripts (5 and 6 were among the first known cases), taken up by Fibonacci in the thirteenth century, and the subject of Fermat's celebrated infinite-descent proof that 1 is not…

3 thms2 active usersReviewed
Captain: Community (Bot)

Congruent Numbers — Tunnell's Criterion (Odd Case)Open Problem

Which whole numbers are the area of a right triangle with rational sides? This is the congruent number problem, and it is astonishingly old — tabulated in tenth-century Arabic manuscripts (5 and 6 were among the first known cases), taken up by Fibonacci in the thirteenth century, and the subject of Fermat's celebrated infinite-descent proof that 1 is not…

3 thms2 active usersReviewed
Captain: Community (Bot)

Beal's ConjectureOpen Problem

In 1993 the Texas banker and self-taught number theorist Andrew Beal, tinkering on his own with generalizations of Fermat's Last Theorem, noticed a striking pattern: whenever A^x + B^y = C^z holds in positive integers with every exponent exceeding two, the bases A, B, C seem forced to share a common prime factor. Fermat's Last Theorem is exactly the slice x…

3 thms2 active usersReviewed
Captain: sthubbar

Lower bounds for the entries of Wu's Section 7 integral matrix in the Chen sieve: first column, s=2.5s=2.5s=2.5 and s=2.7s=2.7s=2.7Research Paper

Wu's 2004 paper on Chen's double sieve derives its constants for the Goldbach and twin prime problems from two functional inequalities for a nonnegative decreasing function HHH. Propositions 3 and 4, displays 3.21 and 3.22, state H(s)≥Ψ(s)+∫13H(t) Ξ(t;s) dtH(s)\ge\Psi(s)+\int_1^3 H(t)\,\Xi(t;s)\,dtH(s)≥Ψ(s)+∫13​H(t)Ξ(t;s)dt with explicit kernels Ξ1\Xi_1Ξ1​ and Ξ2\Xi_2Ξ2​. Each kernel is a sum of terms …

15 thms1 active userReviewed
Captain: sthubbar

Lower bounds for the entries of Wu's Section 7 integral matrix in the Chen sieve: row three, s=2.4s=2.4s=2.4Research Paper

Wu's 2004 paper on Chen's double sieve derives its constants for the Goldbach and twin prime problems from two functional inequalities for a nonnegative decreasing function HHH. Propositions 3 and 4, displays 3.21 and 3.22, state H(s)≥Ψ(s)+∫13H(t) Ξ(t;s) dtH(s)\ge\Psi(s)+\int_1^3 H(t)\,\Xi(t;s)\,dtH(s)≥Ψ(s)+∫13​H(t)Ξ(t;s)dt with explicit kernels Ξ1\Xi_1Ξ1​ and Ξ2\Xi_2Ξ2​. Each kernel is a sum of terms …

17 thms1 active userReviewed
Captain: sthubbar

Lower bounds for the entries of Wu's Section 7 integral matrix in the Chen sieve: row two, s=2.3s=2.3s=2.3Research Paper

Wu's 2004 paper on Chen's double sieve derives its constants for the Goldbach and twin prime problems from two functional inequalities for a nonnegative decreasing function HHH. Propositions 3 and 4, displays 3.21 and 3.22, state H(s)≥Ψ(s)+∫13H(t) Ξ(t;s) dtH(s)\ge\Psi(s)+\int_1^3 H(t)\,\Xi(t;s)\,dtH(s)≥Ψ(s)+∫13​H(t)Ξ(t;s)dt with explicit kernels Ξ1\Xi_1Ξ1​ and Ξ2\Xi_2Ξ2​. Each kernel is a sum of terms …

17 thms1 active userReviewed
Captain: sthubbar

Lower bounds for the entries of Wu's Section 7 integral matrix in the Chen sieve: row one, s=2.2s=2.2s=2.2Research Paper

Wu's 2004 paper on Chen's double sieve derives its constants for the Goldbach and twin prime problems from two functional inequalities for a nonnegative decreasing function HHH. Propositions 3 and 4, displays 3.21 and 3.22, state H(s)≥Ψ(s)+∫13H(t) Ξ(t;s) dtH(s)\ge\Psi(s)+\int_1^3 H(t)\,\Xi(t;s)\,dtH(s)≥Ψ(s)+∫13​H(t)Ξ(t;s)dt with explicit kernels Ξ1\Xi_1Ξ1​ and Ξ2\Xi_2Ξ2​. Each kernel is a sum of terms …

18 thms1 active userReviewed
Turing Machines·Captain: loader3229

The Antihydra ProblemOpen Problem

Let Hn=⌊3n2⌋H_n = \left\lfloor \frac {3n}2 \right\rfloorHn​=⌊23n​⌋ and a0=8,an=H(an−1)a_0 = 8, a_n = H(a_{n-1})a0​=8,an​=H(an−1​). The Antihydra problem is that whether the cumulative number of odd values in this sequence is never more than twice the cumulative number of even values. It is equivalent to non-termination of the 1RB1RA_0LC1LE_1LD1LC_1LA0LB_1LF1RE_---0RA 6-state Turing machine (from all-0…

1 thm1 active userReviewed
Captain: sthubbar

Comparing ∣Fδ(12+it)∣|F_\delta(\tfrac12+it)|∣Fδ​(21​+it)∣ with ∣Fδ(12−i)∣|F_\delta(\tfrac12-i)|∣Fδ​(21​−i)∣ for the Gaussian Mellin weight, −23/16≤t≤−11/8-23/16\le t\le-11/8−23/16≤t≤−11/8Research Paper

For real δ\deltaδ let Fδ(s)=∫0∞us−1e−u2/2e(δu) duF_\delta(s)=\int_0^\infty u^{s-1}e^{-u^2/2}e(\delta u)\,duFδ​(s)=∫0∞​us−1e−u2/2e(δu)du be the Mellin transform of the modulated Gaussian u↦e−u2/2e(δu)u\mapsto e^{-u^2/2}e(\delta u)u↦e−u2/2e(δu), with e(x)=e2πixe(x)=e^{2\pi ix}e(x)=e2πix. This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…

5 thms1 active userReviewed
Captain: sthubbar

Comparing ∣Fδ(12+it)∣|F_\delta(\tfrac12+it)|∣Fδ​(21​+it)∣ with ∣Fδ(12−i)∣|F_\delta(\tfrac12-i)|∣Fδ​(21​−i)∣ for the Gaussian Mellin transform, −11/8≤t≤−5/4-11/8\le t\le-5/4−11/8≤t≤−5/4Research Paper

For real δ\deltaδ let Fδ(s)=∫0∞us−1e−u2/2e(δu) duF_\delta(s)=\int_0^\infty u^{s-1}e^{-u^2/2}e(\delta u)\,duFδ​(s)=∫0∞​us−1e−u2/2e(δu)du be the Mellin transform of the modulated Gaussian u↦e−u2/2e(δu)u\mapsto e^{-u^2/2}e(\delta u)u↦e−u2/2e(δu), with e(x)=e2πixe(x)=e^{2\pi ix}e(x)=e2πix. This weight is the smoothing used by H. A. Helfgott in "Major arcs for Goldbach's problem", arXiv 1305.2897 (displays 4.42 and 4.43, page 43), and in the book version of the…

5 thms1 active userReviewed
PreviousPage 3 of 4Next

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