Consider all functions f:Z→Z satisfying f(f(x)+2x+20)=15 Call an integer n good if f(n) can take any integer value. In other words, if we fix n, for any integer m, there exists a function f such that f(n)=m. Find the sum of all good integers x.
A number or a short expression. Spacing and $ signs are ignored.
Solution
For almost all integers x,f(x)=−x−20. If f(x)=−x−20, then f(−x−20+2x+20)=15⟹−x−20=15⟹x=−35 Now it suffices to prove that the f(−35) can take any value. f(−35)=15 in the function f(x)≡15. Otherwise, set f(−35)=c, and f(x)=15 for all other x. It is easy to check that these functions all work.
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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.