olymmath

ISL 2011 N1

For any integer d>0d>0, let f(d)f(d) be the smallest positive integer that has exactly dd positive divisors (so for example we have f(1)=1,f(5)=16f(1)=1, f(5)=16, and f(6)=12f(6)=12 ). Prove that for every integer k≥0k \geq 0 the number f(2k)f\left(2^{k}\right) divides f(2k+1)f\left(2^{k+1}\right).

Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.

Official text: IMO 2011 Shortlist booklet, page 11.

Solutions

Official solution Solution 1 by the IMO Problem Selection Committee

The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).

Similar problems

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

Locator isl/2011/n1 · Tag B3PWQGDTFD · Edit this page on GitHub · Keys: j next, k previous