olymmath

Putnam 2025 B6

  • Session B

Let N={1,2,3,… }\mathbb{N} = \{1,2,3,\dots\}. Find the largest real constant rr such that there exists a function g ⁣:N→Ng\colon \mathbb{N} \to \mathbb{N} such that g(n+1)−g(n)≥(g(g(n)))rg(n+1)-g(n) \geq (g(g(n)))^r for all n∈Nn \in \mathbb{N}.

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/2025/b6 · Tag HT82YKRNMJ · Edit this page on GitHub · Keys: j next, k previous