## Excel in math and science

### Master concepts by solving fun, challenging problems.

## It's hard to learn from lectures and videos

### Learn more effectively through short, conceptual quizzes.

## Our wiki is made for math and science

###
Master advanced concepts through explanations,

examples, and problems from the community.

## Used and loved by 4 million people

###
Learn from a vibrant community of students and enthusiasts,

including olympiad champions, researchers, and professionals.

## Comments

Sort by:

TopNewestThis is a simple application of Wilson's Theorem.

First, note that \(9! \equiv -1\) (mod \(71\)).

Then, since \(71\) is a prime, by Wilson's Theorem,

\(70! \equiv -1\) (mod \(71\)).

But \(70! \equiv 61! (62)(63)(64)...(70) \equiv 61! (-9)(-8)(-7)...(-1)\) \( \equiv -61!(9!) \equiv 61! \) (mod \(71\)).

But \(70! \equiv -1\) (mod \(71\)).

So \(61! \equiv 70! \equiv -1\) (mod \(71\)).

Log in to reply

Oh I see why I was looking at it the wrong way. Nice proof Zi song :)

Log in to reply

I'm not that great at modulus arithmetic but how can 61!= -1 mod(7) ? Doesn't that mean that it is smaller than 7 ?

Log in to reply