Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
The question of finding uniform bounds – when considering cubic surfaces for instance – has been considered in various forms by Manin and has a negative an- swer in general: even in one-parameter families, results of…
Are 4, 7, 15, 21, 45, 75, and 105 the only values of n for which n - 2^k is prime for all k such that 2 ≤ 2^k < n?
Let M(2,n) denote planar integral point sets with n points. An integral point set is prime when it cannot be obtained by scaling a smaller integral point set while preserving its power and structure. Prime-set distance conjecture. For…
For integers n and m, consider the Diophantine equation binomn4+10binomn5+15binomn6=binomm2. The displayed Stirling-number identity shows that this equation arises from equating genfrac0ptnn-3 and genfrac0ptmm-1. Uniqueness conjecture. The…
Are there infinitely many sexy primes?
A weak primary pseudoperfect number is a positive integer n satisfying 1/n+∑_p| n1/p∈N, where the sum is over the prime divisors of n. A strongly pseudoperfect number is understood in the sense defined in the paper. Weak primary…
Is there a necessary and sufficient condition for a sequence of integers b_1<b_2<… that ensures there exists a primitive sequence a_1<a_2<… (i.e. no element divides another) with a_n ≪ b_n for all n? In particular, is this always possible…
Obtain an dynamical understanding of (M_d^N)^rmss-M_d^N and (M_d^N)^rmunstable:=BbbP^M-(M_d^N)^rmss (M=binomN+dd(N+1)-1).
Upper bounds Let M (n) denote the cost of multiplying n-bit integers. By “cost” we mean the number of steps performed by a multitape Turing machine [Pap94]. Theorem 1 ([HvdH21]). M (n) = O(n log n). Suprisingly, the “function field case”…
Let a Kalita–Saikia near superperfect number mean a number that is both a Kalita–Saikia number and a near superperfect number. Nonexistence conjecture. There are no odd Kalita–Saikia near superperfect numbers. The conjecture is proposed as…
Let R(G;k) denote the minimal m such that if the edges of K_m are k-coloured then there is a monochromatic copy of G. Determine the value of R(C_2n;k).
Let F be the class of monic, totally real algebraic-integer polynomials used in the Schur–Siegel–Smyth problem, written as f(x)=∑_i=0^n(-1)^n-ia_i x^i. For 0<b<a, define h(a,b):=alog a-blog b-(a-b)log(a-b), and set…
Let p be a prime with p e 2 and p eq 1 — more precisely, p≡3pmod4 — and let r be a positive integer. Guo's conjecture. ∏_k=1^(p^2r-1)/24k-1/4k+1≡1pmodp^2. This conjecture arose from Guo's q-congruences related to Swisher's supercongruence…
Some coefficients of the Ramanujan tau function appear as coefficients of the piecewise polynomial in the work of Keating, Rodgers, Roditty-Gershon, and Rudnick. Is this a coincidence or not?
Does current knowledge about the primes suffice to prove Gilbreath's conjecture that every row after the first in the iterated unsigned-difference table of consecutive primes begins with 1?
Let p be an odd prime, and let tildeJ_2k(n) denote the normalized higher Apéry-like number of index 2k. Higher Apéry-like sum conjecture. For any odd prime p and any integer k≥2, ∑_n=0^p-1tildeJ_2k(n)≡-1pmodp^2. This is one of the paper's…
Let n>1 be a positive integer such that a^n≡ a(mod n) for every integer a. The converse to Fermat's little theorem. Then n must be a prime number. This statement is the converse formulation of Fermat's little theorem; it is solved, having…
Let A⊂ N be an additive basis of order 2. Must there exist B=b_1<b_2<…⊆ A which is also a basis such that lim_k→ ∞b_k/k^2 does not exist?
Let (a,b) be an (a,b)-Fibonacci sequence, and suppose it falls under case (vi) of the finite-orders conjecture, namely the case where the range of ω_(a,b)(m) is conjectured to be infinite. Infinite-orders conjecture. For every natural…
Let 1<a_1<… be a sequence of real numbers such that lvert ∏_i a_i^k_i-∏_j a_j^ℓ_jrvert ≥ 1 for every distinct pair of non-negative finitely supported integer tuples k_i,ℓ_j≥ 0. Is it true that # a_i ≤ x ≤ π(x)?