HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /The numbers 43 and 97 are prime. Use Wilson's theorem to find the remainder of 40! …
HardMathematicsHigh School (11–12)Number TheoryNumericalOlympiad

The numbers 43 and 97 are prime. Use Wilson's theorem to find the remainder of 40! …

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

The numbers 434343 and 979797 are prime. Use Wilson's theorem to find the remainder of 40!40!40! on division by 434343, and the remainder of 95!95!95! on division by 979797. In each case write the full factorial (p−1)!(p - 1)!(p−1)! as the smaller factorial times a few extra factors, and replace each extra factor by a small negative number.

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

Wilson: (p−1)!≡−1(modp)(p - 1)! \equiv -1 \pmod p(p−1)!≡−1(modp) for a prime ppp. The order ord⁡n(a)\operatorname{ord}_n(a)ordn​(a), the least kkk with ak≡1a^k \equiv 1ak≡1, divides every mmm with am≡1a^m \equiv 1am≡1, so it divides φ(n)\varphi(n)φ(n):

am≡1(modn)  ⟺  ord⁡n(a)∣m.\displaystyle a^m \equiv 1 \pmod n \iff \operatorname{ord}_n(a) \mid m.am≡1(modn)⟺ordn​(a)∣m.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Given. Wilson: 42!≡−1(mod43)42! \equiv -1 \pmod{43}42!≡−1(mod43) and 96!≡−1(mod97)96! \equiv -1 \pmod{97}96!≡−1(mod97).

Step 1. The first. 42!=42×41×40!≡(−1)(−2)⋅40!=2⋅40!42! = 42 \times 41 \times 40! \equiv (-1)(-2) \cdot 40! = 2 \cdot 40!42!=42×41×40!≡(−1)(−2)⋅40!=2⋅40!. So 2⋅40!≡−1≡422 \cdot 40! \equiv -1 \equiv 422⋅40!≡−1≡42, and 40!≡21(mod43)40! \equiv 21 \pmod{43}40!≡21(mod43).

Step 2. The second. 96!=96×95!≡−95!96! = 96 \times 95! \equiv -95!96!=96×95!≡−95!. So −95!≡−1-95! \equiv -1−95!≡−1, and 95!≡1(mod97)95! \equiv 1 \pmod{97}95!≡1(mod97).

Check. 2×21=42≡−1(mod43)2 \times 21 = 42 \equiv -1 \pmod{43}2×21=42≡−1(mod43), as needed.

Answer: 40!40!40! leaves 212121 and 95!95!95! leaves 111.

Watch out. The rule (p−3)!≡p−12(p - 3)! \equiv \tfrac{p - 1}{2}(p−3)!≡2p−1​ is a consequence, not a separate fact to learn. Peel the factors each time.

Log in to save this for later
← All Problems
← Find every positive integer n with φ(n) = 12…The decimal of 1/41 repeats, and so does the decimal of 1/17… →
More onNumber Theory

Discussion (0)

Log in to join the discussion.

Loading…

More on this topic

  1. The triangular numbers are 1, 3, 6, 10, …, where the nth one is (n(n + 1))/2…Advanced
  2. Prove that the equation x³ + y³ + z³ = n has no solution in integers when n leaves remainder 4 or 5…Advanced
  3. Find every triple of positive integers a ≤ b ≤ c with 1/a + 1/b + 1/c = 1, and prove that there are…Advanced
  4. Find all pairs of positive integers (x, y) with x² - y² = 945…Hard
  5. A teacher wants a list of every primitive Pythagorean triple whose hypotenuse is less than 100…Advanced
All problems on this topic →