To solve the given problem, we need to find all functions f:Z>0→Z>0 such that for all positive integers a and b with a+b>2019, the expression a+f(b) divides a2+bf(a).
Let's first rewrite the divisibility condition:
a+f(b)∣a2+bf(a)
This means that there is an integer k such that:
a2+bf(a)=k(a+f(b))
which can be rearranged as:
a2+bf(a)=ka+kf(b)
Rearranging gives:
a2−ka=kf(b)−bf(a)
To solve this, consider b to be very large. If we choose a specific value for b such that b→∞, and given a+f(b)∣a2+bf(a), we see that bf(a) becomes dominant, implying:
k(a+f(b))≈bf(a)
for large b, thus:
k=a+f(b)bf(a)
We assume f(a)=ka, where k is some positive integer. This assumption satisfies the divisibility condition as shown by substituting into:
a+f(b)=a+kb
a2+bf(a)=a2+bka
The divisibility becomes:
a+kb∣a2+abk
Since a+kb divides the right side, and since our function f(a)=ka satisfies this condition, we verify the general case. For a+b>2019, reassessing the original condition a+f(b)∣a2+bf(a), it simplifies for any specific positive integer k.
Thus, this form f(a)=ka where k is a positive integer satisfies the given conditions. Hence all functions of the form:
f(a)=kafor any positive integer a and some positive integer k
Thus, the solution is:
f(a)=ka