This action might not be possible to undo. Are you sure you want to continue?

Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more

Download

Standard view

Full view

of .

Look up keyword

Like this

Share on social networks

2Activity

×

0 of .

Results for: No results containing your search query

P. 1

Divisibility by Prime Numbers Under 50Ratings:

(0)|Views: 179|Likes: 2

Published by Mridul Sethi

here are some of the divisibility rules of prime numbare under 50

here are some of the divisibility rules of prime numbare under 50

See more

See less

https://www.scribd.com/doc/21898667/Divisibility-by-Prime-Numbers-Under-50

06/08/2010

text

original

Divisibility by prime numbers under 50.

© Stu Savory, 2003 & 2004.

A number is

divisible by 2

if its last digit is also (i.e. 0,2,4,6 or 8).A number is

divisible by 3

if the sum of its digits is also. Example: 534: 5+3+4=12 and 1+2=3so 534 is divisible by 3.A number is

divisible by 5

if the last digit is 5 or 0.

Most people know (only) those 3 rules. Here are my rules for divisibility by the PRIMES upto 50.

Why only primes and not also composite numbers? A number is divisible by a compositeif it is also divisible by all the prime factors (e.g. is divisible by 21 if divisible by 3 AND by 7).Small numbers are used in these worked examples, so you could have used a pocket calculator.But my rules apply to any number of digits, whereas

you cannot test a 30 or more digitnumber on your pocket calculator otherwise

.

Test for divisibility by 7

. Double the last digit and subtract it from the remaining leadingtruncated number. If the result is divisible by 7, then so was the original number. Apply this ruleover and over again as necessary. Example: 826. Twice 6 is 12. So take 12 from the truncated 82. Now 82-12=70. This is divisible by 7, so 826 is divisible by 7 also.There are similar rules for the remaining primes under 40, i.e. 11,13, 17,19,23,29,31,37,41,43and 47.

Test for divisibility by 11

. Subtract the last digit from the remaining leading truncated number.If the result is divisible by 11, then so was the first number. Apply this rule over and over againas necessary.Example: 19151--> 1915-1 =1914 -->191-4=187 -->18-7=11, so yes, 19151 is divisible by 11.

Test for divisibility by 13

. Add four times the last digit to the remaining leading truncatednumber. If the result is divisible by 13, then so was the first number. Apply this rule over andover again as necessary.Example: 50661-->5066+4=5070-->507+0=507-->50+28=78 and 78 is 6*13, so 50661 isdivisible by 13.

Test for divisibility by 17

. Subtract five times the last digit from the remaining leadingtruncated number. If the result is divisible by 17, then so was the first number. Apply this ruleover and over again as necessary.Example: 3978-->397-5*8=357-->35-5*7=0. So 3978 is divisible by 17.

Test for divisibility by 19

. Add two times the last digit to the remaining leading truncatednumber. If the result is divisible by 19, then so was the first number. Apply this rule over andover again as necessary.EG: 101156-->10115+2*6=10127-->1012+2*7=1026-->102+2*6=114 and 114=6*19, so101156 is divisible by 19.My original divisibilty webpage stopped here. However, I have had a number of mails asking for divisibility tests for larger primes, so I've extended the list up to 50. Actually even with 37 most people cannot do the necessary mental arithmetic easily, because they cannot recognise evensingle-digit multiples of two-digit numbers on sight. People are no longer taught themultiplication table up to 20*20 as I was as a child. Nowadays we are lucky if they know it up to10*10.

Test for divisibility by 23

. Add seven times the last digit to the remaining leading truncatednumber. If the result is divisible by 23, then so was the first number. Apply this rule over andover again as necessary.Example: 17043-->1704+7*3=1725-->172+7*5=207-->20+7*7=69 which is 3*23, so 17043 isalso divisible by 23.

Test for divisibility by 29

. Add three times the last digit to the remaining leading truncatednumber. If the result is divisible by 29, then so was the first number. Apply this rule over andover again as necessary.Example: 15689-->1568+3*9=1595-->159+3*5=174-->17+3*4=29, so 15689 is also divisible by 29.

Test for divisibility by 31

. Subtract three times the last digit from the remaining leadingtruncated number. If the result is divisible by 31, then so was the first number. Apply this ruleover and over again as necessary.Example: 7998-->799-3*8=775-->77-3*5=62 which is twice 31, so 7998 is also divisible by 31.

Test for divisibility by 37

. This is (slightly) more difficult, since it perforce uses a double-digitmultiplier, namely eleven. People can usually do single digit multiples of 11, so we can use thesame technique still. Subtract eleven times the last digit from the remaining leading truncatednumber. If the result is divisible by 37, then so was the first number. Apply this rule over andover again as necessary.Example: 23384-->2338-11*4=2294-->229-11*4=185 which is five times 37, so 23384 is alsodivisible by 37.

Test for divisibility by 41

. Subtract four times the last digit from the remaining leadingtruncated number. If the result is divisible by 41, then so was the first number. Apply this ruleover and over again as necessary.Example: 30873-->3087-4*3=3075-->307-4*5=287-->28-4*7=0, remainder is zero and so 30873is also divisible by 41.

Test for divisibility by 43

. Now it starts to get really difficult for most people, because themultiplier to be used is 13, and most people cannot recognise even single digit multiples of 13 atsight. You may want to make a little list of 13*N first. Nevertheless, for the sake of completeness, we will use the same method. Add thirteen times the last digit to the remainingleading truncated number. If the result is divisible by 43, then so was the first number. Apply thisrule over and over again as necessary.Example: 3182-->318+13*2=344-->34+13*4=86 which is recognisably twice 43, and so 3182 isalso divisible by 43.

Update :

Bill Malloy has pointed out that, since we are working to

modulo

43, instead of addingfactor 13 times the last digit, we can subtract 30 times it, because 13+30=43. Why didn't I think of that!!! :-(Finally, the

Test for divisibility by 47

. This too is difficult for most people, because themultiplier to be used is 14, and most people cannot recognise even single digit multiples of 14 atsight. You may want to make a little list of 14*N first. Nevertheless, for the sake of completeness, we will use the same method. Subtract fourteen times the last digit from theremaining leading truncated number. If the result is divisible by 47, then so was the first number.Apply this rule over and over again as necessary.Example: 34827-->3482-14*7=3384-->338-14*4=282-->28-14*2=0 , remainder is zero and so34827 is divisible by 47.

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd