Try our Free Online Math Solver!
Math 211 Chapter 5 Worksheet
2. Find the greatest common factor by repeatedly dividing prime numbers: gcf(105,132)
4. Find the greatest common factor by using the Euclidean Algorithm: gcf(957,3366)
5.a. Find gcf(a,b) if a is a multiple of b .
b. Find gcf(a,b) if a is a factor of b.
c. Find gcf(a,b) if a and b have no common factors.
7. If p, q and r are distinct prime numbers, find gcf(pqr,p2r).
8. Let . If m divides n , what can you conclude about the prime factorization of m?
9. The numbers 2, 5, and 9 are factors of my locker number and there are 12 factors in all. What is my locker number and why?
Least Common Multiple
1. Find the least common multiple using the sets of factors: lcm(30,75).
3. Find the gcf if lcm (a,b)=b
4. Find the lcm if gcf (a,b)=a
5. Find two numbers whose lcm is 100.
6. What is the lcm(a,b) if the gcf(a,b)=1?
7. Write ≤, <, ≥, >, =, or ? in the following blanks. Use
? if the answer cannot be determined from the information given.
8. If lcm(a,b)=gcf(a,b), what do you know about the relationship between a and b? Why?
Fill in the following table.