Тёмный

Fermat's little theorem | Journey into cryptography | Computer Science | Khan Academy 

Khan Academy Labs
Подписаться 54 тыс.
Просмотров 118 тыс.
50% 1

Introduction to a key result in elementary number theory using a visualization with beads
Watch the next lesson: www.khanacadem...
Missed the previous lesson? www.khanacadem...
Computer Science on Khan Academy: Learn select topics from computer science - algorithms (how we solve common problems in computer science and measure the efficiency of our solutions), cryptography (how we protect secret information), and information theory (how we encode and compress information).
About Khan Academy: Khan Academy is a nonprofit with a mission to provide a free, world-class education for anyone, anywhere. We believe learners of all ages should have unlimited access to free educational content they can master at their own pace. We use intelligent software, deep data analytics and intuitive user interfaces to help students and teachers around the world. Our resources cover preschool through early college education, including math, biology, chemistry, physics, economics, finance, history, grammar and more. We offer free personalized SAT test prep in partnership with the test developer, the College Board. Khan Academy has been translated into dozens of languages, and 100 million people use our platform worldwide every year. For more information, visit www.khanacademy.org, join us on Facebook or follow us on Twitter at @khanacademy. And remember, you can learn anything.
For free. For everyone. Forever. #YouCanLearnAnything
Subscribe to Khan Academy’s Computer Science channel: / channel
Subscribe to Khan Academy: www.youtube.co...

Опубликовано:

 

26 сен 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 40   
@user-2d2klem3nei
@user-2d2klem3nei 4 года назад
THe most intuitive explanation I've seen so far, now I'll never forget this theorem. Thank you!
@luce_9801
@luce_9801 8 лет назад
It's an really Awesome combinatorial proof Hats Off Khan Academy Labs!!!
@wrstark
@wrstark 8 лет назад
This is an excellent demonstration.
@fahrenheit2101
@fahrenheit2101 3 года назад
That was awesome. Might need to rewatch for it to fully stick in but this is the best intuitive explanation I've come across. I'd love to see how a more rigorous proof matches up with the logic used here.
@funnywaves8765
@funnywaves8765 6 лет назад
Please donate to Khan Academy so that they can keep their good work and provide more free Education worldwide for our Children of the Beautiful Planet.
@juicyclaws
@juicyclaws 7 лет назад
this is such a fucking good explanation
@nicolasmagee1780
@nicolasmagee1780 8 лет назад
The 9th row in the 2:06 seems to be repeated with the 7th row :)
@wiscatbijles
@wiscatbijles 3 года назад
Yes, should have been 1001. That's the permutation that was missing.
@Kira-yn9fs
@Kira-yn9fs 3 года назад
@@wiscatbijles exactly!
@mayankjangid1543
@mayankjangid1543 3 года назад
GORGEOUS !!!!!! YOU MADE IT SO OBVIOUS. THANK YOU FOR YOUR EFFORTS !
@herzallahaymen5478
@herzallahaymen5478 3 года назад
The most beautiful mathematical proof I have ever seen in my life
@chaussebenjamin
@chaussebenjamin Год назад
2:00 Didn't you forget the sequence pyyp (p=purple, y=yellow) for the sequences containing 2 of each color?
@shauryaagarwal4556
@shauryaagarwal4556 23 дня назад
Yeah, he accidentally counted yppy twice
@ingrid1156
@ingrid1156 6 месяцев назад
Stunning explanation
@valentinsarmagal
@valentinsarmagal 7 лет назад
that was beautiful, thank you
@randomvideos3628
@randomvideos3628 10 месяцев назад
you gotta be kidding me... this is awesome!
@vipulpatel-il9nb
@vipulpatel-il9nb 2 месяца назад
Sog!!
@jasonzacharias2150
@jasonzacharias2150 2 года назад
Thank you sir, thank you...
@jacksonkaib5122
@jacksonkaib5122 Год назад
Why does the last part of the explanation make sense? How does (a^p)|a = x remainder a ?
@santoshnegi5693
@santoshnegi5693 5 лет назад
I never thought this way It was interesting
@subhajitbag5592
@subhajitbag5592 3 года назад
This is stupendous!!💜
@Jomodev
@Jomodev 3 года назад
Great Explanation
@joshitasharma3102
@joshitasharma3102 6 лет назад
Wow, thank you so much😊
@MrAnandabhyankar
@MrAnandabhyankar 3 года назад
Great Work!!
@sk99gaming99
@sk99gaming99 Год назад
so can i say that the number of arrangemnts are n-1!/2
@eobardthawne6903
@eobardthawne6903 3 года назад
Oh shit! My university professors should watch these videos first before teaching us.
@shramanabhattacharya5136
@shramanabhattacharya5136 6 лет назад
So what I inferred from the last part was that when the monocoloured beads are subtracted,then exactly 'a' no. of strings are removed.But a is supposed to be the no. of type of colours used.I am confused.... But otherwise it was a good explanation.
@udayrallabhandi3345
@udayrallabhandi3345 5 лет назад
Abhijit Bhattacharyya Because for every color, there is one string that is only made up of beads of that color
@lafudge2929
@lafudge2929 2 года назад
0:33
@feroze170
@feroze170 9 лет назад
Brit your videos allow me to understand, which sparks my interest in the subject, which opens up a whole new world to me.
@luce_9801
@luce_9801 8 лет назад
They really are too good for not to generate interest for the topic.
@ehza
@ehza 6 лет назад
😎
@vighneshk509
@vighneshk509 4 года назад
fucking amazing !!!
@SCOA57KrutikaAhire-en1ob
@SCOA57KrutikaAhire-en1ob 5 месяцев назад
this rule doesn't seem fundamental to me
@gouravbansal3391
@gouravbansal3391 3 года назад
That was ridiculous
@flanker53
@flanker53 6 лет назад
watching at 1.5 speed why u talk so slow...good video anyways
@miketurner3461
@miketurner3461 2 года назад
It divides evenly into cosets of size 3 which themselves groups but there is only one proper subgroup right?
@theSpicyHam
@theSpicyHam 9 лет назад
Whoa it's true, works with any numbers
@minyihuang225
@minyihuang225 Год назад
Amazing video!
Далее
А вы играли в school boy runaway?
00:30
Просмотров 149 тыс.
Fermat primality test
7:09
Просмотров 41 тыс.
Fermat's Little Theorem (Visualization)
6:06
Просмотров 100 тыс.
An inductive proof of Fermat's little theorem.
7:35
Просмотров 28 тыс.
a geometric proof of Fermat's little theorem.
13:33
Просмотров 27 тыс.