89 problems
Goldbach-event independence conjecture. The events and satisfy
Generalized Andrews identity.
Let , and let the -th non--gonal pyramidal number be the -th positive integer that is not a -gonal pyramidal number. The preceding formula defines this sequenc…
The binary Goldbach conjecture asserts that every even integer greater than is the sum of two primes:…
with and , there exist primes such that .
For every integer , there exist an odd prime and positive integers such that .
Let . For an integer , a set , and , define . For integers…
For every integer and every real number with , does there exist a set such that: (i)…
Generalization of Goldbach's conjecture. Let be a subset of natural numbers whose distribution is similar to primes. There exists such that, for any even int…
Let denote the set of primes, and let be the set of even numbers that occur infinitely many times as differences of two consecutive primes. Polignac's c…
Let denote the set of primes. An even number is an element of . Kronecker's conjecture. Every even number can be expressed in infinitely many ways as the…
Let be a fixed base. For a positive integer, write for its digit reversal in base . Then and are primes, and…
Let denote the set of primes. An even number is an element of . Maillet's conjecture. Every even number is the difference of two primes. This is a foundat…
Let be an integer, let , let , and write for the two-dimensional torus. For and every…
Let and be two sets of positive integers. For a set of positive integers, write . Chen's Romanov-type conjecture. If there exists…
Krause–Zahlten conjecture. The equality
Density conjecture for sums of distinct powers. If every pair satisfies and
Chen's conjecture. If are positive integers with , then has positive l…
Let and . Let be positive integers, let be integers, let be a real constant, and let be an integer-valued linear polynomial…
Let , , and . For and , consider the distance to the nearest integer, denoted by . Uniform expone…
For a fixed base , let be the smallest number greater than such that every sufficiently large integer is a sum of at most r…
For a fixed base , define the Nnamlerinchs constant to be the smallest number greater than such that every sufficiently large integer can be writ…
Work in base , and write for the digit reversal of a prime . Base-10 ternary reversed-prime conjecture. Every sufficiently large odd integer can be…
Let be a fixed prime, and let denote the digit reversal of a prime in base . Two-reversed-prime conjecture. Every sufficiently large even integer …
Let denote a prime number, and for each integer define … where are consecutive primes. Infinite admissible lengths conjecture. For every prime number…