$n^{3pq} - n \equiv 0$ (mod $3pq$), where p and q are prime and $n$ is any integer Find the minimum possible value of $p+q$

Asked Sep 03 '17 at 13:09

Active Sep 03 '17 at 13:29

Viewed 63 times

This problem was asked in a local Olympiad. I do not know how to proceed because I did not think Fermats little theorem is applicable to composite numbers. Any help would be appreciated.

edited Sep 03 '17 at 13:29

asked Sep 03 '17 at 13:09

N.S.JOHN

1,549

1

What's $n$? Or is this meant to hold for all $n$? – lulu Sep 03 '17 at 13:24
@lulu edited the question. – N.S.JOHN Sep 03 '17 at 13:30

$n^{3pq} - n \equiv 0$ (mod $3pq$), where p and q are prime and $n$ is any integer Find the minimum possible value of $p+q$

0 Answers0