Problems
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
618 of 1,221 problems match
Every problem posed by Paul Erdős, with its status, references, discussion and proof claims.
Asks whether for every some with admits no covering system whose moduli are distinct divisors of above .
Asks whether, for moduli with for some and all , the number of missed by the first congruences is not .
Asks whether moduli whose congruences always leave an uncovered set of density must have, for each , an initial segment that always leaves density below .
Asks whether, for every integer polynomial with positive leading coefficient and no dividing every , every large equals for some integers with .
Asks whether , the largest possible smallest denominator among distinct unit fractions summing to , satisfies .
Asks whether , the least possible largest denominator among distinct unit fractions summing to , satisfies .
Asks whether distinct unit fractions summing to can always be chosen with all denominators in an interval of width .
Asks whether, for each , some makes the reduced denominator of drop when is added, and how such grows with .
Asks whether the integers that occur as the largest denominator in some representation of by distinct unit fractions have density .
Asks for estimates of , the least such that is not a sum of distinct unit fractions with smallest denominator and all denominators at most .
Asks for estimates of , the largest number of disjoint subsets of whose reciprocals each sum to , and whether .
Asks whether every set of positive integers of positive density contains a finite subset whose reciprocals sum to .
Asks whether some infinite increasing sequence of integers with bounded gaps has no finite subset whose reciprocals sum to .
Asks for estimates of , the size of the largest subset of with no subset whose reciprocals sum to .
Asks whether every finite coloring of the integers has distinct of the same color with .
Asks to estimate , the fewest distinct unit fractions needed to write any fraction with denominator , and whether . Answered yes by Theorem 1.1 of the OpenAI release (2026), accepted on Lean evidence.
Asks to estimate , the smallest possible largest denominator needed to write any fraction with denominator as a sum of distinct unit fractions, and whether .
Asks for the least integer that is not a sum of distinct unit fractions with denominators at most , and whether the representable integers form an initial segment. A corrected version asks for large whether that integer is or one more.
Asks how many integers are sums of distinct unit fractions with denominators at most , and whether there are only of them.
Asks whether every with has a subset whose reciprocals sum to some with .
Asks how small the excess over can be when is summed until it reaches , and whether .
Asks whether every increasing sequence with , other than Sylvester's, has .
Asks whether every finite set of integers above with reciprocal sum less than can be split into two parts, each with reciprocal sum below .
Asks whether every non-constant on an infinite arithmetic progression has a finite non-empty with .