Therefore, if eachĭigit of a number is expressed as its actual place value as a sum of terms where a is The first term in this sequence is 0 (10 0-1) which is divisible. If T (n-1) is divisible by 9, T n will beĪlso. Group as a term in the sequence T n=T (n-1)*9+9. This can be proved by expressing each number in this Any number which is one less than an integer
WIKIPEDIA LIST OF PRIME NUMBERS MOD
(Proof) Proof for Divisibility of 9:ĩ = 10 − 1, which means 10 ≡ 1 mod 9. The only step different is to check if it is the multiple of 9 instead of 3. Since 12 is divisible by 3, the test is positive.
Afterwards, the equation gives us:Įxample: Examining the divisibility of 12423 by 3 - By adding all the digits together, we get 1 + 2 + 4 + 2 + 3 = 12. So, in a number such as the following, we can replaceĪll the powers of 10 by 1. Since two things that are congruent modulo 3 are either both divisibleīy 3 or both not, we can interchange values that are congruent To raise everything to the nth power, then we get 10 n≡ 1 n≡1 (mod 3). This method works for divisors that are factors of 10 − 1 = 9.įirst of all, 9 = 10 − 1, which means 10 ≡ 1 mod 3.
Starting from the right to left, sum up all the digits in blocks of n digits. The largest digit of a is a k, and the smallest digit is a 1.ĭue to this, a is divisible by d if and only if the last n digits of a is divisible by d. Then, let a be an integer with k number of digits, and assume that k is larger than n.