Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let n≥ 3, and let 1,2,…,s_ι(n)-1,s_ι(n) be a shortest addition chain producing n of length ι(n). Write its associated generators as 2,s_3=a_3+r_3,…,s_ι(n)=a_ι(n)+r_ι(n),s_ι(n)+1=a_ι(n)+1+r_ι(n)+1=n. Scholz's conjecture reduction. The…
Let A_k be the set of positions of digit 1 in the binary expansion of 3^k, and let W=k∈N:A_k does not have a 3-term arithmetic progression. Logarithmic exceptional-set conjecture. Under these conditions, #(W∩[1,N])=O(log N). The paper has…
A conjecture of Gonek [3] predicts the size of the negative moments in different ranges. Negative moments of the Riemann zeta-function Alexandra Florea (joint work with Hung Bui)
- Erdős Problem #396 — Is it true that for every k there exists n such that ∏_0≤ i≤ k(n-i) | binom2nn?
Is it true that for every k there exists n such that ∏_0≤ i≤ k(n-i) | binom2nn?
Determine the joint equidistribution of CM points over K of products of modular curves over F as disc(K) → ∞.
Let m≥ 1, and let 1,α_0^(1),…,α_0^(m) be p-adic numbers that are linearly dependent over Q. The finite-or-periodic conjecture. The p-adic Jacobi–Perron algorithm on input (α_0^(1),…,α_0^(m)) is either finite or periodic. This conjecture…
#p∈N: p and p+2 are prime=∞.
Do Lychrel numbers exist in base 10?
Let Logx=maxlog x,1 and Log_2x=Log(Logx). Is it true that for every set A⊆N, if frac1Log_2x∑_substackn∈ A 1≤ n≤⌊ x⌋frac1nlongrightarrow∞ (x→∞), then frac1(∑_substackn∈ A 1≤ n≤⌊ x⌋frac1n)^2∑_substackn,m∈ A 1≤ n<m≤⌊…
Conjecture 1. [CLV22, Conjecture 1.1] All but finitely many BN triples (d, g, r) with g \geq 2 are stable. In fact, one may conjecture that except for the triples in Examples 1 and 2, every BN triple with g \geq 2 is stable (at least in…
What is the appropriate n-dimensional generalization of the Apollonian packing?
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(k) be the minimal n such that every set of n consecutive integers >k contains an integer divisible by a prime >k. Estimate f(k).
Let p_1,p_2,p_3,p_4 be the four polynomials constructed in the paper, evaluated at x,y,z∈N^*. The relevant generated parameter is a natural number q≥1. Four-polynomial generation conjecture. The polynomials p_1,p_2,p_3,p_4, for x,y,z∈N^*,…
Let D range over fundamental positive discriminants without prime factors congruent to 3 modulo 4. Define ρ:=∏_j=1^∞ (1+2^-j)^-1=0.41942…. Stevenhagen's conjecture. The density of those D for which the negative Pell equation x^2-Dy^2=-4…
Let m be a positive integer and let θ∈R^m. For each best approximation (p_l,q_l)∈Z^m×N of θ, the only primitive vectors of the lattice Λ_θ= I_m θ 0 1 Z^m+1 inside the hyper-cuboid [-p_1-θ_1q, p_1+θ_1q]×…×[-p_m-θ_mq, p_m+θ_mq]×[-q, q] are…
McKay conjecture: for every finite group G, prime p, and P\in\operatorname{Syl}p(G), |\operatorname{Irr}{p'}(G)|=|\operatorname{Irr}_{p'}(N_G(P))|.
Let m∈Z^+, let a_1,…,a_m∈Z, let b_1,…,b_m,r∈N, let n∈Z^+, and let ε∈±1. Define the binomial coefficients in the usual generalized sense. Generalized binomial divisibility conjecture. Then…
Shifted convolution sum via various delta methods For a holomorphic or a Hecke--Maass cusp form f with the nth Fourier coefficient λ_f(n), obtain cancellations in the summation ∑_n≤ N λ_f(n)λ_f(n+1), via \begin{enumerate} \item…
Let ε>0. Is there some set A⊂ N of density >1-ε such that a_1… a_r=b_1… b_s with a_i,b_j∈ A can only hold when r=s? Similarly, can one always find a set A⊂1,…,N with this property of size ≥ (1-o(1))N?