0% found this document useful (0 votes)
221 views3 pages

04 Task Performance 1 GRMDiscrete Math

The document shows the work of determining whether several numbers are divisible by other numbers, whether numbers are prime or composite, finding the greatest common divisor and least common multiple of pairs of numbers. For each problem, the steps shown are to find the prime factors of the numbers and identify the greatest/least numbers that can fully divide/multiply both numbers in the pair.

Uploaded by

Guevarra Keith
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)
221 views3 pages

04 Task Performance 1 GRMDiscrete Math

The document shows the work of determining whether several numbers are divisible by other numbers, whether numbers are prime or composite, finding the greatest common divisor and least common multiple of pairs of numbers. For each problem, the steps shown are to find the prime factors of the numbers and identify the greatest/least numbers that can fully divide/multiply both numbers in the pair.

Uploaded by

Guevarra Keith
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/ 3

Gemmarose Mejia

04 Task Performance 1 - ARG

Instructions

Upload a photo of your answer sheet showing your name and solution. (20
items x 2 points)
A. Determine if 1781 is divisible by 3, 6, 7, 8, and 9. (5 items x 2
points).
1. 3 | 1781
n
q=
d
1781
q=
3
q=¿ 593.67; hence, 3 and 1781 has no relationship.
2. 6 | 1781
n
q=
d
1781
q=
6
q=¿ 296.83; hence, 6 and 1781 has no relationship.
3. 7 | 1781
n
q=
d
1781
q=
7
q=¿ 254.43; hence, 7 and 1781 has no relationship.
4. 8 | 1781
n
q=
d
1781
q=
8
q=¿ 222.63; hence, 8 and 1781 has no relationship.
5. 9 | 1781
n
q=
d
1781
q=
9

This study source was downloaded by 100000835203449 from CourseHero.com on 05-27-2022 00:17:20 GMT -05:00

https://www.coursehero.com/file/95026252/04-Task-Performance-1-GRMDiscrete-Mathdocx/
q=¿ 197.89; hence, 9 and 1781 has no relationship.
B. Determine if each of the following numbers is a prime or composite.
6. 828 = Composite. (828 has a prime factorization of is 2² x 3² x 23.
828 is a COMPOSITE number since it has a total of 5 prime factors.)
7. 1666 = Composite. (2 x 7² x 17 is the prime factorization of 1666.
1666 is a COMPOSITE number since it has four prime factors.)
8. 1781 = Composite. (1781 is a COMPOSITE number since it has
two prime factors.)
9. 1125 = Composite. (1125 is COMPOSITE number since it has
prime factors.)
10. 107 = Prime. (107 is a PRIME number because it is not possible
to factorize it. In other words, 107 can only be divided into two parts: 1
and by itself (107).)
C. Find the greatest common divisor of each of the following pairs of
integers.
11. 60 and 100 = 20 (1,2,3,4,5,6,10,12,15,20,30, and 60 are the
factors of 60. The factors of 100 are 1,2,4,5,10,20,25,50, and 100. Since,
20 divides all of them without remainder, it is the GCF/GCD.)
12. 45 and 33 = 3 (The factors of 45 are 1,3,5,9,15, and 45. The
factors of 33 are 1,3,11, and 33. The GCF/GCD is 3, because it is the
greatest number that divides equally or evenly into all of them.)
13. 34 and 58 = 2 (The factors of 34 are 1,2,17, and 34. The factors of
58 are 1,2,29, and 58. The GCF/GCD is 2, because it is the greatest
number that divides equally or evenly into all of them.)
14. 77 and 128 = 1 (The factors of 77 are 1,7,11, and 77. The factors
of 128 are 1,2,4,8,16,32,64, and 128. The GCF/GCD is 1, because it is the
greatest number that divides equally or evenly into all of them.)
15. 98 and 273 = 7 (The factors of 98 are 1,2,7,14,49, and 98. The
factors of 273 are 1,3,7,13,21,39,91, and 273. The GCF/GCD is 7, because
it is the greatest number that divides equally or evenly into all of them.)
D. Find the least common multiple of each of the following pairs of
integers.
16. 72 and 108 = 216 (The multiples of 72 are 72, 144, and 216. The
multiples of 108 are 108 and 216. 216 is the first number to appear on
both list of multiples, 216 is the LCM of 72 and 108.) (LCM = 2.2.2.3.3.3
= 216)
17. 175 and 245 = 1225 (The multiples of 175 are
175,350,525,700,875, …, and 1225. The multiples of 245 are
245,490,735,980, and 1225. 1225 is the first number to appear on both
list of multiples, 1225 is the LCM of 175 and 245.) (LCM = 5.5.7.7 =
1225)

This study source was downloaded by 100000835203449 from CourseHero.com on 05-27-2022 00:17:20 GMT -05:00

https://www.coursehero.com/file/95026252/04-Task-Performance-1-GRMDiscrete-Mathdocx/
18. 150 and 70 = 1050 (The multiples of 150 are
150,300,450,600,750,900, and 1050. The multiples of 70 are
70,140,210,280,350,420, …, and 1050. 1050 is the first number to appear
on both list of multiples, 1050 is the LCM of 150 and 70.) (LCM =
2.3.5.5.7 = 1050)
19. 32 and 27 = 864 (The multiples of 32 are 32,64,96,128,160,192,
and 864. The multiples of 27 are 2700,54,81,108,135,162, …, and 864.
864 is the first number to appear on both list of multiples, 864 is the LCM
of 32 and 27.) (LCM = 2.2.2.2.2.3.3.3 = 864)
20. 540 and 504 = 7560 (The multiples of 540 are
540,1080,1620,2160,2700, …, and 7560. The multiples of 504 are
504,1008,1512,2016,2520, …, and 7560. 7560 is the first number to
appear on both list of multiples, 7560 is the LCM of 540 and 504.) (LCM =
2.2.2.3.3.3.5.7= 7560)

This study source was downloaded by 100000835203449 from CourseHero.com on 05-27-2022 00:17:20 GMT -05:00

https://www.coursehero.com/file/95026252/04-Task-Performance-1-GRMDiscrete-Mathdocx/
Powered by TCPDF (www.tcpdf.org)

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