Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
8 problems
Let A ⊂ N be infinite with no distinct a, b, c ∈ A such that a | (b + c) with b, c > a. Can |A ∩ [1, N]|/√N have positive lower limit? Must every such A fall below N^1-c infinitely often?
Huang, Jiang and Oblomkov conjectured that the Eulerian q-series counting commuting pairs of nilpotent matrices with X^a = Y^b equals an explicit theta-and-eta product, making the point count essentially modular. The conjecture is layered…
Ballantine, Beck, Feigon and Maurischat introduced the subsum polynomial sp(λ,x) := ∏_i (1+x^λ_i) attached to an integer partition λ, studied rational functions built by summing reciprocals of these polynomials over natural classes of…
The Riemann hypothesis asserts that every nontrivial zero of the zeta function lies on the critical line. Short of proving it, the standard measure of progress is the proportion of zeros known unconditionally to lie there: Selberg…
How long must an interval be to contain distinct representatives x_i, with a_i | x_i, for every n-element set of moduli A = a_1, …, a_n?
Let h(n) count powerful integers in [n^2, (n+1)^2). What is the extremal order of h(n)?
Estimate the least excess g_k(N) forcing k integers whose pairwise sums all lie in a dense subset of 1, …, 2N; in particular, determine the positive variant h_4(n).
For irreducible covering sets of size k, determine their count, the possible largest modulus, the maximal reciprocal sum, and whether divisor-set examples occur infinitely often.