Proof of fermats theorem in some simple way

Fermats theorem

Note by Hardik Chandak
6 years, 1 month ago

No vote yet
5 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

Sort by:

Top Newest

Are you looking for a simple proof of Fermat's Little Theorem or Fermat's Last Theorem or one of the many other theorems named after Fermat?

Jimmy Kariznov - 6 years, 1 month ago

Log in to reply

FERMATS LAST THEOREM

Hardik Chandak - 3 years, 7 months ago

Log in to reply

I'm pretty sure Fermat's Last Theorem

Hahn Lheem - 6 years, 1 month ago

Log in to reply

Fermat's Little Theorem can be proved using induction.

Michael Tang - 6 years, 1 month ago

Log in to reply

Can u prove it by induction plz show?

Tushar gautam - 6 years, 1 month ago

Log in to reply

It's not by induction, but an easy proof of Fermat's little theorem would be that xp(1+1+1+...+1)p(1p+1p+...+1p)x(modp)x^p \equiv (1+1+1+...+1)^p \equiv (1^p+1^p+...+1^p) \equiv x \pmod p with xx times number 11. This is possible because in Pascal's triangle on prime rows the numbers are multiples of p except for the first and last terms which are 11. This can be easily proven by using binomial formula.

Michael May - 6 years, 1 month ago

Log in to reply

Okay get your calculators and try this:

178212+18411212\sqrt[12]{1782^{12}+1841^{12}}

=1922=1922 right?

So this implies that 178212+184112=192212{1782^{12}+1841^{12}=1922^{12}}

Does this disprove Fermat's Last Theorem?

Of course not!

The calculator is wrong.

Ching Z - 6 years, 1 month ago

Log in to reply

BTW: A quick check to see that 178212+1841121922121782^{12}+1841^{12} \neq 1922^{12} is to note that the left side is odd whereas the right side is even.

Jimmy Kariznov - 6 years, 1 month ago

Log in to reply

Took some time to realize... The actual answer is 1921.99999995586722540291132837029507293441170657370868230...1921.99999995586722540291132837029507293441170657370868230... Unfortunately, most calculators round the answer.

Vincent Tandya - 6 years, 1 month ago

Log in to reply

If I remember correctly, that "equation" was from a Homer Simpson episode.

Daniel Liu - 6 years, 1 month ago

Log in to reply

I can give you a proof .

Ukkash Asharaf - 4 years, 11 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...