MathLabs

Problem 1

Let Z+\mathbb{Z}^+ be the set of positive integers. Determine all functions f:Z+→Z+f:\mathbb{Z}^+\to\mathbb{Z}^+ such that a2+f(a)f(b)a^2+f(a)f(b) is divisible by f(a)+bf(a)+b for all positive integers aa and bb.
Step 6 of 6: Infinitely many divisors force the value
b(f(b)−b)=0 ⟹ f(b)=b for every b∈Z+b\big(f(b)-b\big)=0\ \Longrightarrow\ f(b)=b\ \text{for every}\ b\in\mathbb Z^+
Detailed analysis

For fixed bb, step 5 shows p+bp+b divides the fixed integer b(f(b)−b)b(f(b)-b) for every odd prime pp. Since p+bp+b can be made arbitrarily large while b(f(b)−b)b(f(b)-b) does not depend on pp, and a nonzero integer has only finitely many divisors, this forces b(f(b)−b)=0b(f(b)-b)=0. As b>0b>0, f(b)=bf(b)=b. This holds for every positive integer bb, so f(n)=nf(n)=n for all nn, and this function clearly satisfies the original condition since f(a)+b=a+bf(a)+b=a+b divides a2+ab=a(a+b)a^2+ab=a(a+b).