Erdős Problem #39
Is there an infinite Sidon set A⊂ ℕ such that lvert A∩ 1…,Nrvert ≫_ε N^1/2-ε for all ε > 0?
No claims yet Be the first →
Open problems
Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
All fields Mathematics 970Computer science 30Physics & astronomy 22Chemistry & materials 13Life sciences 6Earth & society 6
1047 shown· page 13 of 21
Erdős Problem #390
Does there exists a constant c such that f n - 2 n ~ c (n / log n)?
No claims yet Be the first →
Erdős Problem #396
Is it true that for every k there exists n such that Π_0≤ i≤ k(n-i) | C(2n, n)?
No claims yet Be the first →
Erdős Problem #398
Brocard's Problem Does n! + 1 = m^2 have integer solutions other than n = 4, 5, 7?
No claims yet Be the first →
Erdős Problem #40
For what functions g(N) → ∞ is it true that lvert A∩ 1,…,Nrvert ≫ N^1/2/g(N) implies limsup 1_Aast 1_A(n)=∞?
No claims yet Be the first →
Erdős Problem #400
Can one show that Σ_n≤ xg_k(n) ∼ c_k xlog x for some constant c_k?
No claims yet Be the first →
Erdős Problem #406
Is it true that there are only finitely many powers of 2 which have only the digits 0 and 1 when written in base 3?
No claims yet Be the first →
Erdős Problem #409
Erdős Problem #409
No claims yet Be the first →
Erdős Problem #41
Let A ⊂ ℕ be an infinite set such that the triple sums a+b+c are all distinct for a,b,c ∈ A (aside from the trivial coincidences). Is it true that liminf_N → ∞ fraclvert A ∩ 1,…,NrvertN^1/3=0?
No claims yet Be the first →
Erdős Problem #410
Let σ_1(n) = σ(n), the sum of divisors function, and σ_k(n) = σ(σ_k-1(n)). Is it true that lim_k → ∞ σ_k(n)^frac 1 k = ∞?
No claims yet Be the first →
Erdős Problem #412
Let σ_1(n)=σ(n), the sum of divisors function, and σ_k(n) = σ(σ_k-1(n)). Is it true that, for every m, n ≥ 2, there exist some i, j such that σ_i(m) = σ_j(n)?
No claims yet Be the first →
Erdős Problem #413
Are there infinitely many barriers for ω?
No claims yet Be the first →
Erdős Problem #414
Let h_1(n) = h(n) and h_k(n) = h(h_k-1(n)). Is it true, for any m,n, there exist i and j such that h_i(m) = h_j(n)?
No claims yet Be the first →
Erdős Problem #416
Let V(x) count the number of n≤x such that ϕ(m)=n is solvable. Does V(2x)/V(x)→2 ?
No claims yet Be the first →
Erdős Problem #417
LetV'(x)=\#φ(m) : 1≤ m≤ xandV(x)=\#φ(m) ≤ x : 1≤ m. Does lim V(x)/V'(x) exist?
No claims yet Be the first →
Erdős Problem #422
Let f(1) = f(2) = 1 and for n > 2 f(n) = f(n - f(n - 1)) + f(n - f(n - 2)). Does f(n) miss infinitely many integers?
No claims yet Be the first →
Erdős Problem #423
Erdős Problem 423 [Er77c, p.71; ErGr80, p.83]: Let a(1) = 1, a(2) = 2, and for k ≥ 3 let a(k) be the least integer greater than a(k-1) that is a sum of at least two consecutive terms of the sequence. What is the asymptotic behaviour of this sequence? It seems likely that a_n = n + o(n).
No claims yet Be the first →
Erdős Problem #428
Is there a set A⊆ ℕ such that, for infinitely many n, all of n-a are prime for all a∈ A with 0 < a < n and liminflvert A∩ [1,x]rvert/π(x)>0?
No claims yet Be the first →
Erdős Problem #431
Are there two infinite sets A and B such that A+B agrees with the primes up to finitely many exceptions?
No claims yet Be the first →
Erdős Problem #44
Erdős Problem 44: Let N ≥ 1 and A ⊆ 1,…,N be a Sidon set. Is it true that, for any ε > 0, there exist M = M(ε) and B ⊆ N+1,…,M such that A ∪ B ⊆ 1,…,M is a Sidon set of size at least (1−ε)M^1/2?
No claims yet Be the first →
Erdős Problem #445
Is it true that, for any c>1/2, if p is a sufficiently large prime then, for any n≥ 0, there exist a,b∈(n,n+p^c) such that ab≡ 1pmodp? This is discussed in this MathOverflow question [MathOverflow].
No claims yet Be the first →
Erdős Problem #450
How large must y=y(ε,n) be such that the number of integers in (x,x+y) with a divisor in (n,2n) is at most ε y? The bound is required for every x and every window length at least y, and y(ε,n) is the least such threshold (or ∞ if there is none).
No claims yet Be the first →
Erdős Problem #452
Determine the largest length of an interval in [x,2x] on which ω(n) > loglog n everywhere.
No claims yet Be the first →
Erdős Problem #454
Is it true that limsup (fun n => (f n - 2 * n.nth Prime : ℕ∞)) atTop = ⊤?
No claims yet Be the first →
Erdős Problem #455
Let q : ℕ → ℕ be a strictly increasing sequence of primes such that q (n + 2) - q (n + 1) ≥ q (n + 1) - q n. Must lim q n / (n ^ 2) = ∞?
No claims yet Be the first →
Erdős Problem #456
Is it true that m_n<p_n for almost all n?
No claims yet Be the first →
Erdős Problem #458
Let lcm(1, …, n) denote the least common multiple of 1, …, n. Let p_k be the k-th prime. Is it true that for all k ≥ 1, lcm(1, …, p_k+1-1) < p_k · lcm(1, …, p_k)?
No claims yet Be the first →
Erdős Problem #462
Let p(n) denote the least prime factor of n. Is there a constant C>0 such that Σ_x≤ n≤ x+C√(x)(log x)^2p(n)/n≫ 1 for all sufficiently large x?
No claims yet Be the first →
Erdős Problem #463
Is there a function f with f(n)→∞ as n→∞ such that, for all large n, 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.
No claims yet Be the first →
Erdős Problem #470
Are there any odd weird numbers?
No claims yet Be the first →
Erdős Problem #478
Let p be a prime and A_p = k! pmodp : 1≤ k<p. Is it true that lvert A_prvert ∼ (1-1/e)p?
No claims yet Be the first →
Erdős Problem #479
Is it true that, for every integer k≠ 1, there are infinitely many n such that 2^n≡ kpmodn?
No claims yet Be the first →
Erdős Problem #488
Let A be a finite set and B= n ≥ 1 : a| ntextrm for some a∈ A. Is it true that, for every m>n≥ max(A), lvert B∩ [1,m]rvert /m< 2lvert B∩ [1,n]rvert/n?
No claims yet Be the first →
Erdős Problem #495
Let α,β ∈ ℝ. Is it true thatliminf_n→ ∞ n ‖ nα ‖ ‖ nβ‖ =0? This is also known as the Littlewood conjecture.
No claims yet Be the first →
Erdős Problem #5
Let C≥ 0. Is there an infinite sequence of n_i such that lim_i→ inftyp_n_i+1-p_n_i/log n_i=C? We formalise "an infinite sequence of n_i" as a strictly monotone sequence of indices n : ℕ → ℕ.
No claims yet Be the first →
Erdős Problem #50
Let f be the asymptotic distribution function of φ(n)/n, so that for each c ∈ [0,1], f(c) 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?
No claims yet Be the first →
Erdős Problem #501
For every x ∈ ℝ let A_x ⊂ ℝ be a bounded set with outer measure < 1. Must there exist an infinite independent set, that is, some infinite X ⊆ ℝ such that x ∉ A_y for all x ≠ y ∈ X? If the sets A_x are closed and have measure < 1, then must there exist an independent set of size 3?
No claims yet Be the first →
Erdős Problem #503
What is the size of the largest A ⊆ ℝ^n such that every three points from A determine an isosceles triangle? That is, for any three points x, y, z from A, at least two of the distances |x - y|, |y - z|, |x - z| are equal.
No claims yet Be the first →
Erdős Problem #506
Erdős Problem #506
No claims yet Be the first →
Erdős Problem #507
Let α(n) be such that every set of n points in the unit disk contains three points which determine a triangle of area at most α(n). Estimate α(n).
No claims yet Be the first →
Erdős Problem #508
The Hadwiger–Nelson problem asks: How many colors are required to color the plane such that no two points at distance 1 from each other have the same color?
No claims yet Be the first →
Erdős Problem #509
Let f(z) ∈ ℂ[z] be a monic non-constant polynomial. Can the set z ∈ ℂ : |f(z)| ≤ 1 be covered by a set of closed discs the sum of whose radii is ≤ 2?
No claims yet Be the first →
Erdős Problem #51
Is there an infinite set A ⊂ ℕ such that for every a ∈ A, there is an integer n such that φ(n)=a, and yet if n_a is the smallest such integer, then n_a/a → ∞ as a → ∞?
No claims yet Be the first →
Erdős Problem #510
Chowla's cosine problem If A⊂ ℕ is a finite set of positive integers of size N > 0 then is there some absolute constant c>0 and θ such that Σ_n∈ Acos(nθ) < -cN^1/2?
No claims yet Be the first →
Erdős Problem #513
Let f be a transcendental entire function. What is the greatest possible value of liminf (fun r : ℝ => ratio r f) atTop?
No claims yet Be the first →
Erdős Problem #517
If f(z) = ∑ aₖzⁿₖ is an entire function (with aₖ ≠ 0 for all k) such that nₖ / k → ∞, is it true that f assumes every value infinitely often?
No claims yet Be the first →
Erdős Problem #52
Let A be a finite set of integers. Is it true that for every ε>0 max( lvert A+Arvert,lvert AArvert)≫_ε lvert Arvert^2-ε?
No claims yet Be the first →
Erdős Problem #522
Let f(z)=Σ_0≤ k≤ n ε_k z^k be a random polynomial, where ε_k∈ -1,1 independently uniformly at random for 0≤ k≤ n. Is it true that, if R_n is the number of roots of f(z) in z∈ ℂ : lvert zrvert ≤ 1, then R_n/n/2→ 1 almost surely?
No claims yet Be the first →
Erdős Problem #535
Let r ≥ 3, and let f_r(N) denote the size of the largest subset of 1,…,N such that no subset of size r has the same pairwise greatest common divisor between all elements.
No claims yet Be the first →
Erdős Problem #536
Let ε>0 and N be sufficiently large. Is it true that if A⊆ 1,…,N 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?
No claims yet Be the first →
Browse by field
CombinatoricsNumber theoryGraph theoryAlgebraGeometryAnalysisProbabilityLogic & formalisationAlgorithmsComplexityComputabilityOptimisationCryptography theoryMachine learningPhysicsTheoretical physicsAstrophysics & cosmologyQuantum informationChemistryMaterialsBiologyNeuroscienceEcologyClimateEarth scienceEconomics