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

Bezout's Identity and the Extended Euclidean Algorithm Worksheet with Answer Key

6 problems on bezout's identity and the extended euclidean algorithm. 3 pages, with a worked answer key.

6 problems3 pagesanswer key
Printable Bezout's identity and the extended Euclidean algorithm worksheet with answer key - Discrete Mathematics and Proof (Page 1 PDF preview)
Page 1 of 3

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 and write it as an integer combination of the two numbers, by back substitution or by the table form.
    \gcd(1073, 851)\gcd(546, 399)\gcd(97, 61)
  2. Hiro ran the table form on a = 1001 and b = 221, meaning to keep the promise r = 1001x + 221y in every row.
  3. Elena is inventing a calendar for a story world.
  4. Find every point (x, y) with integer coordinates on the line 15x - 21y = 33 that lies in the square -10 ≤ x ≤ 10, -10 ≤ y ≤ 10.
  5. Decide whether each statement is true for every integer n.
  6. Let a and b be integers with b ≥ 1 and (a, b) = 1.

Teach it first

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

Bezout's identity and the extended Euclidean algorithm: the lesson ›