3.6: Equivalent Fractions Review
- Find all the factors for each number. If a number is a prime number, write “prime” next to it.
- 4
- 10
- 21
- 6
- 2
- 16
- Find the factors, common factors and the Greatest Common Factor (GCF) (fill in Table 3.6.1).
Table 3.6.1: Question 2 Fill in the Table Fraction Factors Common Factors GCF 28 816 2432 912 515 2530 412 - Express each fraction in lowest terms. Remember: be sure to write the greatest common factor (GCF) you are dividing with.
- 69 =
- 618 =
- 1228 =
- 1530 =
- 424 =
- 1018 =
- Circle the fractions that are in lowest terms.
- 12
- 36
- 45
- 39
- 48
- 510
- Find all the fractions that are not already in lowest terms and reduce them. Write “lowest terms” next to those already reduced.
- 48 =
- 25 =
- 812 =
- 1535 =
- 4280 =
- 636 =
- 915 =
- State if each pair of fractions is equivalent (=) or not equivalent (≠).
- 45 78
- 1012 56
- 515 13
- 67 3641
- 35 1525
- Round to the nearest whole number.
- 114 =
- 434 =
- 645 =
- 314 =
- 1289 =
3.6: Review Answers
- Find all the factors for each number.
- 1,2,4
- 1,2,5,10
- 1,3,7,21
- 1,2,3,6
- 1,2, prime
- 1,2,4,8,16
- Find the factors, common factors and the GCF (see Table 3.6.2).
Table 3.6.2: Question 2 Answwers Fraction Factors Common Factors GCF 28 1,2
1,2,4,81,2 2 816 1,2,4,8
1,2,4,8,162,4,8 8 2432 1,2,3,4,6,8,12,24
1,2,4,8,16,322,4,8 8 912 1,3,9
1,2,3,4,6,123 3 515 1,5
1,3,5,155 5 2530 1,5,25
1,2,3,5,6,10,15,305 5 412 1,2,4
1,2,3,4,6,1224 4 - Express each fraction in lowest terms.
- 23
- 13
- 37
- 12
- 16
- 78
- 59
- Circle the fractions that are in lowest terms.
- 12
- 45
- Find all the fractions that are not already in lowest terms and reduce them.
- 12
- lowest terms
- 23
- lowest terms
- (3)(7)
- 2140
- 16
- 35
- State if each pair of fractions is equivalent (=) or not equivalent (≠).
- ≠
- =
- =
- ≠
- =
- Round to the nearest whole number.
- 1
- 5
- 7
- 3
- 13
This chapter has been adapted from Unit 2 Review in Adult Literacy Fundamental Mathematics: Book 5 – 2nd Edition (BCcampus) by Liz Girard, Wendy Tagami, and Leanne Caillier-Smith (2023), which is under a CC BY 4.0 license.