WA 6 - Nicola Hodges David Walnut MATH 290-002 October...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Nicola Hodges David Walnut MATH 290-002 October 23 rd , 2010 Writing Assignment 6 1. Let a and b be natural numbers, and let d be the smallest natural number such that there exists integers x and y such that ax+by = d. Prove that d = GCD (a,b). (Hint: Letting c=GCD (a,b), first prove that c d by showing that c/d. Then show that d c by showing that d is a common divisor of a and b) Let a and b be natural numbers and d be the smallest natural number such that there exists integers x and y such that ax +by = d. We will show that d = GCD (a,b). Let c=GCD(a,b), so c divides a and c divides b and there is no other greater divisor. We will show c and d are equivalent. First show, c d. Since c divides a, there exists an integer l such that cl=a. Since c divides b, there exists an integer k such that ck=b Note, we assumed ax + by = d. Through substitution, ax + by = (cl)x + (ck)y = d So, c(lx + ky) = d. Since, lx+ky is an integer, c divides d. By definition, since c divides d, then c d. Next show, d c. Let a and b be natural numbers. Consider the set S of all positive integers of the form am+bn, where m and n are integers. S is nonempty and by the well ordering principle, there is a least
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/05/2011 for the course MATH 290 taught by Professor Alligood,k during the Fall '08 term at George Mason.

Page1 / 4

WA 6 - Nicola Hodges David Walnut MATH 290-002 October...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online