Erdős problem 429
Is it true that, if is sparse enough and does not cover all residue classes modulo for any prime , then there exists some such that is prime for all ?
Workspace
public preview
- #429
- None
- 0
Reported activity
Work these sources record against this Problem. Source-reported attribution, not reviewed here.
Formalization
- Machine