Maths Olympiad Prep

Library / Ukrainian National Mathematical Olympiad /64 of 201

Ukrainian National Mathematical Olympiad

Number theory Difficulty 5.5 AIME, harder Prove it Ukraine

Find all natural numbers aa, bb and cc, such that the number 2a!+2b!+2c!2^{a!} + 2^{b!} + 2^{c!} is a cube of a natural number.
(Arseniy Nicolaev)

Solution

It is clear that if n≥3n \ge 3, n!∤3n! \nmid 3, that is n!≠3kn! \ne 3k, for some natural number kk. But then 2n!=23k=8k≡1(mod7)2^{n!} = 2^{3k} = 8^k \equiv 1 \pmod{7}. Analogously modulo 9: if n≥3n \ge 3 we have that n!∤6n! \nmid 6, that is n!≠6ln! \ne 6l, for some natural ll. But then 2n!=26l=64l≡1(mod9)2^{n!} = 2^{6l} = 64^l \equiv 1 \pmod{9}.

It's easy to see, that the cubes of integer numbers are equal 00 or ±1\pm 1 modulo 77 and modulo 99. Without loss of generality, we may assume that a≥b≥ca \ge b \ge c.

Case 1. a≥3a \ge 3 and b≥3b \ge 3. If c≥3c \ge 3, then 2a!+2b!+2c!≡3(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 3 \pmod{7} – is not a cube of an integer.
If c=2c=2 then 2a!+2b!+2c!≡1+1+4≡−1(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+1+4 \equiv -1 \pmod{7} – can be a cube of an integer.
Check modulo 9. 2a!+2b!+2c!≡1+1+4≡6(mod9)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+1+4 \equiv 6 \pmod{9} – is not a cube of an integer.
If c=1c=1 then 2a!+2b!+2c!≡1+1+2≡4(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+1+2 \equiv 4 \pmod{7} – is not a cube of an integer.

Case 2. a≥3⇒b≤2a \ge 3 \Rightarrow b \le 2. Hence we have three cases.
If b=c=2b=c=2 2a!+2b!+2c!≡1+4+4≡2(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+4+4 \equiv 2 \pmod{7} – is not a cube of an integer.
If b=2,c=1b=2, c=1 2a!+2b!+2c!≡1+4+2≡0(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+4+2 \equiv 0 \pmod{7} – can be a cube of an integer.
Then analogously modulo 9 2a!+2b!+2c!≡1+4+2≡7(mod9)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+4+2 \equiv 7 \pmod{9} – is not a cube of an integer.
If b=c=1b=c=1 2a!+2b!+2c!≡1+2+2≡5(mod7)2^{a!} + 2^{b!} + 2^{c!} \equiv 1+2+2 \equiv 5 \pmod{7} – is not a cube of an integer.

---

Case 3. 2≥a≥b≥c2 \ge a \ge b \ge c, here we have 4 cases overall, from which we simply find a single answer in a simple overview.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.