This preview shows pages 1–11. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Number Theory The Division Algorithm The next result, the Division Algorithm, is a cornerstone of Number Theory. MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 15 Number Theory The Division Algorithm The next result, the Division Algorithm, is a cornerstone of Number Theory. As an example, consider the statement 23 = 3 7 + 2. MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 15 Number Theory The Division Algorithm The next result, the Division Algorithm, is a cornerstone of Number Theory. As an example, consider the statement 23 = 3 7 + 2. One way of reading this is: when 23 is divided by 7, the quotient is 3 and the remainder is 2. MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 15 Number Theory The Division Algorithm The next result, the Division Algorithm, is a cornerstone of Number Theory. As an example, consider the statement 23 = 3 7 + 2. One way of reading this is: when 23 is divided by 7, the quotient is 3 and the remainder is 2. Theorem ( The Division Algorithm ) Given integers a and b with b > , there exist unique integers q and r such that a = qb + r r < b q is called the quotient and r is called the remainder in the division of a by b. MAT 300 Awtrey MATHEMATICS AND STATISTICS 1 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . MAT 300 Awtrey MATHEMATICS AND STATISTICS 2 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . Since b > 0 is an integer, b 1. So the set S is nonempty since a ( j a j ) b a + j a j 0. MAT 300 Awtrey MATHEMATICS AND STATISTICS 2 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . Since b > 0 is an integer, b 1. So the set S is nonempty since a ( j a j ) b a + j a j 0. Thus S is a nonempty subset of N . MAT 300 Awtrey MATHEMATICS AND STATISTICS 2 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . Since b > 0 is an integer, b 1. So the set S is nonempty since a ( j a j ) b a + j a j 0. Thus S is a nonempty subset of N . By the WellOrdering Principle S has a least element, call it r 0. MAT 300 Awtrey MATHEMATICS AND STATISTICS 2 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . Since b > 0 is an integer, b 1. So the set S is nonempty since a ( j a j ) b a + j a j 0. Thus S is a nonempty subset of N . By the WellOrdering Principle S has a least element, call it r 0. By definition of S , this means there exists an integer q such that r = a qb 0. MAT 300 Awtrey MATHEMATICS AND STATISTICS 2 / 15 Number Theory Proof of the Division Algorithm Consider the set S = f a xb : x is an integer and a xb g . Since b > 0 is an integer, b 1. So the set S is nonempty since a ( j a j ) b a + j a j 0....
View
Full
Document
This note was uploaded on 02/22/2011 for the course MAT 300 taught by Professor Thieme during the Spring '07 term at ASU.
 Spring '07
 thieme
 Math, Statistics, Number Theory, Division

Click to edit the document details