olymmath

Putnam 2013 A2

  • Session A

Let SS be the set of all positive integers that are not perfect squares. For n∈Sn \in S, consider choices of integers a1,a2,…,ara_1, a_2, \ldots, a_r such that n<a1<a2<⋯<arn < a_1 < a_2 < \cdots < a_r and n⋅a1⋅a2⋯arn \cdot a_1 \cdot a_2 \cdots a_r is a perfect square, and let f(n)f(n) be the minimum of ara_r over all such choices. Show that the function ff from SS to the integers is one-to-one.

Dataset text Putnam 1995 to 2025. Quoted with source.

Solutions

Human solution Solution 1 by 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/2013/a2 · Tag 1V5NQMJTNQ · Edit this page on GitHub · Keys: j next, k previous