Olympiad Maths Prep

Track / Stage 6 / 380 of 400 #1380 of 2000

Problem 1380

National olympiad, first round
Number theory Difficulty 6.9 Prove it

Let pp, qq, and rr be distinct positive prime numbers. Show that if

pqr(pq)r+(qr)p+(rp)q1,pqr\mid (pq)^r+(qr)^p+(rp)^q-1,

then

(pqr)33((pq)r+(qr)p+(rp)q1).(pqr)^3\mid 3((pq)^r+(qr)^p+(rp)^q-1).

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

1. Given that p,q, p, q, and r r are distinct positive prime numbers, we need to show that if
pqr(pq)r+(qr)p+(rp)q1, pqr \mid (pq)^r + (qr)^p + (rp)^q - 1,
then
(pqr)33((pq)r+(qr)p+(rp)q1). (pqr)^3 \mid 3((pq)^r + (qr)^p + (rp)^q - 1).

2. First, let's analyze the given condition pqr(pq)r+(qr)p+(rp)q1 pqr \mid (pq)^r + (qr)^p + (rp)^q - 1 . This means that
(pq)r+(qr)p+(rp)q1(modpqr). (pq)^r + (qr)^p + (rp)^q \equiv 1 \pmod{pqr}.

3. We need to show that
(pqr)33((pq)r+(qr)p+(rp)q1). (pqr)^3 \mid 3((pq)^r + (qr)^p + (rp)^q - 1).

4. Let's consider the expression modulo p p , q q , and r r separately.

- Modulo p p :
(pq)r0(modp),(qr)p(qr)p(modp),(rp)q0(modp). (pq)^r \equiv 0 \pmod{p}, \quad (qr)^p \equiv (qr)^p \pmod{p}, \quad (rp)^q \equiv 0 \pmod{p}.
Therefore,
(pq)r+(qr)p+(rp)q(qr)p(modp). (pq)^r + (qr)^p + (rp)^q \equiv (qr)^p \pmod{p}.
Since p(pq)r+(qr)p+(rp)q1 p \mid (pq)^r + (qr)^p + (rp)^q - 1 , we have
(qr)p1(modp). (qr)^p \equiv 1 \pmod{p}.

- Modulo q q :
(pq)r(pq)r(modq),(qr)p0(modq),(rp)q0(modq). (pq)^r \equiv (pq)^r \pmod{q}, \quad (qr)^p \equiv 0 \pmod{q}, \quad (rp)^q \equiv 0 \pmod{q}.
Therefore,
(pq)r+(qr)p+(rp)q(pq)r(modq). (pq)^r + (qr)^p + (rp)^q \equiv (pq)^r \pmod{q}.
Since q(pq)r+(qr)p+(rp)q1 q \mid (pq)^r + (qr)^p + (rp)^q - 1 , we have
(pq)r1(modq). (pq)^r \equiv 1 \pmod{q}.

- Modulo r r :
(pq)r0(modr),(qr)p0(modr),(rp)q(rp)q(modr). (pq)^r \equiv 0 \pmod{r}, \quad (qr)^p \equiv 0 \pmod{r}, \quad (rp)^q \equiv (rp)^q \pmod{r}.
Therefore,
(pq)r+(qr)p+(rp)q(rp)q(modr). (pq)^r + (qr)^p + (rp)^q \equiv (rp)^q \pmod{r}.
Since r(pq)r+(qr)p+(rp)q1 r \mid (pq)^r + (qr)^p + (rp)^q - 1 , we have
(rp)q1(modr). (rp)^q \equiv 1 \pmod{r}.

5. Now, we need to show that
(pqr)33((pq)r+(qr)p+(rp)q1). (pqr)^3 \mid 3((pq)^r + (qr)^p + (rp)^q - 1).

6. Since pqr(pq)r+(qr)p+(rp)q1 pqr \mid (pq)^r + (qr)^p + (rp)^q - 1 , we can write
(pq)r+(qr)p+(rp)q1=kpqr (pq)^r + (qr)^p + (rp)^q - 1 = kpqr
for some integer k k .

7. Therefore,
3((pq)r+(qr)p+(rp)q1)=3kpqr. 3((pq)^r + (qr)^p + (rp)^q - 1) = 3kpqr.

8. We need to show that (pqr)33kpqr (pqr)^3 \mid 3kpqr . Since p,q, p, q, and r r are distinct primes, pqr pqr is a product of distinct primes, and thus (pqr)33kpqr (pqr)^3 \mid 3kpqr if and only if pqr3k pqr \mid 3k .

9. Since p,q, p, q, and r r are distinct primes, pqr pqr does not divide 3. Therefore, k k must be a multiple of pqr pqr .

10. Hence, we have shown that
(pqr)33((pq)r+(qr)p+(rp)q1). (pqr)^3 \mid 3((pq)^r + (qr)^p + (rp)^q - 1).

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.