Divisibility by 11: Proof with Modular Arithmetic

preview_player
Показать описание

Explanation of the rule for whether a number is divisible by 11. We use congruence mod 11 to show the simple rule for checking divisibility!

Subscribe to see more new math videos!

Music: OcularNebula - The Lopez
Рекомендации по теме
Комментарии
Автор

This video is sufficient for me to become yours subscriber. Also, arithmetic playlist is awesome.
Thanks for this

sr.tarsaimsingh
Автор

Splendid! I always mix up the rules for divisibility for 11 and 13. Next time when i try to remember which is which, i'll just remember this great video. Thanks!☺

manthing
Автор

Wow! 10 congruent (-1) modulo 11 definitely the sine qua non. Much like 10 congruent 1 modulo 9 gives you the sum of the digits congruent to the number result.

One can use the 11 divisibility result to work the SMO Junior 2015 problem 27. Thanks much for your lucid video.

MyOneFiftiethOfADollar
Автор

When u reach 10K subs, plz make a video on tips for math youtubers 😀😀 I would love to watch that ❤️❤️❤️

Kdd
Автор

Can this be method be used to test divisibilty for any integer

Happy_Abe
Автор

3 ways to do it that are much simpler and faster.

barryjackson
Автор

Doing this with the rows of Pascals triangle always results in zero!

humanexperience
Автор

Good video, but this demonstration rather than a proof because you don't show how this works in general, instead you show how it applies to a specific example: 924. If you were to prove this it would most likely involve an if-and-only-if statement or perhaps a proof by contradiction. Nevertheless, good insights are provided here. Thank you!

gentlemandude