Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let N_0 denote the set of nonnegative integers. Consider the two forms a(2a-1)+b(2b-1)+c(2c+1) and a(2a-1)+b(2b+1)+c(2c+1), where a,b,c∈N_0. Three-form representation conjecture. Every natural number other than 8 and 68 can be written in…
Let f be a newform (corresponding to elliptic curve?) and let χ be a quadratic character. Does there exist a quadratic character ψ such that L(f ⊗ ψ, 1/2) L(f ⊗ χ ψ, 1/2) ≠ 0?
Let k≥ 3 be an integer. Conjecture. There exists a primitive weird number having at least k distinct prime factors. This would show that primitive weird numbers occur with arbitrarily many distinct prime factors; the source motivates the…
Let n_1<n_2<… be a lacunary sequence of integers and f∈ L^2([0,1]). Estimate the growth of, for almost all α, ∑_1≤ k≤ Nf( α n_k). For example, is it true that, for almost all α, ∑_1≤ k≤ Nf( α n_k)=o(N√loglog N)?
Let F(n) = max_substackm<n m composite m+p(m), where p(m) is the least prime divisor of m. Is it true that F(n)>n for all sufficiently large n? Does F(n)-n→ ∞ as n→∞?
Let φ(z)=α_q z^q+α_q-1z^q-1+…+α_0 be a polynomial of degree q, and let P_N( · ;φ) denote the gap distribution of φ(j)_j=1^N modulo 1, with gaps normalized by N. Rudnick–Sarnak conjecture. Let q≥ 2. There is a set Q⊂R of full Lebesgue…
Let I=[0,b] with b≤ 1, and let t_M(I) denote the monic integer transfinite diameter. Define n=max(2,⌈1/b⌉), which is the smallest integer n≥ 2 such that 1/n≤ b. Zero-endpoint interval conjecture. One has t_M(I)=1/n. This is presented as an…
For α∈barBbbQ, investigate maxhatλ_ν,f(σα)| σ∈rmGal(barBbbQ/BbbQ) (hatλ_ν,f the local height associated with a map f and a valuation ν).
Let N^+ denote the positive integers, and for integers i≥ 0 and n≥ 1 define a_i(n)=∑_k=0^⌊(n-i)/3⌋(-1)^n-kbinom3k+ikbinom2k+ikbinomn3k+ibinomn+kk3^n-3k-i. Let p be a prime satisfying p>2i. The higher Almkvist-Zudilin supercongruence. For…
Let C>1. Does the set of integers of the form p+⌊ C^k⌋, for some prime p and k≥ 0, have density >0?
Prove the following for all large x: there is a choice of congruence classes a_p for all primes p≤ x and a decomposition p≤ x=Asqcup B into two non-empty sets such that, for all n<x, there exist some p∈ A and q∈ B such that n≡ a_ppmodp and…
For a positive integer n, let D(n) denote its set of divisors and let τ(n)=|D(n)|. Say that n is strongly matchable if every coprime arithmetic progression of τ(n) integers admits a coprime matching to D(n). Say that n is an M-number if it…
What is the size of the largest A⊆ 1,…,N such that there is a function δ:A→ -1,1 such that ∑_n∈ Aδ_n/n=0 and ∑_n∈ A'δ_n/n≠ 0 for all non-empty A'⊊ A?
Let G_α=⟨ 1 1 0 1 , 1 0 alpha 1 ⟩<SL_2(C), and call a parameter non-free when these generators do not freely generate the group. Dense rational non-freeness conjecture. There exists a dense subset S⊂Q∩(-4,4) consisting of non-free numbers.…
If f(z)∈F_q(T), what happens then? What happens with other fields?
Let τ(n) denote the number of positive divisors of n. Is there an infinite set of natural numbers n such that τ(n)=τ(n+1)?
Let P=2,3,5,7,11,… denote the set of prime numbers, i.e. the integers p>1 whose only positive divisors are 1 and p. For every even integer n>2 there exist p,q∈P with n=p+q, where p and q are not required to be distinct (so that, for…
For coprime positive integers p,q with 1≤ p<q, let m_p/q denote the Markov number indexed by the rational number p/q∈[0,1]. Aigner's conjectures. The following ordering properties should hold: Fixed Numerator: If q<q' and gcd(p,q')=1, then…
Let S be the set of all m≥ 1 such that there exists a prime p ot≡ 1pmodm such that m!+1≡ 0pmodp. Does lim lvert S∩ [1,x]rvert/x exist? What is it? Similarly, if P is the set of all primes p such that there exists an m with p ot≡ 1pmodm…
Let f_k(n) denote the number of gleeful representations of the integer n with parameter k. The universal finiteness conjecture. For every integer k≥ 3, there are finitely many integers n with f_k(n)>1. The claim is presented as a stronger…