Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let K be a number field. For an abc sum a+b=c in K, let h_K and r_K denote its height and radical, and put h=h_K/[K:Q]. Effective abc conjecture. There exists a function ψ such that, for every abc sum in K, h_K≤ r_K+[K:Q]ψ(h). This…
In char p, H^*(G_n^1, E_n, */(p, u_1, …, u_n-2))[u_n-1^± 1] ≅ H^*(G_n-1, k[u^± 1]).
A weakly consecutive sequence (WCS) is a permutation σ of 1,…,k such that if an integer d divides σ(i), then d also divides σ(i± d) wherever these terms are defined. The paper specifies four starting sequences and three rules for…
Let a_n=∑_j=0^nn!/j!n^j for n∈N_+, and call an odd prime p a Schenker prime when p| a_n for some positive integer n with pnmid n. Let v_p denote the p-adic valuation. The Schenker prime valuation-tree conjecture. For every odd Schenker…
For every base b≥2, the number of prime factors of the λ-digit base-b palindromes, and of the base-b reversals of the λ-digit primes, obeys an Erdős–Kac law: counted with or without multiplicity, it is asymptotically normal with centring…
Let m be a positive integer, and let B[-k_1,k_2](m) be a perfect purely singular splitter set with splitter set S. Thus S is the set of multipliers defining the splitting of the cyclic group Z_m. Coprime splitter conjecture. Let k_1, k_2…
Are there infinitely many Fibonacci primes?
Let f ∈ Z[X] be a separable polynomial. For an order A, write Z_A(f) for the zero set of f in A, and let Π_f denote the problem of deciding, given an order A, whether Z_A(f) is non-empty. The complexity classes P and NPC denote…
Let a straight-line program for a polynomial in one variable be a list s_0=1, s_1=x, s_2,…,s_τ, where each s_i, for i≥ 2, is one of s_j+s_k, s_j-s_k, or s_js_k for some j,k<i. For f∈ Z[x], let τ(f) be the least length of a straight-line…
Let N be a primitive non-deficient number with N=p_1^a_1p_2^a_2… p_k^a_k, where p_1<p_2<…<p_k are distinct primes. Set R=R(N)=p_1p_2… p_k. Primitive non-deficient number component conjecture. There is an i, with 1≤ i≤ k, such that…
Let p be a prime and let ℓ satisfy 1≤ℓ<p. A diagonal ternary positive quadratic form is (p,ℓ)-universal if it represents every natural number congruent to ℓ modulo p. For a,b,c>0, write ⟨ a,b,c⟩ for the form ax^2+by^2+cz^2. Exhaustive…
Can a discrete logarithm on a elliptic curve be computed in sub-exponential time?
A well-known and probably very difficult conjecture on primes asserts that π(x + y) ≤ π(x) + π(y).
Given a smooth projective variety X over C of dimension greater than two and omega in H^0(X,L tensor S^r Omega^1_{X/C}), how can one check that a listed collection of omega-integral curves or hypersurfaces contains all such curves or…
Are there any Shanks chains of length 7 with p_i+1 = 4p_i^2 - 17?
Let S= s_1,…,s_n be an ordered set of distinct positive integers. Let T_[S] denote the mth-order, n-dimensional GCD tensor on S, and let Φ denote the arithmetic function appearing in its diagonal factorization. A set S is factor-closed if…
For positive integers r and s, let c_k^(r,s) be the uniquely determined rational numbers, independent of n, satisfying ∑_k=0^nnchoose k^rn+kchoose k^r=∑_k=0^nnchoose k^sn+kchoose k^s c_k^(r,s). Finite integrality conjecture. For any s>1…
Let S_(p-1)/2 be the symmetric group on 1,…,(p-1)/2, and let sign(τ) denote permutation sign. Signed quadratic quotient-product conjecture. Let p>3 be a prime with p≡3pmod4. Then ∑_τ∈ S_(p-1)/2sign(τ)∏_substackj=1 τ(j)≠…
Let a_n be a sequence of positive integers such that for every bounded sequence of integers b_n (with a_n+b_n eq 0 and b_n eq 0 for all n) the sum ∑ 1/a_n+b_n is irrational. Are a_n=2^n or a_n=n! examples of such a sequence?
Let m≥ 2 be an integer, and consider the digits in basis m of the fractional part of either Pi or the Euler constant. Denote by ( P) the large-deviation property defined earlier in the paper for such digit sequences. The property ( P)…