Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let a_1=1 and a_2=2 and for k≥ 3 choose a_k to be the least integer >a_k-1 which is the sum of at least two consecutive terms of the sequence. What is the asymptotic behaviour of this sequence?
Given a prime p and a finite set of nonzero residues A⊆ F_p, can the elements of A always be ordered so that all of their nonempty partial sums are distinct modulo p?
For fixed r≥0, does the set of integers n for which binom nk is squarefree for at least r indices 1≤ k<n have a natural density, and is that density positive?
Is C(G)\not\subseteq\mathbb{Q} equivalent to \mathbb{Z}/p\wr K\subseteq G for some prime p and infinite finitely generated K? What is C(\mathbb{Z}/2\wr\mathbb{Z})? For an automaton A and F_A(x)=\sum_{i\ge1}\dim\ker(M_i) x^{d(M_i)}, what…
Is there a covering system all of whose moduli are of the form p-1 for some primes p≥ 5?
Let t be a positive integer, let S=x_1,x_2,…,x_n be a GCD-closed set of positive integers, and let the power LCM matrix be the matrix [(lcm(x_i,x_j))^t]. The Hong conjecture. There exists a positive integer k(t) depending only on t such…
For each prime p, let f_p be the polynomial defined in the paper, and let ρ(m) be the relative density of primes p for which f_p has exactly m roots; equivalently, there are exactly m pairs of consecutive pth powers modulo p^2. Six-pack…
For ε,η>0, let P(n(n+1)…(n+k)) denote the greatest prime divisor of the product. Is it true that there exists k∈ N such that the lower asymptotic density of the set n∈ N:P(n(n+1)…(n+k))>n^1-ε is at least 1-η? In precise limit form, does…
Let a(n) denote the nth term of OEIS A091468. The conjecture is that, for every n≥ 0, a(n)=3 A003239(n)-2.
Subconvexity bound rm GL_2 in the `conductor dropping' case Let f be a holomorphic or Hecke-Maass cusp form for rm GL_2. Use a δ-method to prove the following subconvexity bounds for the following L-functions: \begin{enumerate} \item Level…
For an integer base β, let Υ(β) be the smallest K such that, for all k≥ K, the digits 0,1,…,β-1 are uniformly distributed in the relevant sequence (Φ_β^k(n))_n=1^N_k. Maximum conjecture. If coprime bases β_1 and β_2 satisfy Υ(β_1)=u and…
Let n be a positive integer, and consider the Collatz dynamic on odd positive integers. The Golden Automaton is the finite proof system described in the source for establishing Collatz convergence. Golden Automaton conjecture. If all odd…
Racks We do not know whether the following Question could be answered. Question 3. Classify the pairs (G, V ) where G is a finite group and V \in CG CG YD satisfies dim B(V ) < \infty and compute the relations of B(V ). If G is abelian,…
Let 1≤ a_1<… <a_k≤ n be integers such that all sums of the shape ∑_u≤ i≤ va_i are distinct. Let f(n) be the maximal such k. How does f(n) grow? Is f(n)=o(n)?
Let overlinek be a fixed algebraic closure of k, let k^rm sep be its separable closure, and let G=Gal(k^rm sep/k). Let ρ:G→ C_∞^* be a character factoring through a finite abelian extension. Let G_1 be the Galois group of the maximal…
Let X ~ MVN(θ, I_d), where I_d denotes the d-dimensional identity matrix. Consider the problem of estimating θ using estimators of the form X + h(X), where h is in some class H of functions. By SURE, hatr_h = d + 2∇ · h(X) + |h(X)|^2 is an…
Can integer factorization be solved in polynomial time on a classical computer?
Let S be the abelian loop of odd numbers used in the paper, with binary operation •. Consider quartets (a,b,c,d) of distinct numbers in S satisfying a • b=b • c=c • d=d • a. Four-cycle conjecture. There are infinitely many such quartets.…
For an odd positive integer k and an integer n satisfying gcd(n,k)=gcd(n+1,k)=1, let N_k(n) be the number of pairs of positive integers (b_1,b_2) such that b_1,b_2≤ k-1/2, b_1+b_2≥ k+1/2, b_2≡ nb_1pmodk. Parity conjecture. The number…
Let n≥ 3 be an odd integer and let m≥ 1 be an integer. For an integer d, consider the m+1 successive quadratic fields Q(√d),Q(√d+1),…,Q(√d+m). Generalized Iizuka conjecture. For any odd integer n≥ 3 and any integer m≥ 1, there is an…