Putnam 1999 B6
- Session B
Let be a finite set of integers, each greater than 1. Suppose that for each integer there is some such that or . Show that there exist such that is prime.
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng
The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).
Similar problems
These problems have the most words in common with this statement.