Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For any given integer a > 0, are there infinitely many primes p such that a^{p − 1} ≡ 1 (mod p^{2})?
Are there infinitely many n such that if n(n+1) = ∏_i p_i^k_i is the factorisation into distinct primes then all exponents k_i are distinct?
Let a_r,ℓ be the coefficients in the dyadic expansions of -3^-ℓ, let [x_1,…,x_k] be a Syracuse path with geometric measure G_1-μ^-1, and write x_[ℓ,k]=∑_i=ℓ^k x_i. Dyadic-coefficient zero-one sparsity conjecture. For μ>1, a suitable…
Can one formulate a weighted version of moments with potentially simpler main terms?
Let F(k) be the number of solutions to 1= 1/n_1+…+1/n_k, where 1≤ n_1<…<n_k are distinct integers. Find good estimates for F(k).
Let q>1 be an integer, let F=p_1,…,p_k be a finite set of primes that does not contain all the primes dividing q, and let a be a positive integer. Say that an integer is ε-equidistributed in base q when the proportion of each digit in its…
For an integer k≥ 2 and a positive integer n, let d_k(n)=#(n_1,… ,n_k)∈ Z_≥ 1^k : n_1n_2… n_k=n, so that d_2(n)=d(n)=σ_0(n) is the number of divisors of n, and for real x≥ 1 put D_k(x)=∑ _n≤ xd_k(n). For Re(s)>1 one has ∑ _n≥…
Let A be a set of n integers. How many distinct d can occur as the common difference of a three-term arithmetic progression in A? Are there always O(n^3/2) many such d?
If the positive squares are coloured with two colours, is every sufficiently large positive integer a sum of distinct squares of one colour?
Let b be the base and X the HWM-convergent index. Let NCD(b,X) be the number of correct digits and set number of zeroes=X, exponent=NCD(b,X)+X+2. HWM convergent error formula conjecture. The error of the HWM convergent is error= 1.0×…
Let p,q≥ 1 be fixed integers. We define H(n)=H(N;p,q) to be the largest m such that any graph on n vertices where every set of p vertices spans at least q edges must contain a complete graph on m vertices. Is c(p,q)=liminf log H(n)/log n a…
Let A⊂N be the set of cubes. Is it true that 1_A* 1_A(n) ≪ (log n)^O(1)?
Understand the relation with PCFness. Note this is related to Problem 1.1. Perhaps start with f(z)=z^2-1.
Given some specific geometric construction showing that d∈δ(X/k), can one use it to construct a dominant rational map Xdashrightarrow P^2 of degree nd, for some small n?
Let d_n=p_n+1-p_n, where p_n is the nth prime. Let r(x) be the smallest even integer t such that d_n=t has no solutions for n≤ x. Is it true that r(x)→ ∞? Or even r(x)/log x → ∞?
Let a∈ S^d-2( Z/q Z)⊂ S^d( Z/q Z), let p≤log(q) be prime, and let d≥3. Let w_p( a) be the diophantine exponent and let η( a) be the parameter introduced in the paper. The optimal upper-bound conjecture. w_p( a)leqd-1/d(1+η(…
Let f(k) be the minimal N such that if 1,…,N is k-coloured then there is a monochromatic solution to a+b=c. Estimate f(k). In particular, is it true that f(k) < c^k for some constant c>0?
Is it true that ∑_n=1^∞(-1)^nn/p_n converges, where p_n is the sequence of primes?
Fix γ ∈ Mod(Σ_g) can we understand the set of fixed points M(Σ_g, 2)(overlineZ)^γ of its action on the rank 2 character variety?
Let n and r be positive integers with gcd(n,r)=1, and consider the congruence (X-1)^n≡ X^n-1 pmodn, X^r-1, meaning that the two polynomials (X-1)^n and X^n-1 have the same image in the ring (Z/nZ)[X]/(X^r-1), i.e. every coefficient of…