Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Determine the concentration of the divisors of a typical integer n, specifically the typical size of the Erdős--Hooley function \Delta(n)=\max_i#{d\mid n:e^i\le d\le e^{i+1}}.
Let p be prime. For conditions on g and h, let T_g condition,h condition(p) denote the number of corresponding two-cycle solutions modulo p, where PR means primitive root, ANY means unrestricted, and • denotes any one of the four…
Can we construct local pseudorandom number generators from algebraic methods?
Let p be a prime and let h(p) denote the number of distinct residues of 1!,2!,…,(p-1)! modulo p. Stauduhar's conjecture. lim_p→∞h(p)/p=1-1/e. This conjecture predicts that the factorial sequence misses about p/e residue classes modulo p.…
Let R(q) denote the Rogers–Ramanujan continued fraction. Define a = 1/4(8472+4875√3-3770√5-2175√15). Conjectured evaluation. The evaluation R^5(e^-π√16/15)=√a^2+1-a holds. This is an experimentally discovered closed form; the surrounding…
For a prime p>2, write q_2(p)=(2^p-1-1)/2. Arithmetic progression nonvanishing conjecture. For every pair of positive integers m>a>0 with gcd(m,a)=1, there are infinitely many primes p≡ apmod m such that q_2(p)not≡0pmod p. This asserts…
Let (X_n)_n≥ 1 be a sequence of random variables and let (a_n)_n≥ 1 be nonnegative numbers, with A_n:=∑_k=1^n a_k→∞. Assume that there is a constant C<∞ such that, for every 1≤ m≤ n, E|∑_k=m^n X_k|^2≤ C∑_k=m^n a_k. Determine exactly which…
Given real numbers 1<a_1<a_2<\cdots whose successive ratios a_{n+1}/a_n are increasing, what can be said about the number of solutions of a_{i_1}+\cdots+a_{i_k}=a_{j_1}+\cdots+a_{j_k}?
Let c_n,k denote the outlying constant, equivalently the greatest common divisor of the coefficients of DD_n,k, and let ν_p be the p-adic valuation. The conjecture concerns its prime divisors and valuations. Double-discriminant constant…
Let f(N) be the maximum size of a Sidon subset of [N]=1,…,N, and let A(N) be the number of Sidon subsets of [N]. Does A(N)/2^f(N)→∞? Is A(N)=2^(1+o(1))f(N)?
Let n≥ 2 be an integer and let q≥ 2 be a prime power. Define the projective degree m=q^n-1/q-1=1+q+q^2+…+q^n-1. A projective prime is a prime value of m. The projective-prime infinitude conjecture. There are infinitely many projective…
What is the largest size of A⊆1,…,N such that lcm(a,b)≤ N for every a,b∈ A? Is the maximum attained by all integers up to √N/2 together with the even integers between √N/2 and √2N?
Let r(n) count divisor pairs d_1<d_2<2d_1 of n. Is it true that for every ε>0, r(n)<ετ(n) for almost every n?
Let a,b,c,d be a Diophantine quadruple of integers, meaning that the product of any two distinct elements increased by 1 is a square of an integer, and suppose that d>maxa,b,c. Define d_+=a+b+c+2(abc+√(ab+1)(ac+1)(bc+1)). Unique extension…
Let d_2(n) denote the number of binary lunar divisors of n, and let 111… 10|_2 denote the binary number with k-1 initial 1's followed by 0. Le Brun et al.'s conjecture. Among all k-digit numbers in base 2, the maximal value of d_2(n)…
Let G_n^(ℓ)(k) denote the generalized Gregory coefficients associated with a multiple polylogarithm of index k and positive integer order ℓ, as defined by the Laurent expansion of the reciprocal of the corresponding ℓ-th power. The…
For fundamental discriminants d and quadratic characters \chi_d, the long-polynomial recipe conjectures the stated smoothed average of \sum_{n\le X}\tau_A(n)\chi_d(n)/\sqrt n is given by the corresponding integral of the quadratic…
For a motive (or the cohomology of a smooth projective variety) and an appropriate integer argument, is the order of vanishing of its L-function the predicted motivic-cohomology rank, and is its first nonzero Taylor coefficient, up to the…
Let B_n be the natural Beurling approximation defined by B_n(x)=∑_k=1^nμ(k) ρ(1/k/x)-n(∑_k=1^nμ(k)/k)ρ(1/n/x), and let widetildeB_n be the approximating function obtained from the paper's iterative sequence k_n_n∈ N. Auil's equality…
For positive integers n and r, define S_n^(r)=∑_k=0^nnchoose k^22kchoose k(2k+1)^r. Multiplier conjecture. There exist integers a_2r-1 and b_r, independent of n, such that a_2r-1∑_k=0^n-1S_k^(2r-1)≡0pmodn^2, and…