2013 MTAP DepEd Saturday Mathematics Program Grade 5 Session 3 TG

This session covers Number Theory. It includes the required learning competencies specifed
below.
1. Divisibility
2. Factors and multiplies o given numbers
!. "ist the prime actors o given numbers
#. $rites the prime actori%ation o a given number
&. Determines the greatest common actor '()F* o 2 or more numbers
+. Determines the least common multiple '"),* o 2 or more numbers
I. -. $ithout actually dividing. put a chec/ in the corresponding bo0 i the given number in
the frst column is divisible by the number at the top.
Numbe
r
2 ! # & + 1 2 3 14 11
2! +44 5 5 5 5 5
+! !12 5 5 5 5
21 #!2 5 5 5 5 5 5
21#
234
5 5 5 5 5
1 1+1
31#
5
6. 1* 4.2.#.+.2 2* 2.&.2 !* 2.+ #* 4.& &* 2.2 +* & 1* 2
2* 2
II. -* 1* +7 2.! 2* 1& 7 &.! !* 1&8 1& 7 &.! #* 12 7 !. #8# 7 2.2
6* 1* ! 0 & 2* 2 0 1! !* 2
2
0 11 #* !
2
0 1 &* ! 0 & 0 1
+* 2
2
0 1 & 1* 2 0 ! &
2
2* 2 0 1 0 1! 3* 2 0 & 0 11
2
14* 1 0 !2!
III -* 1* # 2* + !* 2 #* ! &* 1
+* 12 1* 21 2* 12 3* 2 14* #
11* # 12* 3 1!* 2 1#* 1! 1&* 2

6* 1* 12 2* 112 !* #2 #* #2 &* !+
+* 34 1* 1& 2* 21! 3* 1## 14* +4
11* 24 12* 34 1!* 2#4 1#* 12 1&* 2 24&
I9. 1. -* 14& b* 142. 111. 12+. 1!&. 1##. 1&!. 1+2. 111 -nswer: 2

