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.
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.
does not divide the right hand side. [Er82c] Erdős, Paul, "Miscellaneous problems in number theory".…
Attempts
0
Modes
2
Bounty
0 α
, 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
0 α
Attempts
0
Modes
2
Bounty
0 α
, 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
0 α
Modes
2
Bounty
0 α
.
Attempts
0
Modes
2
Bounty
0 α
Modes
2
Bounty
0 α
0
Modes
2
Bounty
0 α
and
k≥0
. Show that
f(n)=o(logn)
.
Attempts
0
Modes
2
Bounty
0 α
.
Attempts
0
Modes
2
Bounty
0 α
such that
na=x1+y1+z1.
Attempts
0
Modes
2
Bounty
0 α
irrational? Here
ϕ
is the Euler totient function.
Attempts
0
Modes
2
Bounty
0 α
irrational? Here
pn
is the
n
-th prime (
p1=2,p2=3,…
).
Attempts
0
Modes
2
Bounty
0 α
irrational?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
and
an
by
∑1≤k≤nk1=Lnan
.
Is it true that
(an,Ln)=1
occurs for infinitely many
n
?
Attempts
0
Modes
2
Bounty
0 α
with
a<b
nonnegative integers are distinct.
Attempts
0
Modes
2
Bounty
0 α
th powers,
is it true that
fk,3(x)≫x(3/k)
?
Attempts
0
Modes
2
Bounty
0 α
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
f(n)=o(n)
?
Attempts
0
Modes
2
Bounty
0 α
converges.
Attempts
0
Modes
2
Bounty
0 α
such that all sums of the shape
∑u≤i≤vai
are distinct. Is
h(n)=o(n)
?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
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
0 α
.
Attempts
0
Modes
2
Bounty
0 α
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
0 α
has density
21
.
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
is
p
?
Attempts
0
Modes
2
Bounty
0 α
p(m)
is the least
prime divisor of
m
. Is it true that
F(n)>n
for all sufficiently large
n
?
Attempts
0
Modes
2
Bounty
0 α
Attempts
0
Modes
2
Bounty
0 α
Attempts
0
Modes
2
Bounty
0 α
Attempts
0
Modes
2
Bounty
0 α
. Is it true, for any
m,n
, there exist
i
and
j
such that
hi(m)=hj(n)
?
Attempts
0
Modes
2
Bounty
0 α
such that
ab≡1(modp)
?
This is discussed in this MathOverflow question [MathOverflow].
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
for all sufficiently large
N
.
Attempts
0
Modes
2
Bounty
0 α
has
size at least
ϵN
then there must be distinct
a,b,c∈A
such that
[a,b]=[b,c]=[a,c],
where
[⋅,⋅]
denotes the least common multiple?
Attempts
0
Modes
2
Bounty
0 α
, be a perfect power?
Attempts
0
Modes
2
Bounty
0 α
.
Is it true that for all
m≥n+k
, we get
M(m,k)=M(n,k)
?
Attempts
0
Modes
2
Bounty
0 α
where
p(m)
denotes the least prime factor of
m
?
Attempts
0
Modes
2
Bounty
0 α
for some
k≥2
and
m≥n+k
?
Attempts
0
Modes
2
Bounty
0 α
. Is it
true that
limk→∞qk1/k=∞?
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
?
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
0
Modes
2
Bounty
0 α
hold for infinitely many n?
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
Attempts
0
Modes
2
Bounty
0 α
with
1≤k≤2n
has exactly
t
solutions?
Attempts
0
Modes
2
Bounty
0 α
, 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
0 α
, 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
0 α
.
Attempts
0
Modes
2
Bounty
0 α
divisors in
(n21,n21+Cn41)
.
Attempts
0
Modes
2
Bounty
0 α
for
0≤i<k
. Is it true that
v0(n)=maxk≥0v(n,k)→∞
as
n→∞
?
Attempts
0
Modes
2
Bounty
0 α
. 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
0 α
as
n→∞
.
Attempts
0
Modes
2
Bounty
0 α
Attempts
0
Modes
2
Bounty
0 α
2
Bounty
0 α
all of whose prime factors are
<pr+1−pr
.
Attempts
0
Modes
2
Bounty
0 α
Bounty
0 α
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
Modes
2
Bounty
0 α
2
Bounty
0 α
Modes
2
Bounty
0 α
irrational, where
τ(n)
counts the divisors of
n
?
A conjecture of Chowla.
Attempts
0
Modes
2
Bounty
0 α
?
Attempts
0
Modes
2
Bounty
0 α
.
Attempts
0
Modes
2
Bounty
0 α
Bounty
0 α
, with only
finitely many exceptions.
Attempts
0
Modes
2
Bounty
0 α
.
Attempts
0
Modes
2
Bounty
0 α
for some constant
c>0
.
Attempts
0
Modes
2
Bounty
0 α
0
Modes
2
Bounty
0 α
of all finite sums of distinct factorials contain only finitely many
k
-th powers?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
Bounty
0 α
0
Modes
2
Bounty
0 α
such that the restricted sumset
S+^S
is disjoint from
A
?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
is free of 3-term progressions?
Attempts
0
Modes
2
Bounty
0 α
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
0 α
Bounty
0 α
.
Is there a dilate of
A
containing a gap of length
100p
?
Attempts
0
Modes
2
Bounty
0 α
, with
A+A=Z/qZ
? [Gr24]
Attempts
0
Modes
2
Bounty
0 α
10A
contain a coset of some subspace of dimension at least
n−O(log(1/α))
? More precisely: does there exist an absolute constant