Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let ω(n) count the number of distinct primes dividing n. Are there infinitely many n such that, for all m<n, we have m+ω(m) ≤ n? Can one show that there exists an ε>0 such that there are infinitely many n where m+ε ω(m)≤ n for all m<n?
For each integer k≥ 0, let h(k) be the associated class number, and call k admissible when it satisfies the paper's admissibility condition. For K≥ 0, let C_0>0, let C_t>0 for each t≥ 1, and let θ satisfy 1/2<θ<1. Distribution conjecture.…
Let k≥ 3 and A⊂ N be the set of kth powers. What is the order of growth of 1_A^(k)(n), i.e. the number of representations of n as the sum of k many kth powers? Does there exist some c>0 and infinitely many n such that 1_A^(k)(n) >n^c?
Let c>0. If x is sufficiently large then does there exist n≤ x such that the values of φ(n+k) are all distinct for 1≤ k≤ (log x)^c, where φ is the Euler totient function?
Is there an infinite graph G which contains no K_4 and is not the union of countably many triangle-free graphs?
Let n be a positive odd integer. Define the q-Pochhammer symbol by (a;q)_k=∏_j=0^k-1(1-aq^j), and let 2kbrack k denote the q-binomial coefficient. Tauraso's conjecture. ∑_k=0^n-1fracq^k(-q;q)_k2kbrack k≡ (-1)^(n-1)/2q^(n^2-1)/4…
The mechanism for computing moments in families like χ (mod q), q≤ Q, involve different orthogonality relations than |m-n|=small. Yet the answers are the same. Why?
Let n be a positive integer and let ε>0. Consider the divisors of n in the interval n^1/2-n^1/2-ε≤ d≤ n^1/2+n^1/2-ε. Ruzsa's conjecture. There is a constant K_ε such that, for every positive integer n, the number of such divisors is at…
Can there exist a positive-measure set B in a measure-preserving action of a group of intermediate growth such that \mu(g_1^nB\cap g_2^nB)=0 for every n\ne 0?
Let G_1 be the Euclid–Mullin graph associated with the initial node 1, whose edges and loops are defined by the graph construction in the paper. Infinitely many loops conjecture. The graph G_1 contains infinitely many loops. This is…
Let T(x)=⌊ x⌋(1+x), where x=x-⌊ x⌋. For a rational number x≥ 2, define its order under T to be the least non-negative integer n such that T^n(x) is an integer, if such an n exists. Finite-order conjecture. Every rational number x∈Q_≥ 2 has…
Given a paramodular newform F of weight 2 with rational coefficients, find a construction of the abelian surface to which it corresponds.
For any integer n=∏ p^k_p let Q_2(n) be the powerful part of n, so that Q_2(n) = ∏_substackp k_p≥ 2p^k_p. Is it true that, for every ε>0 and ℓ≥ 1, if n is sufficiently large then Q_2(n(n+1)…(n+ℓ))<n^2+ε? If ℓ≥ 2 then is limsup_n→…
Can one use cycles (Hodge or Tate) to produce correspondences between eigenvarieties of different inner forms?
Let K/Q be a finite Galois extension with ring of integers A. Let J_n denote the minimal n-congruing ideal of A. Ravenel's Global Conjecture, stronger precise form. There exists a correcting factor c∈ A such that, for every n∈N,…
Conjecture: For the automorphic representation \pi attached to f, for each place v where \pi_v is discrete series there is a complex number c_v such that, up to a p-adic unit, \langle f,f\rangle/\langle f_B,f_B\rangle=\prod_{v\mid…
Is it true that, for every r, there is a k such that if I_1,…,I_r are disjoint intervals of consecutive integers, all of length at least k, then ∏_1≤ i≤ r∏_m∈ I_im is not a perfect power?
Is a random polynomial with coefficients in 0, 1 and nonzero constant term almost surely irreducible?
For a prime power q and an integer n≥ 2, call a prime p=1+q+…+q^n-1 a projective prime. Let n≥ 3 be prime and let e be a fixed power of n. Conjecture on projective primes with prime-power bases. For each fixed prime n≥ 3 and each fixed…
Let r(n) denote the digit reversal of n in base ten, and let v(n) be the sum of the primes and exponents appearing in the prime factorization of n. Uniqueness conjecture for the v-palindrome equation. The only positive integer n such that…