Try to take: 10/10/2005 1+0+1+0+2+0+0+5= *9* if you divide 10102005 by 9 , you will get a result where the remainder is 0; not *9* why this isn't supporting the variance principal?
I took the number 99999999, so when divided by 9 leaves a remainder 0, but when the digits are added up-to a single digit, the value comes to 9. Please explain.
Divisibility rule of 9 goes here. The sum of the digits till single digit will always be 9 if the number is exactly divisible by 9. So such number will leave no remainder and the sum of the digits will be 9. Therefore, for any number when remainder =0 it means the sum of the digits is 9. (divisor =9)
The principle is clearly understandable. This was just amazing and quite interesting. 👍
Thanks so much I understood invariance principle clearly by this video
It's just beautiful ❣️❣️...so much intituive ..m
I did this with to verify the concept myself and this concept was proved
amazing. İ am 7th grade and i love math. I needed it to solve some questions in olympic and you help me a lot.
Great to hear :)
Olympiad 😅😅
@@AK-vb9ks oh yeah
Amazing 💓
Came via the add, good channel but may i know how you make the animations and videos? Thanks i too wanna spread knowledge
Thank you!
Just amazing
amazing
Try to take:
10/10/2005
1+0+1+0+2+0+0+5= *9*
if you divide 10102005 by 9 , you will get a result where the remainder is 0; not *9*
why this isn't supporting the variance principal?
The remainder 9 is congruent (equivalent) to remainder 0. You can divide 9 by 9 and get remainder 0.
My B-day is 20/04/2006
20042006 divided by 9 the remainder would be 5 not 9
2+0+0+4+2+0+0+6 equals 14 -> 1+4 equals 5
Your B-day divided by 9 has remainder 5.
Checks out!
I took the number 99999999, so when divided by 9 leaves a remainder 0, but when the digits are added up-to a single digit, the value comes to 9. Please explain.
Remainder 0 = remainder 9 (when divisor is 9)
Divisibility rule of 9 goes here. The sum of the digits till single digit will always be 9 if the number is exactly divisible by 9. So such number will leave no remainder and the sum of the digits will be 9.
Therefore, for any number when remainder =0 it means the sum of the digits is 9. (divisor =9)
I have e better solution n>0 (n-1)%9 + 1. it work's better. not my idea.