olymmath

Putnam 1973 A3

  • Session A

Let nn be a fixed positive integer and let b(n)b(n) be the minimum value of k+nk,k+\frac{n}{k}, where kk is allowed to range through all positive integers. Prove that ⌊b(n)⌋=⌊4n+1⌋.\lfloor b(n) \rfloor= \lfloor \sqrt{4n+1} \rfloor.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1973/a3 · Tag PJBSN5MZPD · Edit this page on GitHub · Keys: j next, k previous