the beauty of mathematics 7

this is the proof of the little fermat we made at university. it is a very short proof but you have to know some conditions before. in this case p is primnumber and a one solution in F. F is the set of numbers which can be divided by p (its very hard to explain it in english *g*)

note:
this is just the little fermat, the proof of the big fermat (a^n+b^n=c^n) is much more difficult. it was proofed by andrew wiles (see my favorites)

thx for watching =)

Category:

Science & Technology

Tags:

• littlefermat

[GR1o6180339887498948]

Hey, this is not an ordinary proof, I can tell you that, thanks for sharing.

[libuntux]

pls tell me why this is not a ordinary proff (note that i am only in the F(p) numbers where F where the numbers of modulo prim and p=prim).....if u got the right proof...pls tell me.....at university it was right....

[GR1o6180339887498948]

I think you might have misunderstood my English, I didn't say it was wrong, I meant to say that this is not a simple proof; everything is correct.

[libuntux]

oh, ok sorry for my misunderstanding. i have to improve my english =) thanks for your comments

[tekhiun]

just a little notation help: rem is written as mod

in english. It is also more formal to write in this way : a^p = a mod p (where the equal in this case is the sign for congruence)

[libuntux]

our prof prefers the notation "rem", we all were very suprised because we just knew the "mod" notation.

[arenms]

@libuntux wow beautiful man! i love the music bro! :D It makes it so easy to understand. Do you know what the song of the background music is? thanks:)

[tekhiun]

i see , indeed rem(ainder) makes more sense then mod(ulus) hehe

but i have never seen this notation before

[science2490]

Wieder mal richtig interessant! Da bekommt man Lust aufs Mathestudium =)

In welchem Semester lernt man sowas?