Discrete Mathematics and Proof · Chapter 8 · Lesson 8.4 · Printable PDF

The Euclidean Algorithm and Coprime Numbers Worksheet with Answer Key

6 problems on the euclidean algorithm and coprime numbers. 2 pages, with a worked answer key.

6 problems2 pagesanswer key
Printable The Euclidean algorithm and coprime numbers worksheet with answer key - Discrete Mathematics and Proof (Page 1 PDF preview)
Page 1 of 2

Get this sheet

This sheetWorksheet and answer key, yours to keep.
$5
Buy
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
Subscribe
Full Course Set470+ Discrete Mathematics and Proof PDF files, no limit, yours to keep.
$400once
Buy

Try one first: a free Chapter 1 worksheet (PDF, no sign-in).

The full Discrete Mathematics and Proof courseEvery lesson in teaching order, with over 470 printables.See the course ›

What's on the worksheet

  1. Find each greatest common divisor with the Euclidean algorithm.
    \gcd(1147, 899)\gcd(2002, 1547)\gcd(611, 425)\gcd(-1728, 1080)
  2. Priya has three rolls of fabric, 1764, 2520 and 3150 centimeters long.
  3. Malik packs 1194 pencils into boxes that each hold n pencils, filling as many boxes as he can, and 5 pencils are left over.
  4. Before division with remainder was common, the algorithm was run by subtraction alone:
  5. Decide whether each statement is true for all positive integers a, b and c.
  6. The Fibonacci numbers are F_1 = 1, F_2 = 1 and F_k+1 = F_k + F_k-1 for every integer k ≥ 2, so the list starts 1, 1, 2, 3, 5, 8, 13, … Every F_k is…

Teach it first

The free lesson teaches it with worked examples and practice problems.

The Euclidean algorithm and coprime numbers: the lesson ›