Let f:N→Z be the function that for any two positive integers a,bf(ab)=f(a)+f(b). Find all possible values of f(1000).
Solution
Let us look on such an equality: f(1000)=f(103)=3⋅f(10) Let us show now that for any integer kf(1000) can equal 3k. Let ord(a) be a maximum degree of 2, by what a is divisible. Let a=2i(2a0+1),b=2m(2b0+1). Thus ord(ab)=ord(2i+m(2a0+1)(2b0+1))=i+m=ord(a)+ord(b). Let f(a)=k⋅ord(a), then f(ab)=k⋅ord(ab)=k⋅(ord(a)+ord(b))=k⋅ord(a)+k⋅ord(b)=f(a)+f(b) ⇒f(1000)=k⋅ord(23⋅125)=3k, That is what we had to prove.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.