Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let p be a prime and A_p = k! pmodp : 1≤ k<p. Is it true that lvert A_prvert ~ (1-1/e)p?
Let a,bgeqslant 2 be integers, and choose maximal positive integers k and ℓ such that a=A^k and b=B^ℓ. Granville–Pappalardi's power-base conjecture. There are infinitely many primes of the form |a^m-b^n| with m,n positive integers, unless…
Let P(x)∈Z[x] be a monic irreducible polynomial, and let m_H(P) denote its quaternionic Mahler measure. Quaternionic Lehmer conjecture. There is a constant c such that, for every monic irreducible polynomial P(x)∈Z[x], m_H(P)≥ c. This is…
Let Δ_n∈Z_>0, and let r∈Z_>0 be a divisor of Δ_n. Consider the parametrized formulas for A,B,C,D constructed in Sections 2.1 and 2.2, and require them to yield positive, non-zero integer values. Divisor-bound conjecture. It is necessary…
Let q=p^k, where p>7 is a prime and k>1, and let ff be the finite field with q elements. For alphainff^*, define f(X)=X^q(p-1)+1+α X^pq+X^q+p-1. Gupta–Rai conjecture. The trinomial f(X) is a permutation polynomial over F_q^2 if and only if…
Question 12 (Julio Cesar Bueno de Andrade). Fix q, h(x) ∈ Fq[x], k ≥ 3. Get asymptotics for ∑ f dk(f ) · dk(f + h)where f ranges over degree n polynomials, as n tends to infinity.
Let B_n=f(x)=∑_i=0^nε_i x^i: ε_i∈0,1, ε_n=1. The Erdős–Mauduit–Sárközy conjecture asserts that there exists a constant c>0 such that #f∈B_n: gcd(f,f')=1 in Z[x]~ c 2^n (n→∞). Equivalently, a positive limiting proportion of integer…
If G is a group then can there exist an exact covering of G by more than one cosets of different sizes? (i.e. each element is contained in exactly one of the cosets)
Are there infinitely many betrothed numbers?
Does iterating unsigned differences on prime sequence always yield 1 as first element?
For i≥ 0 and q>0, let s_i^S(q) be the number of sets of i+1 distinct integer squares greater than one whose sum is below q, and let s_i^C(q) be the number of sets of i+1 distinct positive integer cubes greater than one whose sum is below…
Let M(n)=2^n-1 denote the nth Mersenne number. The sequence of prime Mersenne numbers is infinite. Infinitude conjecture. There are infinitely many integers n such that M(n) is prime. This is a central open problem concerning Mersenne…
What is the smallest k such that R^2 can be red/blue coloured with no pair of red points unit distance apart, and no k-term arithmetic progression of blue points with distance 1?
Is reflectivity of a maximal arithmetic lattice a decidable problem? If so, can we find an efficient algorithm to solve this decision problem?
For a positive integer n, consider all ways of splitting 1,2,…,2n into two complementary sets A=a_1,…,a_n and B=b_1,…,b_n, i.e. A∩ B=∅, A∪ B=1,2,…,2n, and |A|=|B|=n. For such a splitting and an integer k with -2n≤ k≤ 2n, let…
For positive integers k,n,s with k≥ n+s and n≥ s≥ 1, let X_0^⋆(k,n,s) denote the sum of all multiple zeta-star values of weight k, depth n, and height s. Kaneko–Ohno conjecture. For any positive integers m,n,s with m,n≥ s, one has…
Can every integer N≥ 2 be written as N=frac∏_1≤ i≤ k(m+i)∏_1≤ i≤ k(n+i) for some k≥ 2 and m≥ n+k?
Conjecture Let f(n) = 3n+1 if n is odd and n/2 if n is even. Let f(1) = 1. Assume we start with some number n and repeatedly take the f of the current number. Prove that no matter what the initial number is we eventually reach 1.
Suppose that a small sieve process leaves a set of maximal size. What is the structure of that set?
Let d∈N_≥ 2 be squarefree, let K=Q(√d), and let O_K=Z[ω] be the ring of integers of K, where ω= √d if d≡ 2,3mod 4, frac1+√d2 if d≡ 1mod 4. Let ε=x+yω be the fundamental unit of O_K with ε>1, where x,y∈N_0. Ankeny–Artin–Chowla conjecture.…