Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let A⊆ N and D(A) be the set of those numbers which occur infinitely often as a_1-a_2 with a_1,a_2∈ A. What conditions on A are sufficient to ensure D(A) has bounded gaps?
Is it true that for every n≥ 1 there is a k such that n(n+1)…(n+k-1)| (n+k)… (n+2k-1)?
Can there exist two distinct integers x and y such that x,y have the same prime factors, x+1,y+1 have the same prime factors, and x+2,y+2 also have the same prime factors?
Let n∈N satisfy n≠0 and suppose that n≠ p^k for every prime p and every k∈N. What is the largest integer not of the form ∑_1≤ i<nc_ibinom ni, where every c_i∈N? The claimed largest integer is ∑_p| n(∑_1≤ d≤ v_p(n)binom np^d)(p-1)-n, where…
Let p≥ 3 be prime, let γ,e_2,e_3∈1,…,p-2 satisfy e_3>e_2>0 and gcd(e_2,e_3,p-1)=1, and consider the trinomial γ+x^e_2+x^e_3. Polylogarithmic root-bound conjecture. There is an absolute constant c≥ 1 such that this trinomial has no more…
Let t_n denote the quantity associated with the hyperelliptic equation in the paper, and let c∈(0,1) be fixed. Assume that n is a non-square integer sufficiently large in terms of c. Erdős–Graham–Granville–Selfridge conjecture. One has…
Let n_1<n_2<… be the sequence of integers which are the sum of two squares. Explore the behaviour of (i.e. find good upper and lower bounds for) the consecutive differences n_k+1-n_k.
Can one find Verlinde-like dimension formulas for other families of dominant weights, and do the resulting character formulas coincide with those predicted by Lusztig’s conjecture?
For a sequence A:N→N and n∈N, let IsGoodFor(A,n) mean that A(0)=n, that A is strictly increasing, and that for every j∈N, A(j+1) is the least natural number m such that A(j)<m and m cannot be written as ∑_i∈ [a,b]A(i) for any a,b∈N with…
Are there infinitely many Pierpont primes?
Let f(x)∈Z[x] be irreducible over Q with all roots real, let f(α)=0, let k=Q(α), and let O_k be its ring of integers. How often is O_k a principal ideal domain; does this happen infinitely often? How often is O_k Euclidean with respect to…
Say something interesting about wild ramification for arboreal representations. e.g. study Galois representations over local fields of residue characteristic dividing degree of f (or even less than or equal to the degree). e.g. An arboreal…
Let u_n=p_n/n, where p_n is the nth prime. Does the set of n such that u_n<u_n+1 have positive density?
For each positive integer k, does the equation |2^m - 3^n| = k have only finitely many solutions in positive integers m and n?
Let E denote the set of even integers, let k∈ E, and let n be an integer. The periodicity conjecture. The n-orbit is periodic. The preceding analysis shows divergence for odd k except at specified fixed points, while the behavior for even…
If x₁,x₂ and y₁,y₂ are linearly independent over ℚ, is at least one of e^(xᵢyⱼ) transcendental?
Let B_k(p) be a basis for holomorphic or Hecke-Maass forms for Γ_0(p)⊂ SL_2(Z) of weight k. Obtain an asymptotic with a power saving error term for the second moment ∑_f∈B_k(p)∑_g∈B_ℓ(q) |L(1/2, f× g)|^2, as the level p and q become…
Let u≤ v be such that the largest prime dividing ∏_u≤ m≤ vm appears with exponent at least 2. Is it true that v-u=v^o(1)? Can v-u be arbitrarily large?
Let M(n,k)=[n+1,…,n+k] be the least common multiple of n+1,…,n+k. Is it true that for all m≥ n+k M(n,k) eq M(m,k)?
For k∈N, let h(k)=j(p_k#) be the Jacobsthal function at the product of the first k primes, and let H(k) be the maximum of the Jacobsthal function over products of k distinct primes: H(k)=max_d_P(n)=kj(n). Eventual strict inequality…