Questions, not proof records

Open-problem statements, with their sources attached.

Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.

“Open” is a dated source assertion. In these pinned sources, sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.
1 topic

741 of 1194 statement records

17 source collections · 43 mathematical fields

Clear filters
Source labels openWikipedia · Number theory

Congruent Number

Tunnell's theorem (sufficient condition assuming BSD) for even squarefree congruent numbers.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Dickson's conjecture

Dickson's conjecture* If a finite set of linear integer forms fi(n)=ain+bif_i(n) = a_i n+b_i satisfies Schinzel condition, there exist infinitely many natural numbers mm such that fi(m)f_i(m) are primes for all ii.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Dickson's conjecture

Polignac's conjecture* For any integer kk there are infinitely many primes pp such that p+2kp + 2k is prime.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Dickson's conjecture

The infinitude of Sophie Germain primes* There are infinitely many primes pp such that 2p+12p + 1 is prime.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Dickson's conjecture

The infinitude of cousin primes* There are infinitely many primes pp such that p+4p + 4 is prime.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Dickson's conjecture

The infinitude of sexy primes* There are infinitely many primes pp such that p+6p + 6 is prime.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Elliott–Halberstam conjecture

The Elliott–Halberstam conjecture: for every θ<1\theta < 1 and A>0A > 0 there exists a constant C>0C > 0 such that 1qxθE(x;q)CxlogAx\sum_{1 \le q \le x^{\theta}} E(x; q) \le \frac{C x}{\log^A x} for all x>2x > 2.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

From [PPVW2016], Section 3.1: "from the mid-1960s to the present, it seems that most experts conjectured unboundedness."

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

From [PPVW2016], Section 8.2: "Our heuristic predicts (a) All but finitely many E ∈ ℰ satisfy rk E(ℚ) ≤ 21". In other words, there are only finitely many elliptic curves over ℚ (up to isomorphism) with rank greater than 21. Notice that this contradicts the previous conjecture.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

[PPVW2016] 8.2(b): for 1 ≤ r ≤ 20, the number of elliptic curves over ℚ with rank r and naïve height at most H is asymptotically H ^ ((21 - r) / 24 + o(1)). Note: ℰ_H in 8.2(b) should be ℰ_{≤H}, see the statement of Theorem 7.3.3. When r = 1, the exponent is 20 / 24 = 5 / 6, which agrees with the exponent in card_heightLE_div_pow_five_div_six_tensto and is consistent with half_rank_zero_and_half_rank_one.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Some conjectures about ranks of elliptic curves over ℚ

[PPVW2016] 8.2(c): the number of elliptic curves over ℚ with rank ≥ 21 and naïve height at most H is asymptotically at most H ^ o(1).

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Euclid Numbers conjecture

It is not known whether there is an inifinite number of prime Euclid numbers.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Euclid Numbers conjecture

It is not known whether every Euclid number is a square-free number.

Source checked Jul 26, 20261 pinned Lean statementInspect problem
Source labels openWikipedia · Number theory

Euler's sum of powers conjecture

Euler's sum of powers conjecture states that for integers n>1n > 1 and k>1k > 1, if the sum of nn positive integers each raised to the kk-th power equals another integer raised to the kk-th power, then nkn ≥ k.

The conjecture is known to be false for k=4k = 4 and k=5k = 5, but remains open for k6k ≥ 6.

Source checked Jul 26, 20261 pinned Lean statementInspect problem