Factors and multiples: Euclid's algorithm

Advanced Math 7 · Unit 1 · euclid-gcd

euclid-gcd
Name ______________________________Date ______________
  1. 1.

    Write 360360 in index notation as 2a3b5c2^a \cdot 3^b \cdot 5^c. What is a+b+ca + b + c?

    Answer: ______________

  2. 2.

    Use Euclid's algorithm to find gcd(252,198)\gcd(252, 198), then use lcm(a,b)=abgcd(a,b)\operatorname{lcm}(a,b) = \dfrac{ab}{\gcd(a,b)}. Enter lcm(252,198)\operatorname{lcm}(252, 198).

    Answer: ______________

  3. 3.

    A rectangular patio measures 360360 cm by 252252 cm. It is to be covered exactly with identical square tiles, as large as possible, with no cutting. How many tiles are needed?

    Answer: ______________

  4. 4.

    Running Euclid's algorithm on 10711071 and 462462 gives these lines:

    1071=2×462+147,462=3×147+21,147=7×21+0.1071 = 2 \times 462 + 147,\qquad 462 = 3 \times 147 + 21,\qquad 147 = 7 \times 21 + 0.

    What is gcd(1071,462)\gcd(1071, 462)?

    1. (A)

      33

    2. (B)

      77

    3. (C)

      2121

    4. (D)

      147147

  5. 5.

    Two positive integers have a product of 10801080 and a greatest common factor of 66. What is their least common multiple?

    1. (A)

      66

    2. (B)

      3636

    3. (C)

      180180

    4. (D)

      216216

    5. (E)

      10801080