MathCastle
Number TheorySuperchallengeFermat, Euler and Wilson

Fermat, Euler and Wilson · Superchallenge problem

Find the remainder when the product of all integers kk with 1≤k≤2001 \le k \le 200 and gcd⁡(k,21)=1\gcd(k, 21) = 1 is divided by 2121.