Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let ω(m) denote the number of distinct prime divisors of m, and define F(n)=sup_k∈ N(ω(n+k)loglog k/log k). Prove that F(n)longrightarrow∞ (n→∞).
Let p and q be distinct primes with p≡ q≡3pmod4, let α,β≥1, and define S_n:=1/n∑_k=1^n-1Rem(k^2÷ n). Set h^*(-p)=h(-p) for p≥7 and h^*(-3)=1/3. The same-congruence class-number conjecture. For n=p^α q^β,…
Can a Liouville system be isomorphic to (T^2, m_T^2, T), where T:T^2→ T^2 is given by ( x y ) ↦ ( x+y y ) mod 1?
For each positive integer k, let P_k be the set of natural numbers with exactly k prime factors counted with multiplicity, and let F denote the Erdős sum in the integers. Banks–Martin conjecture. The sequence of sums is strictly…
Let R_z(θ):=exp(-iθ Z/2) be a single-qubit Z rotation, and let ε be an approximation error. The rotation is exactly synthesizable when it can be represented exactly by the relevant elementary gate set; otherwise it is not exactly…
Let a Young graph be the graph associated with the (g,k)-reverse multiples, whose node labels have the form [r',r]. A node is nonzero diagonal-labelled when its label is [r,r] with r≠0. Complete Young graph conjecture. A Young graph is a…
Which subrings R_W\subset\mathbb Q have an HTP-complete polynomial, meaning one that uniformly encodes the solvability in R_W of every polynomial equation over \mathbb Q, and which have an effectively HTP-complete polynomial with a…
For every real α≥1, do there exist infinitely many distinct pairs of positive integers (n_k,m_k) such that σ(n_k)=σ(m_k) and n_k/m_k→α?
Can one realize base change functoriality from Tate cycles?
Let n=km>1 be a spoof odd perfect number. If gcd(m,k)=1, then √k is an integer and the sum-of-divisors function σ is evaluated at this factor. Square-root abundancy conjecture. The inequality σ(√k)<m holds. The claim is consistent with the…
Let D_k(x) be the Delannoy polynomial, defined by D_k(x)=∑_j=0^kkchoose jk+jchoose jx^j. For a prime p, let ν_p denote the p-adic valuation. Let n be a positive integer and let x be a p-adic integer. Guo's conjecture.…
Generalizing: Can you find an example in higher dimensions?
Let N=q^k n^2 be an odd perfect number in Eulerian form, where q is the special prime and gcd(q,n)=1. Consider the two greatest common divisors gcd(σ(q^k),σ(n^2)) and gcd(n^2,σ(n^2)). Unequal-GCD conjecture. Unconditionally, these two…
Let a,b,r∈Z with gcd(a,b)=1, and suppose that r≠ -1 and that r is not a perfect mth power for any m>1. An integer r is a primitive root modulo a prime q when its powers represent all nonzero residue classes modulo q. The strengthened Artin…
Every integer-valued strongly b-additive function g with gcd(g(1),…,g(b−1)) = 1 and nonnegative digit mean takes prime values at infinitely many primes, with a Mertens-type formula and normal-order results; the running example resolves the…
Do the coefficients of h_m have enumerative significance? Can we find h_m for m ≥ 9?
Let K be a number field, let O_K be its ring of integers, and let F⊆ O_K be self-similar with respect to polynomial maps φ_i:O_K→ O_K of degrees n_i and leading coefficients a_i. For a fixed embedding ρ:Khookrightarrow C, assume…
For a positive integer m, write its ternary expansion (m)_3 using digits from 0,1,2. Erdős's conjecture. There are only finitely many powers of 2 whose ternary expansion omits the digit 2. This conjecture is attributed to Erdős; known…
The uniqueness conjecture for Markov numbers that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation.
Let k be a number field, let S_∞ be the set of its archimedean places with |S_∞|≥ 2, and let Λ_S_∞(k) be the logarithmic embedding, of rank r=rankΛ_S_∞(k). For vectors in this space, write |α_1∧…∧α_q|_1 for the 1-norm of their exterior…