Prove that 61! = -1mod71

#HelpMe! #MathProblem #Math

Note by Nicholas Fortino
8 years, 5 months ago

No vote yet
8 votes

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

This is a simple application of Wilson's Theorem.

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

Then, since 7171 is a prime, by Wilson's Theorem,

70!170! \equiv -1 (mod 7171).

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

But 70!170! \equiv -1 (mod 7171).

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

Zi Song Yeoh - 8 years, 5 months ago

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 ?

johnson adeleke - 8 years, 5 months ago

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

johnson adeleke - 8 years, 5 months ago
×

Problem Loading...

Note Loading...

Set Loading...