olymmath

ISL 2015 N8

For every positive integer nn with prime factorization n=∏i=1kpiαin=\prod_{i=1}^{k} p_{i}^{\alpha_{i}}, define ℧(n)=∑i:pi>10100αi.\mho(n)=\sum_{i: p_{i}>10^{100}} \alpha_{i} . That is, ℧(n)\mho(n) is the number of prime factors of nn greater than 1010010^{100}, counted with multiplicity. Find all strictly increasing functions f:Z→Zf: \mathbb{Z} \rightarrow \mathbb{Z} such that ℧(f(a)−f(b))⩽℧(a−b) for all integers a and b with a>b.\mho(f(a)-f(b)) \leqslant \mho(a-b) \text { for all integers } a \text { and } b \text { with } a>b .

Dataset text NuminaMath olympiads. Quoted with source.

Official text: IMO 2015 Shortlist booklet, page 8.

Show the answer

f(x)=a x+b

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/2015/n8 · Tag JNA1GP5G6M · Edit this page on GitHub · Keys: j next, k previous