Divisibility rules A number is divisible by 2 if and only if the last digit is divisible by 2.

A number is divisible by 3 if and only if the sum of the digits is divisible by 3. A number is divisible by 4 if and only if the last 2 digits is a number divisible by 4. A number is divisible by 5 if and only if the last digit is divisible by 5. A number is divisible by 6 if and only if it is divisible by 2 and 3. A number is divisible by 8 if and only if the last 3 digits is a number divisible by 8. A number is divisible by 9 if and only if the sum of the digits is divisible by 9. A number is divisible by 10n if and only if the number ends in n eros. A number is divisible by 11 iff the sum of every other digit minus the sum of the rest of the digits is divisible by 11. !o find out if a number is divisible by seven" ta#e the last digit" double it" and subtra$t it from the rest of the number. %&am'le( )f you had 203" you *ould double the last digit to get si&" and subtra$t that from 20 to get 14. )f you get an ans*er divisible by + ,in$luding ero-" then the original number is divisible by seven. )f you don.t #no* the ne* number.s divisibility" you $an a''ly the rule again. /umber !heory( !he greatest $ommon divisor is found by loo#ing at the 'rime fa$tori ations or using the %u$lidean algorithm. !he least $ommon multi'le of a and b is found by loo#ing at the 'rime fa$tori ations or ,ab-0g$d,a"b-. !*o numbers are said to be relatively 'rime in the greatest $ommon fa$tor is 1. )f g$d,a" b-1d" then there e&ist integers & and y so that a&2by1d.

)f d divides both a and b" then d divides a2b and d divides a3b. a1b mod m iff m divides a3b iff a and b both have the same remainder *hen divided by m. a'31 1 1 mod ' ,a is not a multi'le of 'af,m-11 mod m , g$d,a" m- 11)f a 'robability e&'eriment is re'eated n times and the 'robability of su$$ess in one trial is '" then the 'robability of e&a$tly r su$$esses in the n trials is n4r ,'-r,13'-,n3r-. 5ules of 6ogarithms( loga,7-1y if and only if 71ay loga,7/-1loga,7-2loga,/loga,70/-1loga,7-3loga,/loga,7'-1'8loga,7loga,1-10 loga,a'-1' loga,7-1logb,7-0logb,a!he number of eros at the end of n9 is determined by the number of 5:s. !o find this you do the follo*ing 'ro$ess( n05 1 n1 and some remainder. Dro' the remainder and $om'ute n105 1 n2 'lus some remainder. Dro' the remainder and $om'ute n205 1 n3 'lus some remainder" et$. !he number of eros is n12n22n32n4... !he sum of any $onse$utive integers # through n" *ith n being the larger" sim'ly use this e;uation( ,n2#-,n3#21-