Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let c(P) denote the alternative measure of a polynomial, with the last variable used as the subscript, and let x_1,3,x_k be variables. Numerically, for k≤ 6, the alternative measure is computed from…
Let Q(x) count the number of squarefree integers in [1,x]. Determine the order of magnitude in the error term in the asymptotic Q(x)=6/π^2x+E(x).
Let f_2(k) be the smallest positive integer n such that every 2-coloring of 1,2,…,n has a monochromatic solution, with the variables not necessarily distinct, to 1/x_1+1/x_2+…+1/x_k=frac1x_k+1. Call k an odd prime power if k=p^m for some…
Suppose F is a real quadratic field and K_n=F(μ_n), where n is prime to the conductor of F/Q. Let θ'_n∈ K_n^×⊗Z[Gal(K_n/F)] be Darmon's Stickelberger-type element, and let R_n be the regulator defined from the chosen bases of the relevant…
How do all of these invariants (e.g. minδ(X/k),irr(X/k),cov.gon(X/k), etc.) behave under specialization/deformation in a smooth family? This includes the arithmetic case, where the base is something like Spec O_k,S.
Let N⊂N^+ be a finite GCD-closed set, meaning that gcd(m,n)∈N whenever m,n∈N, and suppose that N contains at least two elements. A prime power is a number of the form p^k for a prime p and a positive integer k. The dual GCD-closed sets…
Let φ denote Euler's totient function. For an integer s≥ 2, consider the equation φ(x)=m in positive integers x. Sierpiński's conjecture. For any integer s≥ 2, there exists an integer m such that the equation φ(x)=m has exactly s…
What is the smallest Skewes's number?
Can we get a reasonable omega result for \begin{equation*} \left| \sum_{n \leq X} f(n) \right|, \end{equation*} where f: N → ±1 is totally multiplicative? Anything better than log log log log log X would be interesting.
Let n=am+1, where a and m are positive integers, and let p be the least prime divisor of m. Primality conjecture. If a<p and m|φ(n), then n is prime. This conjecture would generalize the preceding primality criterion from numbers of the…
Does there exist B⊂N which is not an additive basis, but is such that for every set A⊆N of Schnirelmann density α and every N there exists b∈ B such that lvert (A∪ (A+b))∩ 1,…,Nrvert≥ (α+f(α))N where f(α)>0 for 0<α <1 ? The Schnirelmann…
Conjecture There exist infinitely many positive integers n so that both n and n+2 are prime.
Let d_1 and d_2 be the discriminants under consideration, with d_1 e d_2 and d_1 e 0, d_2 e 0. Assume d_1 equiv d_2 equiv 5pmod 8. For each t=m+√ D/2∈ O_F, let p_t be the unique prime ideal of F above 2 with 2∈ p_t. Then ∑_substackt=m+√…
The conjectural (\sigma,\rho)-Poisson summation formula is expected to imply the meromorphic continuation and functional equation of the automorphic L-function L(s,\sigma,\rho).
Let p be a prime, let q be a base that is not a power of p, and write the base-q expansion of p^n as having k_n=⌈ nlog_q p⌉ digits. Let d_j,n denote its j-th digit from left to right. Digit equidistribution conjecture for powers. For each…
Let A be a finite set and B= n ≥ 1 : a| n for some a∈ A. Is it true that, for every m>n≥ max(A), lvert B∩ [1,m]rvert /m< 2lvert B∩ [1,n]rvert/n?
Let N=pq, where p and q are the prime factors under consideration, and let Q-KW(N) denote the rational Korselt witness set associated with N. Oddness conjecture. For all N=pq, Q-KW(N) is odd. The paper presents this as an unsolved issue…
Let F/Q be a totally real abelian extension of order m, and suppose Gal(F/Q)≅bigoplus_i=1^nZ/m_iZ. For primes p≫ 0 satisfying pnmid m disc_F, write F-regular for the condition that p is χ-regular for every character of Gal(F/Q).…
Are there infinitely many cluster primes?
For each nonnegative integer ω, let A_n be the height of the cyclotomic polynomial Φ_n, let ω(n) denote the number of distinct prime factors of n, and define M_n=∏_i=1^ω-2p_i^2^ω-1-i-1 when n=p_1p_2… p_ω with 2<p_1<…<p_ω prime. Define the…