This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2017 India PRMO, 28
Tags: prime number , fermat pseudo-primes , euler s theorem , carmichael s number , number theory
Let $p,q$ be prime numbers such that $n^{3pq}-n$ is a multiple of $3pq$ for [b]all[/b] positive integers $n$. Find the least possible value of $p+q$.