0% found this document useful (0 votes)
33 views2 pages

UNIT 4 Divisibility

This document discusses divisibility rules and concepts. It defines divisors and multiples of numbers, and provides rules to determine if a number is divisible by 2, 3, 5, 9, or 10 based on its digits. It also introduces the concepts of the greatest common divisor (GCD) and least common multiple (LCM) of numbers and directs the reader to examples in their book.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
33 views2 pages

UNIT 4 Divisibility

This document discusses divisibility rules and concepts. It defines divisors and multiples of numbers, and provides rules to determine if a number is divisible by 2, 3, 5, 9, or 10 based on its digits. It also introduces the concepts of the greatest common divisor (GCD) and least common multiple (LCM) of numbers and directs the reader to examples in their book.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT 4: DIVISIBILITY

Divisors of a number

If you think two any whole numbers, for example 12 and 3, its division can be:

12 : 3 = 4 and the rest is 0.

Resulting in the number 4, another whole number. You call this an exact division, since
the rest of the division is 0.

Now, if you think other two numbers, for example 12 and 5, and you will see that they
can also be divided:

12 : 5 = 2 and the rest is 2.

In this case, we obtain a rest, the number 2. Therefore, it will not be an exact division.

If you try to divide numbers among themselves shall be verified in some cases are
obtained exact divisions and in other divisions do not.

Multiples of a number

If you take one examples, e.g. the number 35, it can be concluded that 35 is a multiple
of any of its divisors which are 1, 5, 7 and 35.

A number is a multiple of another when the latter can be multiplied by a third number
for the first.

In this case we can say that 35 is a multiple of 5 because:

7 x 5 = 35

In the same way, it is a multiple of 7 for the same reason.

Examples:

Multiples of 2 = 0, 2, 4, 6, 8, 10…

Multiples of 5 = 0, 5, 10, 15, 20, 25…

Divisibility rules

 A number is divisible by 2 if the number is even (the last digit is 0, 2, 4, 6, or 8)


Few examples: 50, 14, 896, 1358

 A number is divisible by 3 if the sum of the digits is divisible by 3

1,035- adding 1 to 3 to 5 and it equals 9 so it is divisible by 3

2,573- adding 2 to 5 to 7 to 3 and it equals 17 which is not divisible by 3

 A number is divisible by 5 if the last digit is 0 or 5.

50, 665, 785, 670 are divisible by 5.

 A number is divisible by 9 if the sum of the digits is divisible by 9 (this is the


same procedure we did for divisibility by 3, but now we are seeing if it is
divisible by 9)

Example:

6138

6+1+3+8 = 18- Yes it is divisible by 9

7983

7+9+8+4= 28- No, it is not divisible by 9

 A number is divisible by 10 if the last digit is 0. (Also divisible by 10 if it is


divisible by 2 and 5)

Give examples

60, 70, 50, 600, 780 are divisible by 10.

Greatest common divisor (m.c.d in Spanish)

It is the largest common to several natural dividers. If the greatest common divisor of
two numbers is 1 they are related cousins said. To calculate the greatest common
divisor of several number, first we factorize them and then take the common factors
raised to the lower exponent.

LOOK AT THE EXAMPLES IN YOUR BOOK

Least common multiple (m.c.m in Spanish)

It is the smallest of a set of natural common multiples. For the calculation of least
common multiple of two numbers we write some of the first multiples of each one and
we select the lower number they have in common (except 0). That is the m.c.m.

LOOK AT THE EXAMPLES IN YOUR BOOK.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy