Let a, k be positive integers and let n be a nonnegative integer. Show that (ka2+1)2n+1 can be expressed as a sum of k+1 squares and (ka2+1)2n+2 can be expressed as a sum of (k+1)2 squares.
Solution
First, we have (ka2+1)2n+1=(ka2+1)(ka2+1)2n=k(a2+a2+⋯+a2+12)(ka2+1)2n=k(a(ka2+1)n)2+(a(ka2+1)n)2+⋯+(a(ka2+1)n)2+k((ka2+1)n)2 which is the sum of k+1 squares.
Likewise, (ka2+1)2n+2=(ka2+1)2(ka2+1)2n=(k2a4+2ka2+1)(ka2+1)2n=k2(a2(ka2+1)n)2+(a2(ka2+1)n)2+⋯+(a2(ka2+1)n)2+2k(a(ka2+1)n)2+(a(ka2+1)n)2+⋯+(a(ka2+1)n)2+k((ka2+1)n)2 is the sum of (k+1)2 squares, and we are done.
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.