Maths Olympiad Prep

Library / /427 of 520

Number theory Difficulty 7.1 National olympiad, round 2 Prove it

For a positive integer nn, we define DnD_{n} as the largest number that divides an+(a+1)n+(a+2)na^{n}+(a+1)^{n}+(a+2)^{n} for all positive integers aa.
a) Prove that for every positive integer nn, the number DnD_{n} is of the form 3k3^{k} with k0k \geq 0.
b) Prove that for every k0k \geq 0, there exists a positive integer nn such that Dn=3kD_{n}=3^{k}.

Solution

a) Let pp be a prime and suppose that pp is a divisor of DnD_{n}. Then pp is a divisor of

((a+1)n+(a+2)n+(a+3)n)(an+(a+1)n+(a+2)n)=(a+3)nan \left((a+1)^{n}+(a+2)^{n}+(a+3)^{n}\right)-\left(a^{n}+(a+1)^{n}+(a+2)^{n}\right)=(a+3)^{n}-a^{n}

for all positive integers aa. Choose now a=pa=p, then p(p+3)npnp \mid(p+3)^{n}-p^{n}, or (p+3)npn0modp(p+3)^{n}-p^{n} \equiv 0 \bmod p. This is simply 30modp3 \equiv 0 \bmod p, so p=3p=3. We conclude that DnD_{n} only contains prime factors 3 and thus is of the form 3k3^{k} with k0k \geq 0.
b) For k=0k=0 we take n=2n=2. It holds that 12+22+32=141^{2}+2^{2}+3^{2}=14 and 22+32+42=292^{2}+3^{2}+4^{2}=29 and these two have no prime factors in common, so D2=1D_{2}=1. Now assume that k1k \geq 1. We will prove that Dn=3kD_{n}=3^{k} for n=3k1n=3^{k-1}.
First, we show that 1n+2n+3n1^{n}+2^{n}+3^{n} for n=3k1n=3^{k-1} is divisible by 3k3^{k}, but not by 3k+13^{k+1}. For k=1k=1 it is n=1n=1 and indeed 1+2+3=61+2+3=6 is divisible by 3, but not by 323^{2}. For k2k \geq 2 it holds that n>kn>k and thus 3n3^{n} is divisible by 3k+13^{k+1}. What we need to prove is thus equivalent to: 1+2n1+2^{n} for n=3k1n=3^{k-1} is divisible by 3k3^{k} but not by 3k+13^{k+1}. We prove this by induction on kk. For k=2k=2 it is n=3n=3 and indeed 1+8=91+8=9 is divisible by 9, but not by 27. Let m2m \geq 2 and assume we have proven this for k=mk=m. Take n=3m1n=3^{m-1}. We know that 1+2n1+2^{n} is divisible by 3m3^{m}, but not by 3m+13^{m+1}. We want to show that 1+23n1+2^{3 n} is divisible by 3m+13^{m+1}, but not by 3m+23^{m+2}. Write 1+2n=3mc1+2^{n}=3^{m} c with 3c3 \nmid c. Then 2n=3mc12^{n}=3^{m} c-1, so

1+23n=1+(3mc1)3=33mc3332mc2+33mc 1+2^{3 n}=1+\left(3^{m} c-1\right)^{3}=3^{3 m} c^{3}-3 \cdot 3^{2 m} c^{2}+3 \cdot 3^{m} c

Modulo 3m+23^{m+2} this is congruent to 3m+1c3^{m+1} c and since 3c3 \nmid c it follows that this is divisible by 3m+13^{m+1}, but not by 3m+23^{m+2}, as we wanted to prove. This completes the induction. Now we show that for n=3k1n=3^{k-1} it holds that (a+3)nan(a+3)^{n}-a^{n} is divisible by 3k3^{k} for all positive integers aa. We prove this again by induction on kk. For k=1k=1 it is n=1n=1 and indeed (a+3)a=3(a+3)-a=3 is divisible by 3. Now let m1m \geq 1 and assume we have proven this for k=mk=m. Take n=3m1n=3^{m-1}. Then we know that (a+3)nan(a+3)^{n}-a^{n} is divisible by 3m3^{m}, so we can write (a+3)n=an+3mc(a+3)^{n}=a^{n}+3^{m} c for some integer cc. Taking the third power on both sides gives

(a+3)3n=a3n+3a2n3mc+3an32mc2+33mc3, (a+3)^{3 n}=a^{3 n}+3 a^{2 n} \cdot 3^{m} c+3 a^{n} \cdot 3^{2 m} c^{2}+3^{3 m} c^{3},

so

(a+3)3na3n=a2n3m+1c+an32m+1c2+33mc3. (a+3)^{3 n}-a^{3 n}=a^{2 n} \cdot 3^{m+1} c+a^{n} \cdot 3^{2 m+1} c^{2}+3^{3 m} c^{3} .

This is divisible by 3m+13^{m+1}, which completes the induction.
We have now proven for n=3k1n=3^{k-1} that 3k1n+2n+3n3^{k} \mid 1^{n}+2^{n}+3^{n} and 3k(a+3)nan3^{k} \mid(a+3)^{n}-a^{n} for all positive integers aa, from which it follows directly by induction on aa that 3kan+(a+1)n+(a+2)n3^{k} \mid a^{n}+(a+1)^{n}+(a+2)^{n} for all aa. Thus 3kDn3^{k} \mid D_{n}. Since 3k+11n+2n+3n3^{k+1} \nmid 1^{n}+2^{n}+3^{n} it also holds that 3k+1Dn3^{k+1} \nmid D_{n}. Therefore, Dn=3kD_{n}=3^{k}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.