Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let P(x) be a polynomial, and let bard denote upper density. For a positive integer T, consider the set of integers n for which p-1 divides P(n) for some prime p>T. Polynomial Erdős–Wagstaff conjecture. For all ε>0 and all polynomials…
Let P(n,k) be the largest prime factor of binom nk. Does there exist a real constant c>0 such that for every n,k∈ N with 0<k<n, P(n,k)>minn-k+1, k^1+c?
Let q=p^e be a prime power, let A=F_q[θ], and let f be a non-zero Drinfeld quasi-modular form of weight w and depth l≥ 1. Write ν_∞(f) for its vanishing order at infinity. Multiplicity estimate conjecture. There exists a real number c(q)>0…
For positive integers k and m, define S_k(m):=∑_j=1^m-1j^k, and T_k(m):=∑_j=1^m(2j-1)^k. Equality conjecture for power-sum ratios. .S_k(m+1)/S_k(m) | k,m∈ Z^+, m>3∩ Z=.T_k(m+1)/T_k(m) | k,m∈ Z^+, m>1∩ Z. The assertion proposes that the…
Let a=(a_1,dotsc,a_r) and b=(b_1,dotsc,b_s) be tuples of positive integers satisfying ∑_i=1^r⌊ a_i x⌋-∑_j=1^s⌊ b_j x⌋geqslant 0 for all xgeqslant 0. For a positive integer n, write [n]!=[1][2]dotsm[n], where [m]=(1-q^m)/(1-q). q-rious…
For a positive integer n=∏_i=1^k p_i^a_i, define f(n)=∑_i=1^k a_i p_i. A Ruth–Aaron number is an integer n satisfying f(n)=f(n+1). Erdős's infinitude conjecture. There are infinitely many integers n such that f(n)=f(n+1). This is the named…
Let k≥ 2. Does there exist a prime p and consecutive intervals I_1,…,I_k such that ∏_n∈ I_in ≡ 1pmodp for all 1≤ i≤ k?
For an increasing infinite sequence A=a_1<a_2<…, let A(X) count indices i with lcm(a_i,a_i+1)≤ X. Is A(X)=O(√ X)? How large can liminf A(X)/√ X be?
For coprime integers 1≤ a<d, is the least prime p(a,d) congruent to apmod d always less than d^2?
Let σ denote the sum-of-divisors function. A positive integer n is a super-hyperperfect number in the special form considered here when σ(σ(n))=3/2n+1/2. Conjecture on the form of all solutions. All solutions for this generalization are…
Let A(n)=a_0<a_1<… be the sequence defined by a_0=0 and a_1=n, and for k≥ 1 define a_k+1 as the least positive integer such that there is no three-term arithmetic progression in a_0,…,a_k+1. Can the a_k be explicitly determined? How fast…
Are there infinitely many Woodall primes?
A positive binary square is the square of a positive integer whose binary expansion is used in the representation. The claim concerns representations of natural numbers as sums of exactly four such squares. Four positive binary squares…
Let G^H(n) be the Hasse diagram associated with the divisors of n, let V_l(n) denote its vertices at level l, and let W_v(n) denote the node width. Node width at middle level. The node width should equal the number of vertices at the…
If SP(n) counts positive-integer solutions of abc+a+b+c=n, is it true that for every \varepsilon>0 there is C(\varepsilon) such that SP(n)<C(\varepsilon)n^{\varepsilon}?
Find the two prime factors of the RSA-1024 challenge integer 1350664108659952233496032162788059699388814756056670275244851438515265106048595338339402871505719094417982072821644715513736804197039641917430464965892742562393410208643832021103…
We propose to replace the eight Weierstraß points in the hyperelliptic case by a Cayley octad. We conjecture that combinatorial data about the configuration of these eight points fully determines the stable reduction type of the curve,…
Can we classify the finite orbts under the mapping class group in M(Σ_0,n, SL_3), in particular the case n = 4?
Let φ(n) be the Euler totient function and φ_k(n) be the iterated φ function, so that φ_1(n)=φ(n) and φ_k(n)=φ(φ_k-1(n)). Let f(n) = min k : φ_k(n)=1. Does f(n)/log n have a distribution function? Is f(n)/log n almost always constant? What…
Let p be a prime number. The relevant factorial sum is ∑_j=1^p-1j!. Derangement factorial-sum conjecture. For every prime number p>11, pnmid∑_j=1^p-1j!. The claim is motivated by the preceding observation relating divisibility of the…