(m,k)-perfect numbers
There does not exist a (2,5)-perfect number
No claims yet Be the first →
Formal Conjectures: open problems with Lean statements
Formal Conjectures is an open repository, started by Google DeepMind, of conjectures stated in Lean 4 with Mathlib. Every open problem from it that we import keeps its exact Lean statement, so a proof submitted here is checked by the Lean kernel against that statement. The collection covers Erdős problems, OEIS conjectures, Ben Green's open problems, Wikipedia's lists of unsolved problems, MathOverflow questions and more.
Source: google-deepmind/formal-conjectures. Licence: Apache License 2.0.
By field: Number theory 486Combinatorics 74Graph theory 73Geometry 42Algebra 36Analysis 30Logic & formalisation 10Quantum information 3Algorithms 2Probability 1
A binomial coefficient sum
Let b(n) = a(2n-1). Then the supercongruence b(n p^k) ≡ b(n p^k-1) pmodp^3k holds for positive integers n and k and all primes p ≥ 5. - Zhi-Wei Sun, Nov 16 2019
No claims yet Be the first →
A binomial coefficient summation
Let b(n) = a(2n-1). Then the supercongruence b(n p^k) ≡ b(n p^k-1) pmodp^3k holds for positive integers n and k and all primes p ≥ 5. - Zhi-Wei Sun, Nov 16 2019
No claims yet Be the first →
A conjecture by Margulis on matrix groups
Let D be the diagonal group of SL_n(ℝ) where n ≥ 3. Then any relatively compact D-orbit in SL_n(ℝ) / SL_n(ℤ) is closed.
No claims yet Be the first →
A GCD-Driven Sequence with Universal Jumps
Does every positive integer occur as a difference in this sequence?
No claims yet Be the first →
a(0) = 1, a(n) = a(n-1)a(n-1) + 2
Prime for a(1) = 3, a(2) = 11, a(4) = 15131; semiprime for a(3) = 123 = 3 41, a(5) = 228947163 = 3 76315721. a(6), added by Jonathan Vos Post, has 4 prime factors. a(7) = 41 811^2 106693969 317171188688357726699 8272236925540996054440172449761. When is the next prime in the sequence?
No claims yet Be the first →
a(n) = (smallest prime > n^2) - n^2
Conjecture: a(n) ≤ 1 + φ(n) for n > 0. This improves on Oppermann's conjecture, which says a(n) < n. - Thomas Ordowski, Dec 17 2014
No claims yet Be the first →
a(n) = 2^(2^n)
I conjecture that a(n) ; n>1 are the numbers such that n^4-1 divides 2^n-1, intersection of A247219 and A247165. - M. F. Hasler, Jul 25 2015 This formalizes the reverse direction.
No claims yet Be the first →
a(n) = 3a(n-1) + a(n-2) - 3a(n-3)
The current sequence contains primes, including 3, 5, 41, 21523361. Is there an (a, b, c) weighted tribonacci sequence with a, b, c relatively prime which is prime-free?
No claims yet Be the first →
a(n) = lcm1,2,…,n/denom(H(n))
It is conjectured that every odd number occurs in this sequence.
No claims yet Be the first →
a(n) = the number of values of k <= 10^n such that √(k(k+1)(k+2)(k+3)+1) is prime
Conjecture: a(n)/A006880(n) → 1.77... where A006880(n) is the number of primes ≤ 10^n.
No claims yet Be the first →
a(n) = Σ_j=1^n (3^j + (-2)^j)
First primes are a(11) = 264353 and a(17) = 193622861. Additional primes: a(71), a(91), a(431). What is the next prime?
No claims yet Be the first →
a(n) = Σ_k=0^n C(2k, k)^3
Conjecture 1 (Peter Bala, 2024): If prime p is in A003625 then a(p^2) ≡ 8 + p^2 pmodp^3.
No claims yet Be the first →
a(n) is the integer whose decimal digits are the first n+1 decimal digits of π
Wolfgang Haken (1977) conjectured that no term of this sequence is a perfect square, and estimated the probability that this conjecture is false to be smaller than 10^-9.
No claims yet Be the first →
abc conjecture
For every positive real number ε, there exist only finitely many triples (a, b, c) of coprime positive integers, with a + b = c, such that c > rad(abc)^(1+ε)
No claims yet Be the first →
Agoh-Giuga conjecture
The Agoh-Giuga Conjecture, Agoh's formulation
No claims yet Be the first →
Agrawal's conjecture
Agrawal's Primality Conjecture. Does the congruence (X-1)^n ≡ X^n - 1 pmodn, X^r-1 imply n is prime (with a specific exception for n^2 ≡ 1 pmodr)? While the "if" direction is a known theorem, the "only if" direction remains a conjecture.
No claims yet Be the first →
Algebraic consequences of the Farrell–Jones conjecture
Vanishing of the reduced projective class group for integral group rings. If G is torsion-free, that is, if its only element of finite order is 1, then every finitely generated projective module over ℤ[G] is stably free.
No claims yet Be the first →
Alternating sum of signs of powers of 3/2
For n large enough, does a(n) > √(n) always hold?
No claims yet Be the first →
Amicable numbers
Relatively prime amicable numbers conjecture. Do there exist amicable numbers (a, b) with gcd(a, b) = 1? All known amicable pairs share a common factor. It is an open question whether a pair of relatively prime amicable numbers can exist. Reference: Wikipedia
No claims yet Be the first →
An Arithmetic Sum Associated with the Classical Theta Function
Conjecture 1.1: For any odd prime k, the sum associated with the classical theta function θ_3, S(k) is positive.
No claims yet Be the first →
Andrica's conjecture
Andrica's conjecture The inequality √(p_n+1)-√(p_n) < 1 holds for all n, where p_n is the n-th prime number.
No claims yet Be the first →
Apéry numbers
For each n = 1, 2, 3, … the polynomial a_n(x) = Σ_k=0^n C(n, k)^2 C(n+k, k) x^k is irreducible over the field of rational numbers. - Zhi-Wei Sun, Mar 21 2013
No claims yet Be the first →
Are prime numbers among sums of prime numbers distributed as frac n2ln(n)?
The conjecture claims that π_n∼frac n2ln(n). In other words, primes are distributed among the much sparser sequence (S_n)_n with essentially the same density as in the positive integers, up to a factor of 2. MathOverflow 434111.
No claims yet Be the first →
Array read by upward antidiagonals
A "Goldbach Conjecture" for this sequence: when there are n terms between consecutive odd integers 2n+1 and 2n+3 for n > 0, at least one will be the product of 2 primes (not necessarily distinct).
No claims yet Be the first →
Artin's conjecture on primitive roots
Artin's Conjecture on Primitive Roots, first half. Let a be an integer that is not a square number and not −1. Then the set S(a) of primes p such that a is a primitive root modulo p has a positive asymptotic density inside the set of primes. In particular, S(a) is infinite.
No claims yet Be the first →
Ascending descending base exponent transform of 2^n
The first prime terms in this (always odd) sequence are a(1) = 3, a(3) = 41, and a(4) = 593. What is the next prime? The OEIS comment currently says a(5) = 543, but this conflicts with its defining formula, b-file, and examples: the actual index-five term is the composite number 135457.
No claims yet Be the first →
Ascending descending base exponent transform of factorials
Is there a nontrivial power after a(4) = 5^3?
No claims yet Be the first →
Ascending descending base exponent transform of squares
The smallest prime in this sequence is a(2) = 5. What is the next prime?
No claims yet Be the first →
Asymptotic density of powerful numbers
Can the exponent 1/6 in the error term of the Bateman–Grosswald asymptotic be improved unconditionally? That is, is there δ > 0 such that Q(x) = ζ(3/2)/ζ(3) x^1/2 + ζ(2/3)/ζ(2) x^1/3 + O(x^1/6 - δ)? Improvements are known under the Riemann Hypothesis.
No claims yet Be the first →
Babai–Seress Conjectures on the Diameter of Finite Groups
Babai–Seress Conjecture (Conjecture 1.5): There exists an absolute constant C such that the diameter of the alternating group A_n satisfies diam(A_n) ≤ n^C. Reference: L. Babai and Á. Seress, On the diameter of permutation groups, European Journal of Combinatorics 13 (1992), Conjecture 1.580029-0)
No claims yet Be the first →
Balanced prime conjecture
Let p_k be the k-th prime number. Are there infinitely many n such that (p_n + p_n+2) / 2 is prime?
No claims yet Be the first →
Banach-Mazur Rotation Problem
The Banach–Mazur rotation problem asks whether every separable Banach space whose group of linear isometric equivalences acts transitively on the unit sphere is linearly isometric to a Hilbert space.
No claims yet Be the first →
Barker sequences
Every Barker sequence has length at most 13.
No claims yet Be the first →
Bateman-Horn Conjecture
The Bateman-Horn Conjecture Given a finite collection of distinct irreducible polynomials non-constant f_1, f_2, …, f_k ∈ ℤ[x] with positive leading coefficients that satisfy the Schinzel condition, the number of positive integers n ≤ x for which all polynomials f_i are simultaneously prime is…
No claims yet Be the first →
Beal conjecture
The Beal Conjecture: if we are given positive integers A, B, C, x, y, z such that x, y, z > 2 and A^x + B^y = C^z then A, B, C have a common divisor.
No claims yet Be the first →
Beaver Math Olympiad (BMO)
BMO#1) Let (a_n)_n ≥ 1 and (b_n)_n ≥ 1 be two sequences such that (a_1, b_1) = (1, 2) and (a_n+1, b_n+1) = begincases (a_n-b_n, 4b_n+2) & if a_n ≥ b_n cr (2a_n+1, b_n-a_n) & if a_n < b_n endcases for all positive integers n. Does there exist a positive integer i such that a_i = b_i?
No claims yet Be the first →
Beck–Fiala theorem and conjecture
The Beck–Fiala conjecture There exists a universal constant C > 0 such that every set system S_1, …, S_m ⊆ [n] of degree at most t admits a colouring χ : [n] → -1, +1 with |Σ_j ∈ S_i χ(j)| ≤ C √(t) for every i.
No claims yet Be the first →
Ben Green's Open Problem 1
Let A be a set of n positive integers. Does A contain a sum-free set of size at least frac n 3 + Ω(n), where Ω(n) → ∞ as n → ∞?
No claims yet Be the first →
Ben Green's Open Problem 16
What is the largest subset of [N] with no solution to x + 3y = 2z + 2w in distinct integers x, y, z, w?
No claims yet Be the first →
Ben Green's Open Problem 18
Suppose that G is a finite group, and let A ⊂ G × G be a subset of density α. Is it true that there are ≫_α |G|^3 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]
No claims yet Be the first →
Ben Green's Open Problem 2
Let A ⊂ ℤ be a set of n integers. Is there a set S ⊂ A of size (log n)^100 such that the restricted sumsetS hat+ S is disjoint from A?
No claims yet Be the first →
Ben Green's Open Problem 21
Suppose that a_1, …, a_k are integers which do not satisfy Rado's condition: thus if Σ_i ∈ I a_i = 0 then I = ∅. It then follows from Rado's theorem that the equation a_1x_1 + ⋯ + a_kx_k = 0 is not partition regular.
No claims yet Be the first →
Ben Green's Open Problem 31
Can we improve the lower bound N^1/2 + O(1), at least for infinitely many N?
No claims yet Be the first →
Ben Green's Open Problem 33
Are there infinitely many q for which there is a set A ⊂ ℤ/qℤ, |A| = (√(2) + o(1))q^1/2, with A + A = ℤ/qℤ? [Gr24]
No claims yet Be the first →
Ben Green's Open Problem 35
Lower bound for c(p) for 1 < p ≤ ∞, improving the known value √(4/7) at p = 2 or the known value 0.64 at p = ∞.
No claims yet Be the first →
Ben Green's Open Problem 37
Given a natural number N, what is the smallest size of a subset of ℕ that contains, for each d = 1, …, N, an arithmetic progression of length k with common difference d.
No claims yet Be the first →
Ben Green's Open Problem 4
What is the largest product-free set in the alternating group A_n?
No claims yet Be the first →
Ben Green's Open Problem 40
Does f(r) → ∞? [Gr24]
No claims yet Be the first →
Ben Green's Open Problem 41
How many rotated (about the origin) copies of the 'pyjama set' \(x, y) ∈ ℝ^2 : dist(x, ℤ) ≤ ε\ are needed to cover ℝ^2? That is, determine the minimal number of rotations as a function of ε > 0.
No claims yet Be the first →
Ben Green's Open Problem 45
Can we pick residue classes a_p pmodp, one for each prime p ≤ N, such that every integer ≤ N lies in at least 10 of them? Erdős remarks that he does not know how to answer it with 10 replaced by 2; this is Erdos689.erdos_689.
No claims yet Be the first →
Ben Green's Open Problem 46
We conjecture that the best-known lower bound can be improved.
No claims yet Be the first →
Ben Green's Open Problem 5
Which finite groups have the smallest biggest product-free sets? We formalise this as: determine the supremum of exponents α such that every nontrivial finite group of order n contains a product-free set of size ≥ c n^α for some absolute constant c > 0.
No claims yet Be the first →
Ben Green's Open Problem 50
Let A ⊂ 𝔽_2^n be a set of density α > 0. Does 10A contain a coset of some subspace of dimension at least n - O(log(1/α))?
No claims yet Be the first →
Ben Green's Open Problem 58
Suppose A, B ⊆ 1, …, N both have size at least N^0.49. Must the sumset A + B contain a composite number?
No claims yet Be the first →
Ben Green's Open Problem 60
Is there an absolute constant c > 0 such that, whenever A ⊆ ℕ is a set of squares with |A| ≥ 2, the sumset A + A satisfies |A + A| ≥ |A|^1 + c?
No claims yet Be the first →
Ben Green's Open Problem 61
Suppose that A + A contains the first n squares. Is |A| ≥ n^1 - o(1)? It is known that necessarily |A| ≥ n^2/3 - o(1), whilst in the other direction there do exist such A with |A| ≪_C n / log^C n for any C.
No claims yet Be the first →
Ben Green's Open Problem 62
Let p be a large prime, and let A be the set of all primes less than p. Is every x ∈ 1, …, p-1 congruent to some product a_1 a_2 where a_1, a_2 ∈ A?
No claims yet Be the first →
Ben Green's Open Problem 66
Is there always a sum of two squares between X - 1/10X^1/4 and X? We formalize this as an eventual statement for sufficiently large real X.
No claims yet Be the first →
Ben Green's Open Problem 72
The no-k-in-line problem: For which k > 2 does every N × N grid with N ≥ k contain a set of (k - 1) N points with no k on a line, so that AllowedSetSize k N is the pigeonhole bound (k - 1) N?
No claims yet Be the first →
Ben Green's Open Problem 77
Given n points in the unit disc, must there be a triangle of area at most n^-2+o(1) determined by them?
No claims yet Be the first →
Ben Green's Open Problem 82
Let A ⊂ ℤ be a set of size n. For how many θ ∈ ℝ/ℤ must we have Σ_a ∈ A cos(2π aθ) = 0? The answer is the function minZeros.
No claims yet Be the first →
Ben Green's Open Problem 94
Let A ⊂ R be a set of positive measure. Does A contain an affine copy of 1, 1/2, 1/4, . . . ?
No claims yet Be the first →
Betrothed numbers
Same parity betrothed numbers conjecture. Do there exist betrothed numbers (m, n) where both have the same parity (both even or both odd)? All known betrothed pairs consist of one even and one odd number. The requirement m ≠ n is part of the question: IsBetrothed n n says σ(n) = 2n + 1, i.e.
No claims yet Be the first →
Binary representation of primes that divide a number, in decimal
Starting at any n and iterating the map n ↦ a(n), we will always reach 0. - _Antti Karttunen_, Jun 18,20 2017
No claims yet Be the first →
Bloch and Landau constants
Ahlfors and Grunsky also conjectured in [AG37] that this upper bound is the precise value of the Bloch constant.
No claims yet Be the first →
Bondy's conjecture on longest cycles in highly connected graphs
Conjecture 1 (Bondy, 1980). Let k ≥ 1 and let G be a k-connected graph on n vertices. If δ(G) ≥ n + k(k-1)/k+1, then for every longest cycle C of G, every path in G - V(C) has at most k-1 vertices.
No claims yet Be the first →
Borsuk's conjecture
Borsuk's conjecture, open range: every bounded subset of ℝ^n with at least two points can be partitioned into n + 1 sets of strictly smaller diameter, for 4 ≤ n ≤ 62. The conjecture is known to be true for n ≤ 3 and false for n ≥ 63.
No claims yet Be the first →
Brennan's Conjecture
Brennan's conjecture, part 1: B(-2) = 1.
No claims yet Be the first →
Brocard's Conjecture
Brocard's Conjecture For every n ≥ 2, between the squares of the n-th and (n+1)-th primes, there are at least four prime numbers.
No claims yet Be the first →
Büchi's problem
Büchi's problem There exists a positive integer M such that, for all integers x and a, if (x+n)^2 + a is a square for M consecutive values of n, then a = 0.
No claims yet Be the first →
Bugeaud Collection of Conjectures and Open Questions: Confined Powers of Non-Pisot Numbers
Problem 10.7. Let ε be a positive real number. Are there arbitrarily large real numbers α such that α is not a Pisot number and all the fractional parts α^n, n ≥ 1, are lying in an interval of length ε / α? [Bug12b]
No claims yet Be the first →
Bugeaud Collection of Conjectures and Open Questions: Fractional Parts of Powers
Problem 10.1. Are there a transcendental number α and a positive real number ξ such that lVert ξ α^n rVert tends to~0 as~n tends to infinity? [Har19] (Trivial for |α| < 1)
No claims yet Be the first →
Bugeaud Collection of Conjectures and Open Questions: Mahler's Z-numbers
Problem 10.9. There are no real numbers ξ such that 0 ≤ ξ (3/2)^n < 1/2 for every positive integer n, i.e. no Z-number exists. Posed by Mahler [Mah68].
No claims yet Be the first →
Bugeaud Collection of Conjectures and Open Questions: p-adic Littlewood Conjecture
Problem 10.8 (p-adic Littlewood conjecture). For every real number ξ and every prime number p, inf_q ≥ 1 q · lVert q ξ rVert · |q|_p = 0, where lVert · rVert denotes the distance to the nearest integer and |·|_p denotes the p-adic absolute value. Posed by de Mathan and Teulié [dMT04].
No claims yet Be the first →
Bugeaud Collection of Conjectures and Open Questions: Pisot orbits on the Cantor set
Problem 10.61. Let α > 2 be a Pisot number. For every ξ ∈ C(α) the sequence (ξ α^n)_n ≥ 1 is not uniformly distributed modulo one.
No claims yet Be the first →
Bunyakovsky conjecture
Bunyakovsky conjecture If a polynomial f over integers satisfies both Schinzel and Bunyakovsky conditions, there exist infinitely many natural numbers m such that f(m) is prime.
No claims yet Be the first →
Busy Beaver
Determine the value of the Busy Beaver function at n = 6.
No claims yet Be the first →
Can a prime p satisfy 2^p-1 ≡ 1 pmodp^2 and 3^p-1 ≡ 1 pmodp^2?
Can a prime p satisfy 2^p-1 ≡ 1 pmodp^2 and 3^p-1 ≡ 1 pmodp^2 simultaneously? That is, does there exist a prime p that is both a Wieferich prime and a Mirimanoff prime? Wikipedia's list of unsolved problems poses this question, citing J. B. Dobson, On Lerch's formula for the Fermat quotient.
No claims yet Be the first →
Carmichael's totient function conjecture
Carmichael's totient function conjecture: For every positive natural number n, there exists a natural number m with m ≠ n, such that φ(n) = φ(m).
No claims yet Be the first →
Casas-Alvero Conjecture
The Casas-Alvero conjecture states that in characteristic zero, if a monic polynomial P has the Casas-Alvero property, then P = (X - α)ᵈ for some α.
No claims yet Be the first →
Catalan-Mersenne numbers
Catalan-Mersenne conjecture: All terms of the Catalan-Mersenne sequence are prime.
No claims yet Be the first →
Catalan's conjecture and related Diophantine equations
For positive integers a, b, and c, there are only finitely many positive solutions (x, y, m, n) to the equation ax^n - by^m = c where (m, n) ≠ (2, 2) and x, y > 1.
No claims yet Be the first →
Central binomial sum a(n) = Σ_k=0^n (-4)^k C(n, k)^2 C(n-k, k)^2
If p is a prime with p ≡ 1, 9 pmod20 and p = x^2 + 5y^2 with x, y integers, then Σ_k=0^p-1 a(k) ≡ 4x^2 - 2p pmodp^2. - _Zhi-Wei Sun_, Jul 01 2010
No claims yet Be the first →
Central binomial sum a(n) = Σ_k=0^n C(n, k)^2 C(n-k, k)^2 (-16)^k
If p is a prime with (p/7) = 1 and p = x^2 + 7y^2 with x, y integers, then Σ_k=0^p-1 (-1)^k a(k) ≡ 4x^2 - 2p pmodp^2. - _Zhi-Wei Sun_, Jul 17 2010
No claims yet Be the first →
Central trinomial coefficients
An integer n > 3 is prime if and only if a(n) ≡ 1 pmodn^2. We have verified this for n up to 8 · 10^5, and proved that a(p) ≡ 1 pmodp^2 for any prime p > 3 (cf. A277640). - Zhi-Wei Sun, Nov 30 2016
No claims yet Be the first →
Chua's Euclidean prime sequence
Does Chua's sequence contain every prime?
No claims yet Be the first →
Chvátal's Conjecture
If F is a decreasing family of sets of some finite type α, then there is some element x of α such that the family consisting of all members of F containing x is an intersecting subfamily of F with maximal cardinality.
No claims yet Be the first →
Class number problem for real quadratic fields
There are infinitely many real quadratic fields ℚ(√d) with class number one, where d > 1 is a squarefree integer.
No claims yet Be the first →
Coefficients of Π_k>0 (1 - x^k/k!)
The coefficients c(n) of A(x)^2 = (Σ_n ≥ 0 a(n) x^n)^2 differ in sign from c(n-1) if and only if n is a triangular number. - _Peter Bala_, Mar 17 2022
No claims yet Be the first →
Collatz step differences
Conjecture 1: More than half of the terms are 0. - _Ya-Ping Lu_, May 04 2024
No claims yet Be the first →
Concatenation of the next n numbers
"The second term is a prime. When is the next prime, if there is another? - _N. J. A. Sloane_, Dec 16 2016"
No claims yet Be the first →
Congruent Number
Tunnell's theorem (sufficient condition assuming BSD) for odd squarefree congruent numbers.
No claims yet Be the first →
Conjecture 1.35(c)
Do there exist simple pro-orderable groups?
No claims yet Be the first →
Conjecture 1.40
Is a group a nilgroup if it is the product of two normal nilsubgroups? Since H and K are normal, the product HK coincides with the join H sqcup K, so "G is the product of H and K" is stated as H sqcup K = G.
No claims yet Be the first →
Conjecture 1.74 (Minimal topological groups)
Describe all minimal topological groups, that is, all non-discrete Hausdorff topological groups whose proper closed subgroups are all discrete.
No claims yet Be the first →
Conjecture 19.25
Let G and H be finite groups of the same order with Σ_g ∈ G φ(|g|) = Σ_h ∈ H φ(|h|), where φ is the Euler totient function. Suppose that G is simple. Is H necessarily simple?
No claims yet Be the first →
Conjecture 20.76
Let G be a finite p-group and assume that all abelian normal subgroups of G have order at most p^k. Is it true that every abelian subgroup of G has order at most p^2k?
No claims yet Be the first →
Conjecture 8.8
Does there exist a non-cyclic finitely presented group G which contains an element a such that each element of G is conjugate to some power of a? Here a power of a means a^n for some n ∈ ℤ.
No claims yet Be the first →
Conjecture about cardinality of Lindelöf spaces
Is there a Lindelöf Tychonoff space with singletons as Gδ sets with cardinality greater than the continuum? Note: the cited paper uses a blanket convention that all spaces are Tychonoff.
No claims yet Be the first →