olymmath

Putnam 1999 B6

  • Session B

Let SS be a finite set of integers, each greater than 1. Suppose that for each integer nn there is some s∈Ss\in S such that gcd⁡(s,n)=1\gcd(s,n)=1 or gcd⁡(s,n)=s\gcd(s,n)=s. Show that there exist s,t∈Ss,t\in S such that gcd⁡(s,t)\gcd(s,t) 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.

Locator putnam/1999/b6 · Tag Q49XBT9P9M · Edit this page on GitHub · Keys: j next, k previous