Every problem here was open when it entered the pool.
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.
Open problems · Conjectures.io
Catalog
Every problem here was open when it entered the pool.
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.
and every sufficiently large integer can be written as
p+a
for some prime
p
and
a∈A
?
Attempts
0
Modes
2
Bounty
$2,751
for all
ε>0
?
Attempts
0
Modes
2
Bounty
$2,751
(aside from the trivial coincidences). Is it true that
liminfN→∞N1/3∣A∩{1,…,N}∣=0?
Attempts
0
Modes
2
Bounty
$2,751
is the natural density of
{n:φ(n)<cn}
. Is it true that there is no
x
such
that the derivative
f′(x)
exists and is positive?
Attempts
0
Modes
2
Bounty
$2,751
is the smallest such integer, then
ana→∞
as
a→∞
?
Attempts
0
Modes
2
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,622
exists and is
=0
?
Attempts
0
Modes
2
Bounty
$2,751
irrational?
Attempts
0
Modes
2
Bounty
$2,751
be integers of gcd equal to
1
such that
∑1≤i≤rdi−11≥1.
Can all sufficiently large integers be written as a sum of the shape
∑iciai
where
ci∈{0,1}
and
ai
is divisible by
dik
and has only the digits
0,1
…
Attempts
0
Modes
2
Bounty
$2,622
Attempts
0
Modes
2
Bounty
$2,751
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,751
Attempts
0
Modes
2
Bounty
$2,622
, 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,751
Attempts
0
Modes
2
Bounty
$2,751
,
limx→∞x1∑sn≤x(sn+1−sn)α
exists?
Attempts
0
Modes
2
Bounty
$2,751
$2,751
, 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,751
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,751
Bounty
$2,751
2
Bounty
$2,751
and
k≥0
. Show that
f(n)=o(logn)
.
Attempts
0
Modes
2
Bounty
$2,751
such that
na=x1+y1+z1.
Attempts
0
Modes
2
Bounty
$2,751
and
k≥0
, have density
>0
?
Attempts
0
Modes
2
Bounty
$2,751
Is
∑k=1∞2nk1
transcendental?
Attempts
0
Modes
2
Bounty
$2,751
irrational? Here
ϕ
is the Euler totient function.
Attempts
0
Modes
2
Bounty
$2,751
irrational? Here
pn
is the
n
-th prime (
p1=2,p2=3,…
).
Attempts
0
Modes
2
Bounty
$2,751
irrational?
Attempts
0
Modes
2
Bounty
$2,751
Modes
2
Bounty
$2,622
be the set of positive integers whose prime factors
are all in
P
. Is the sum
∑n=1∞[a1,…,an]1
irrational?
Attempts
0
Modes
2
Bounty
$2,751
such that
∑i=1kni1=1
,
we must have
max(ni+1−ni)≥3
?
Attempts
0
Modes
2
Bounty
$2,622
and
an
by
∑1≤k≤nk1=Lnan
.
Is it true that
(an,Ln)=1
occurs for infinitely many
n
?
Attempts
0
Modes
2
Bounty
$2,751
?
Asked by Barbeau [Ba76].
[Ba76] Barbeau, E. J., _Computer challenge corner: Problem 477: A brute force program._
Attempts
0
Modes
2
Bounty
$2,622
whenever the left-hand side is not zero?
Attempts
0
Modes
2
Bounty
$2,622
for all
ϵ>0
?
This would have significant applications to Waring's problem. Erdős and Graham describe this as
'unattackable by the methods at our disposal'.
Attempts
0
Modes
2
Bounty
$2,622
for sufficiently large
x
?
Attempts
0
Modes
2
Bounty
$2,622
.
Attempts
0
Modes
2
Bounty
$2,751
nonnegative integers are distinct.
Attempts
0
Modes
2
Bounty
$2,751
fk,3(x)≫x(3/k)
?
Attempts
0
Modes
2
Bounty
$2,751
{⌊α⌋,⌊2α⌋,⌊4α⌋,…}∪{⌊β⌋,⌊2β⌋,⌊4β⌋,…}
complete?
Attempts
1
Modes
2
Bounty
-
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
f(n)=o(n)
?
Attempts
0
Modes
2
Bounty
$2,751
converges.
Attempts
0
Modes
2
Bounty
$2,751
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
h(n)=o(n)
?
Attempts
0
Modes
2
Bounty
$2,751
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,751
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,751
.
Attempts
0
Modes
2
Bounty
$2,751
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,751
2
Bounty
$2,622
has density
21
.
Attempts
0
Modes
2
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,751
is
p
?
Attempts
0
Modes
2
Bounty
$2,751
is the least
prime divisor of
m
. Is it true that
F(n)>n
for all sufficiently large
n
?
Attempts
0
Modes
2
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,751
for some constant
ck
?
Attempts
0
Modes
2
Bounty
$2,622
Modes
2
Bounty
$2,751
0
Modes
2
Bounty
$2,751
. Is it true that
limk→∞σk(n)k1=∞
? This is problem (iii) from Erdos, Granville, Pomerance, Spiro "On the normal behavior of the iterates of some arithmetical functions" (page 169 of the book "Analytic Number Theory"…
Attempts
0
Modes
2
Bounty
$2,622
.
Is it true that, for every
m,n≥2
, there exist some
i,j
such that
σi(m)=σj(n)
?
Attempts
0
Modes
2
Bounty
$2,751
. Is it true, for any
m,n
, there exist
i
and
j
such that
hi(m)=hj(n)
?
Attempts
0
Modes
2
Bounty
$2,751
with
0<a<n
and
liminfπ(x)∣A∩[1,x]∣>0?
Attempts
0
Modes
2
Bounty
$2,751
such that
ab≡1(modp)
?
This is discussed in this MathOverflow question [MathOverflow].
Attempts
0
Modes
2
Bounty
$2,751
?
Attempts
0
Modes
2
Bounty
$2,751
be the
k
-th prime.
Is it true that for all
k≥1
,
lcm(1,…,pk+1−1)<pk⋅lcm(1,…,pk)
?
Attempts
0
Modes
2
Bounty
$2,751
, there is a composite number
m
such that
n+f(n)<m<n+p(m)
Here
p(m)
is the least prime factor of
m
.
Attempts
0
Modes
2
Bounty
$2,751
?
Attempts
0
Modes
2
Bounty
$2,751
? This is also known as the Littlewood conjecture.
Attempts
0
Modes
2
Bounty
$2,622
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,751
for all sufficiently large
N
.
Attempts
0
Modes
2
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,622
, be a perfect power?
Attempts
0
Modes
2
Bounty
$2,751
, we get
M(m,k)=M(n,k)
?
Attempts
0
Modes
2
Bounty
$2,751
where
p(m)
denotes the least prime factor of
m
?
Attempts
0
Modes
2
Bounty
$2,751
, for all
ϵ>0
, where
Cϵ>0
is some constant?
Attempts
0
Modes
2
Bounty
$2,751
,
where
p(m)
is the least prime factor of
m
?
Attempts
0
Modes
2
Bounty
$2,622
for some
k≥2
and
m≥n+k
?
Attempts
0
Modes
2
Bounty
$2,751
for some
k≥2
and
m≥n+k
?
Attempts
0
Modes
2
Bounty
$2,622
. Is it
true that
limk→∞qk1/k=∞?
Attempts
0
Modes
2
Bounty
$2,751
and
q(k)≤exp(k(logk)1+o(1))?
Attempts
0
Modes
2
Bounty
$2,751
?
Attempts
0
Modes
2
Bounty
$2,751
?
A conjecture of Erdős, Graham, Ruzsa, and Straus [EGRS75].
By
n∈(p/2,p)(modp)
we mean
n≡r(modp)
for some integer
r
with
p/2<r<p
.
Attempts
1
Modes
2
Bounty
-
and yet
1A∗1A(n)≪ϵ1
for all
n
?
Attempts
0
Modes
2
Bounty
$2,622
?
Attempts
0
Modes
2
Bounty
$2,751
0
Modes
2
Bounty
$2,622
0
Modes
2
Bounty
$2,751
? That is, does there exist a natural
number
C
such that the number of representations of
n
as a sum of two cubes is
O((logn)C)
as
n→∞
?
Attempts
0
Modes
2
Bounty
$2,751
with
1≤k≤2n
has exactly
t
solutions?
Attempts
0
Modes
2
Bounty
$2,751
, 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,751
, 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,751
Attempts
1
Modes
2
Bounty
$2,751
and let
F(A,X,k)
count the number of
i
such that
[ai,ai+1,…,ai+k−1]<X
, where the left-hand side is the least common
multiple. Is it true that, for every
ϵ>0
, there exists some
k
such that
F(A,X,k)<Xϵ
?
Attempts
0
Modes
2
Bounty
$2,751
such that
∣∩iD(Ni)∣≥k
?
Attempts
0
Modes
2
Bounty
$2,751
is
Oϵ(1)
?
Erdős attributes this conjecture to Ruzsa.
Attempts
0
Modes
2
Bounty
$2,622
divisors in
(n21,n21+Cn41)
.
Attempts
0
Modes
2
Bounty
$2,751
. Is it true that
v0(n)=maxk≥0v(n,k)→∞
as
n→∞
?
Attempts
0
Modes
2
Bounty
$2,751
. 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,751
,
liminfn→∞∑0≤i<kωk(n+i)≤k?
Attempts
0
Modes
2
Bounty
$2,751
where
ω
counts the number of distinct prime factors without restriction?
Attempts
0
Modes
2
Bounty
$2,622
. Is it true that, for all sufficiently large
n
, there must exist an integer in
[n,n+p1⋯pk)
with
>k
many prime factors?
Attempts
0
Modes
2
Bounty
$2,751
as
n→∞
.
Attempts
0
Modes
2
Bounty
$2,751
Modes
2
Bounty
$2,751
$2,751
are disjoint intervals of consecutive integers,
all of length at least
k
, then
∏1≤i≤r∏m∈Iim
is not a perfect power?
Attempts
0
Modes
2
Bounty
$2,622
such that
∏1≤i≤k1(n1+i)and∏1≤j≤k2(n2+j)
have the same prime factors?
Attempts
0
Modes
2
Bounty
$2,751
all of whose prime factors are
<pr+1−pr
.
Attempts
0
Modes
2
Bounty
$2,751
, then is it true that
limsupn→∞nlogn2k3l=∞
?
Attempts
0
Modes
2
Bounty
$2,622
and, for infinitely many
n
,
h(n)>(logn)c−o(1)
.
Attempts
0
Modes
2
Bounty
$2,751
for every
n
?
Attempts
0
Modes
2
Bounty
$2,751
such that every vertex is critical, yet every critical set of edges has size
>r
?
Attempts
1
Modes
2
Bounty
-
Bounty
$2,751
Bounty
$2,622
?
Attempts
0
Modes
2
Bounty
$2,751
Modes
2
Bounty
$2,622
Bounty
$2,751
such that
∑n≤xτ(f(n))≈c⋅xlogx
? Note that it is unclear whether the polynomial should have integer coefficients or merely be integer-valued. We…
Attempts
0
Modes
2
Bounty
$2,751
there exists
n
such that
pk−2∤f(n)
,
then are there infinitely many
n
for which
f(n)
is
(k−2)
-power-free?
Attempts
0
Modes
2
Bounty
$2,751
,
where the
pi
are prime numbers. Is it true that
limsupfk(n)=∞
?
Attempts
0
Modes
2
Bounty
$2,622
$2,751
Bounty
$2,751
irrational, where
τ(n)
counts the divisors of
n
?
A conjecture of Chowla.
Attempts
1
Modes
2
Bounty
$2,751
such that
n∈Ii∏n≡1modn
for all
1≤i≤k
?
Attempts
0
Modes
2
Bounty
$2,622
Attempts
0
Modes
2
Bounty
$2,751
$2,751
Bounty
$2,751
, with only
finitely many exceptions.
Attempts
0
Modes
2
Bounty
$2,751
Attempts
0
Modes
2
Bounty
$2,751
for some constant
c>0
.
Attempts
0
Modes
2
Bounty
$2,751
,
F(n)>n
for sufficiently large
n
.
Attempts
0
Modes
2
Bounty
$2,751
2
Bounty
$2,751
of all finite sums of distinct factorials contain only finitely many
k
-th powers?
Attempts
0
Modes
2
Bounty
$2,751
, where
pn
denotes the
n
th prime. Is it true that
(maxn<xdn)2maxn<xdndn−1→0
as
x→∞
?
Attempts
0
Modes
2
Bounty
$2,751
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,751
Modes
2
Bounty
$2,751
such that the restricted sumset
S+^S
is disjoint from
A
?
Attempts
0
Modes
2
Bounty
$2,751
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,751
is free of 3-term progressions?
Attempts
1
Modes
2
Bounty
-
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,751
.
Attempts
1
Modes
2
Bounty
$2,751
.
Is there a dilate of
A
containing a gap of length
100p
?
Attempts
0
Modes
2
Bounty
$2,751
, with
A+A=Z/qZ
? [Gr24]
Attempts
0
Modes
2
Bounty
$2,751
. Does the remaining set have size at most
101N
?
We interpret "half the residue classes" as
⌊pi/2⌋
.
Attempts
1
Modes
2
Bounty
$2,622
for all sufficiently large
p
. Is it true…
Attempts
2
Modes
2
Bounty
-
contain a coset of some subspace of dimension at least
n−O(log(1/α))
? More precisely: does there exist an absolute constant
C>0
such that for all
n≥1
and all nonempty
A⊆F2n
with density
α>0
…
Attempts
0
Modes
2
Bounty
$2,751
.
Does
A+A
contain a subspace of co-dimension
OC(1)
? [Sa11, Question 5.1]
Attempts
1
Modes
2
Bounty
-
contain a composite number?
Attempts
0
Modes
2
Bounty
$2,751
satisfies
∣A+A∣≥∣A∣1+c
?
Attempts
0
Modes
2
Bounty
$2,751
congruent to some product
a1a2
where
a1,a2∈A
?
Attempts
0
Modes
2
Bounty
$2,751
?
We formalize this as an eventual statement for sufficiently large real