MathCastle
Number TheoryChallengeFermat, Euler and Wilson

Fermat, Euler and Wilson · Challenge problem

For how many integers nn with 1≤n≤10001 \le n \le 1000 is 6n!−16^{n!} - 1 divisible by nn?