olymmath

OFM 2021 J4

  • Junior

Let N⩾1\mathbb{N}_{\geqslant 1} be the set of positive integers. Find all functions f ⁣:N⩾1→N⩾1f \colon \mathbb{N}_{\geqslant 1} \to \mathbb{N}_{\geqslant 1} such that, for all positive integers mm and nn : GCD(f(m),n)+LCM(m,f(n))=GCD(m,f(n))+LCM(f(m),n).\mathrm{GCD}\left(f(m),n\right) + \mathrm{LCM}\left(m,f(n)\right) = \mathrm{GCD}\left(m,f(n)\right) + \mathrm{LCM}\left(f(m),n\right).

Note: if aa and bb are positive integers, GCD(a,b)\mathrm{GCD}(a,b) is the largest positive integer that divides both aa and bb , and LCM(a,b)\mathrm{LCM}(a,b) is the smallest positive integer that is a multiple of both aa and bb .

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 francophone/2021/j4 · Tag 2C94P53X05 · Edit this page on GitHub · Keys: j next, k previous