Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Catalog
Every one of these is still open.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
is the sequence of primes?
Note: In the problem statement,
pn
is the
n
-th prime, indexed such that
p1=2,p2=3,…
.
We 0-index here to reflect how Nat.nth works.
Attempts
0
Modes
2
Bounty
$2,827
.
Attempts
0
Modes
2
Bounty
$2,827
irrational?
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
and yet
p2
does not divide the right hand side. [Er82c] Erdős, Paul, "Miscellaneous problems in number theory".…
Attempts
0
Modes
2
Bounty
$2,827
, where
rk(N)
the largest possible size of a subset
of
{1,…,N}
that does not contain any non-trivial
k
-term arithmetic progression.
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
, but he is 'very doubtful'.
[Er79] Erdős, Paul, __Some unconventional problems in number theory__. Math. Mag. (1979), 67-70.
Attempts
0
Modes
2
Bounty
$2,827
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
Bounty
$2,827
2
Bounty
$2,827
and
k≥0
. Show that
f(n)=o(logn)
.
Attempts
0
Modes
2
Bounty
$2,827
.
Attempts
0
Modes
2
Bounty
$2,827
such that
na=x1+y1+z1.
Attempts
0
Modes
2
Bounty
$2,827
irrational? Here
ϕ
is the Euler totient function.
Attempts
0
Modes
2
Bounty
$2,827
irrational? Here
pn
is the
n
-th prime (
p1=2,p2=3,…
).
Attempts
0
Modes
2
Bounty
$2,827
nonnegative integers are distinct.
Attempts
0
Modes
2
Bounty
$2,827
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
f(n)=o(n)
?
Attempts
0
Modes
2
Bounty
$2,827
converges.
Attempts
0
Modes
2
Bounty
$2,827
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
h(n)=o(n)
?
Attempts
0
Modes
2
Bounty
$2,827
and
ai+1
is the
least integer which is not a sum of consecutive earlier
aj
s. Show that
ak/k→∞
.
Attempts
0
Modes
2
Bounty
$2,827
and
ai+1
is the
least integer which is not a sum of consecutive earlier
aj
s. Show that
ak/k1+c→0
for any
c>0
.
Attempts
0
Modes
2
Bounty
$2,827
.
Attempts
0
Modes
2
Bounty
$2,827
for some constant
c>0
. [Er76d] Erdős, P., Problems and results on number theoretic properties of consecutive integers and related questions. Proceedings of the Fifth Manitoba Conference on Numerical…
Attempts
0
Modes
2
Bounty
$2,827
has density
21
.
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
for all sufficiently large
n
?
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
Modes
2
Bounty
$2,827
Modes
2
Bounty
$2,827
. Is it true, for any
m,n
, there exist
i
and
j
such that
hi(m)=hj(n)
?
Attempts
0
Modes
2
Bounty
$2,827
?
Attempts
0
Modes
2
Bounty
$2,827
?
Attempts
0
Modes
2
Bounty
$2,827
such that no subset of size
r
has the same pairwise greatest common divisor between all elements. Erdős [Er64] proved that
f3(N)>Nc/loglogN
for some constant
c>0
, and conjectured this should also be an upper…
Attempts
0
Modes
2
Bounty
$2,827
for all sufficiently large
N
.
Attempts
0
Modes
2
Bounty
$2,827
, be a perfect power?
Attempts
0
Modes
2
Bounty
$2,827
, we get
M(m,k)=M(n,k)
?
Attempts
0
Modes
2
Bounty
$2,827
where
p(m)
denotes the least prime factor of
m
?
Attempts
0
Modes
2
Bounty
$2,827
for some
k≥2
and
m≥n+k
?
Attempts
0
Modes
2
Bounty
$2,827
hold for infinitely many n?
Attempts
0
Modes
2
Bounty
$2,827
?
Attempts
0
Modes
2
Bounty
$2,827
0
Modes
2
Bounty
$2,827
with
1≤k≤2n
has exactly
t
solutions?
Attempts
0
Modes
2
Bounty
$2,827
, where
pn
is the
n
th prime. Let
r(x)
be the smallest even
integer
t
such that
dn=t
has no solutions for
n≤x
.
Is it true that
r(x)→∞
?
Attempts
0
Modes
2
Bounty
$2,827
, where
pn
is the
n
th prime. Let
r(x)
be the smallest even
integer
t
such that
dn=t
has no solutions for
n≤x
.
Is it true that
r(x)/logx→∞
?
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
divisors in
(n21,n21+Cn41)
.
Attempts
0
Modes
2
Bounty
$2,827
. Is it true that
v0(n)=maxk≥0v(n,k)→∞
as
n→∞
?
Attempts
0
Modes
2
Bounty
$2,827
. For every fixed
l
,
vl(n)→∞
as
n→∞
[ErSe67] Erdős, P. and Selfridge, J. L., Some problems on the prime factors of consecutive integers. Illinois J. Math. (1967), 428--430.
Attempts
0
Modes
2
Bounty
$2,827
as
n→∞
.
Attempts
0
Modes
2
Bounty
$2,827
Modes
2
Bounty
$2,827
$2,827
all of whose prime factors are
<pr+1−pr
.
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
Bounty
$2,827
?
Attempts
0
Modes
2
Bounty
$2,827
Bounty
$2,827
$2,827
Bounty
$2,827
irrational, where
τ(n)
counts the divisors of
n
?
A conjecture of Chowla.
Attempts
0
Modes
2
Bounty
$2,827
. In general, a prime
p
is in class
r
if every prime factor of
p+1
is in some class
≤r−1
, with equality for at least one prime factor. If
pr
is the least prime in class
r
, then how does
pr1/r
behave? Erdos conjectured…
Attempts
0
Modes
2
Bounty
$2,827
. In general, a prime
p
is in class
r
if every prime factor of
p+1
is in some class
≤r−1
, with equality for at least one prime factor. If
pr
is the least prime in class
r
, then how does
pr1/r
behave? Selfridge…
Attempts
0
Modes
2
Bounty
$2,827
?
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
$2,827
, with only
finitely many exceptions.
Attempts
0
Modes
2
Bounty
$2,827
Attempts
0
Modes
2
Bounty
$2,827
for some constant
c>0
.
Attempts
0
Modes
2
Bounty
$2,827
2
Bounty
$2,827
of all finite sums of distinct factorials contain only finitely many
k
-th powers?
Attempts
0
Modes
2
Bounty
$2,827
with
2k<n
?
The only known such
n
are
4,7,15,21,45,75,105
(OEIS [A039669](https://oeis.org/A039669)).
Attempts
0
Modes
2
Bounty
$2,827
Modes
2
Bounty
$2,827
tuples
(x1,…,x5,y1,…,y5)∈G10
such that
xi+yj∈A
whenever
j∈{i,i+1,i+2}
?
Note: We interpret indices modulo 5.
Attempts
0
Modes
2
Bounty
$2,827
is free of 3-term progressions?
Attempts
0
Modes
2
Bounty
$2,827
triples
x,y,g
such that
(x,y),(gx,y),(x,gy)
all lie in
A
?
Note: A is taken as
α
-dense, i.e.
∣A∣≥α∣G∣2
[Au16, Question 2]
Attempts
0
Modes
2
Bounty
$2,827
with
x,y,z∈A
?
Attempts
0
Modes
2
Bounty
$2,827
.
Is there a dilate of
A
containing a gap of length
100p
?
Attempts
0
Modes
2
Bounty
$2,827
, with
A+A=Z/qZ
? [Gr24]
Attempts
0
Modes
2
Bounty
$2,827
contain a coset of some subspace of dimension at least
n−O(log(1/α))
? More precisely: does there exist an absolute constant