45 problems
Let be distinct positive even integers such that the numbers in the sequence do not form a complete residue class modulo…
Let be a set of distinct linear forms , where the coefficients are positive integers. For a prime , let…
Dickson–Hardy–Littlewood conjecture. If is finite and admissible, then there exist infinitely many such that
Let be an admissible set of distinct natural numbers, meaning that the associated linear forms satisfy the usual local non-obstruction condition. Ch…
Let denote the set of primes, and let be its indicator function. For a tuple of distinct integers , let…
Let be a sublattice of , let be large, let be convex with volume , and let have size . Assume that all…
Let be an affine sublattice of . For each prime , let be the local factor defined from the image of in ; a local obstru…
Let be positive integers, let be a system of affine-linear forms with , and let be a convex body.…
Let be the von Mangoldt function, and for distinct integers with , let . Define …
Let be an integer. Suppose that has no fixed prime divisors as ranges over the integers, with and for . Strong H…
McCranie's conjecture. Every composite integer satisfying
Let be fixed, and let be fixed distinct integers coprime to . For each prime , let be the number of distinct residue classe…
Specific case of prime tuplets conjecture. The number of integers with for which every is prime satisfies
First Hardy–Littlewood conjecture. Unless forms a complete residue class with respect to some prime, is asymptotic to
Odd-moment conjecture. As tends to infinity,
Let . Let be a fixed admissible -tuple, and let be a fixed subset of small integers. Hardy–Littlewood–Chowla conjectu…
Prime-tuple hypothesis. If no congruence obstruction exists, then there are infinitely many values of such that every is prime.
A finite set of integers is admissible if, for every prime , its residue classes do not cover all residue classes modulo . Quantitative extension of…
For , define … where is the von Mangoldt function and is the singular series. The weakened prime-pair upper-bound conjecture. Given a fixed cons…
Cunningham chain conjecture. The number of Cunningham chains of length beginning with a prime is approximately
Skewes-number conjecture. Every admissible prime -tuple has a Skewes number. The conjecture is based on the computational results in the paper; no proof or disproof is supplied.
Wolf's conjecture. The number of sign changes of for is . This numerical prediction concerns fluctuations around the Hardy–Littlewood e…
Let be a monotonically increasing sequence of positive even integers. Let be prime, and let be an admissible prime -t…
Fix and . Let satisfy and for . Define the Hardy–Littlewood singular series … where is t…
Let be the set of integers expressible as a sum of two squares. For and a set with…