2.* 2. #. &. 2. 14. 24. #4 3.* 2cm
!. 2
2
0 ! 0 & 7 +4 14.* +1
#.* 2
!
0 !
!
0 & 7 2 0 3 7 !+4 11.* 12
&.* 124 1!.* 1##
+* - ; 6 7 2 1#.* 1m
2 &&+. # &&#. + &&2. 2 &&4 1&* +. 2. 14. 1#. 22. 2+
1.* + groups maybe ormed each with # sopranos. 14 altos and + tenors
! groups maybe ormed each with 2 sopranos. 24 altos and 12 tenors
2 groups maybe ormed each with 12 sopranos. !4 altos and 12 tenors
)hallenge
1. 124 and 128 !+ and +4 2. 113
!. The numbers divisible by 11 are: 1 1#3. 1 3#1. # 113. 1 13#. 1 #31. 3 11#. 3 1#1
#. &21 and 2
&. The ones digits o the numbers divisible by 2 has a pattern 4. 2. +. #. 2. The ones
digit repeat every & multiplies o 2. Thus. there are 1 444 5 '2 0 &* 7 2& pages that have the digit
2 in the ones place and are divisible by 2.
2013 MTAP DepEd Saturday Mathematics Program Grade 5 Session 3 TG
I. -. $ithout actually dividing. put a chec/ in the corresponding bo0 i the given number in
the frst column is divisible by the number at the top.
Numbe
r
2 ! # & + 1 2 3 14 11
2! +44
+! !12
21 #!2
21#
234
1 1+1
31#
6. In 2#1<<. what digit should be in the << so that the number is divisible by
1* 2 2* ! !* # #* & &* + +* 3 1* 14 2* 12
). Determine all values o the digit =d> such that the number ormed is divisible by the
number on its right.
1* #d28 ! 2* 2d!18 3 !* d14 8 3 #* +1#d 8 3
&* ! 4d2 8 +* &2 !1d 8 1& 1* !1# +1d 8 3 2* 111 #d2 8 12
II -. ?upply the missing number in each actor tree
1. 2# 2. #&
!. 1& #. 2#
6. @0press the ollowing as a product o prime actors. Ase e0ponents when applicable
1*1& 2* 2+ !* ## #* +! &* 14&
+* 1#4 1* 1&4 2* 122 3* 1 214 14* 2 2+1
III -. Find the ()F o the ollowing sets o numbers
1* 1+. ## 2* 2#. + !* 24. 2+ #* 21. !3
&* 14. 21 +* !+. &# 1* +!. 2# 2* 142. 1&+
3* 1#4. 1+2 14* 1!2. +24 11* 24. 22. #4 12* 12. !+. 21
1!* 2#. #4. 3+ 1#* 14#. 12. 111 1&* 224. !2#. !12
6. Find the "), o the ollowing sets o numbers
1* #.+ 2* 2. 112 !* 12. 1+ #* 1+. 2#
&* 3. 12 +* 1&. 12 1* #&. 1& 2* !3. 31
3* 2. 1+. 1& 14* 14. 12 11* 1+. 24 12* 12. !4
1!* 2. 1+. 1& 1#* 12. 12. 2# 1&* !&. #&. +!
I9. ?olve the ollowing
1. a. $hat is the multiple o 1 nearest to but greater than 14B
b. Cow many multiplies o 3 are there between 141 and 11!B
2. "ist all actors o #4.
!. Find the ()F o 2
#
0 !
2
0 & and 2
2
0 ! 0 &
2
#. Find the "), o 2
!
0 !
!
and 2 0 !2 0 &
&. Duth can arrange her stic/ers either 3 on the page. 12 on a page o 1& on a page.
$hat is the smallest number o stic/ers that will allow her to do thisB
+. The #Edigit number -&&6 is divisible by 12 without remainder. $hat is -;6B $hat
numbers can -&&6 beB
1. Four music teacher wants to divide the school choir into smaller groups. There are 2#
sopranos. +4 altos. and !+ tenors. @ach group will have the same number o each type o voice.
Cow many smaller groups can be ormedB Cow many each sopranos. altos and tenors are there
in the small groupB
2. The greatest common actor o two number is !4. Their least common multiple is #24.
Gne o the numbers is 214. $hat is the other numberB
3. Hose has three pieces o rope with lengths o 1#4 cm. 1+2 cm and 2!4 cm. Ce wishes
to cut the three pieces o rope in to smaller pieces o equal length with no remainders. $hat is
the greatest possible length o each o the smaller piecesB
14. $hat is the greatest number by which 14!1 and 11&3 can both be divided e0actlyB
11. The Division ?upervisor wishes to distribute 2# balls and 124 bats equally among a
number o schools. Find the greatest number o schools receiving the items in this way.
12. -n ice cream bar producer puts a coupon or a ree bar in every 24
th
bar he produces.
and a coupon or two ree bars in every 124
th
bar. Cow oten does he put both coupons in a
single barB
1!. I one car can travel 12 /ilometers per liter o gasoline and another car can travel 1+
/ilometers per liter o gasoline. what is the smallest natural number o liters o gasoline each
consumes i it travels e0actly the same distanceB
1#. ,r. Hones wishes to cut as many pieces o rope or equal length as he can rom three
strands that are !& meters. #3 meters. and &+ meters long. I he wishes the pieces to be as long
as possible and does not wish to waste any rope. how long should he cut each pieceB
1&. Find all the numbers rom 1 to !4 that have # actors.
)hallenge
1. The product o two numbers is 2 1+4 and their ()F is 12. Find all possible pairs o such
numbers.
2. $hat is the least multiple o 1 which when divided by 2. !. #. & and + leaves the
remainders 1. 2. !. #. &. respectivelyB
!. - ourEdigit number contains the digit 1. #. 1 and 3 but not in that order. -rrange these
digits so that the number is divisible by 11. In how many ways can this be doneB
#. The sum o two diIerent numbers that have two actors is &23. $hat are the two
numbersB
&. The pages o a boo/ are numbered consecutively rom 1 to 1 444. Cow many page
numbers have the digit 2 in the ones place and are divisible by 2B