Quiz 7 in Math 201 - Fall '02 for Elem. Ed. Math I, Exercises of Elementary Mathematics

The second section of quiz 7 for math 201 - fall '02, which is a part of the elem. Ed. Math i course. The quiz includes three problems: finding the greatest common divisor (g.c.d.) of 8532 and 3876 using the euclidean algorithm, determining the least common multiple (l.c.m.) of 12 and 20 by listing their multiples, and performing arithmetic operations modulo 8. Suitable for students enrolled in the math 201 course or those preparing for similar exams.

Typology: Exercises

2012/2013

Uploaded on 03/31/2013

pareeneta
pareeneta 🇮🇳

4

(8)

92 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Prof. S. Brick Math 201
Fall ’02 Elem. Ed. Math I; Quiz 7 section 2
0. Print your name:
1. Use the Euclidean algorithm to find the g.c.d. of 8532 and 3876. Show your steps.
2. Find the l.c.m. of 12 and 20. Show it using lists of multiples.
3. Working modulo 8, compute 7 + 4 + 6 + 3 and 3 ·7. Explain your steps.

Partial preview of the text

Download Quiz 7 in Math 201 - Fall '02 for Elem. Ed. Math I and more Exercises Elementary Mathematics in PDF only on Docsity!

Prof. S. Brick Math 201

Fall ’02 Elem. Ed. Math I; Quiz 7 section 2

  1. Print your name:
  2. Use the Euclidean algorithm to find the g.c.d. of 8532 and 3876. Show your steps.
  3. Find the l.c.m. of 12 and 20. Show it using lists of multiples.
  4. Working modulo 8, compute 7 + 4 + 6 + 3 and 3 · 7. Explain your steps.