This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Exam I Review Sheet Math 4023 The flrst exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class web site. In the following lists, pages and results on the number theory handout will be referred by preceding the number with H. Following are some of the concepts and results you should know: The cardinality of X , denoted j X j , is the number of elements of X . Some formulas for the cardinality of combinations of sets X and Y : 1. j X [ Y j = j X j + j Y j j X \ Y j . 2. j X Y j = j X jj Y j . 3. jP ( X ) j = 2 j X j where P ( X ) denotes the power set of X , that is, P ( X ) is the set of all subsets of X . 4. jf all functions f : X ! Y gj = j Y j j X j . The number of ways to choose r elements (without replacement) from an nelement set is n r = n ! r !( n r )! : Know the Division Algorithm . Know the deflnition of a divides b for integers a and b (notation: a j b ). Know the deflnition of the greatest common divisor of the integers a and b (notation: gcd( a; b )). Know the Euclidean Algorithm and how to use it to compute the greatest common divisor of integers a and b . Know how to use elementary row operations to codify the calculations needed for the Eu clidean algorithm into a sequence of matrix operations as done in class and illustrated on Pages H.11 and H.12. Know the deflnition of relatively prime integers . Know the deflnition of least common multiple of integers a and b (notation: [ a; b ]). Know the deflnition of prime number. Know what it means for an integer a to be congruent modulo n to another integer b (notation a b mod n ). Know the deflnition of congruence class of a modulo n (notation [ a ] n ). Know the deflnition of the number system Z n , and how to do arithmetic in Z n : [ a ] n + [ b ] n = [ a + b ] n [ a ] n [ b ] n = [ ab ] n Know the deflnition of [ a ] n is invertible in Z n , and know the criterion of invertibility of [ a ] n : An element [ a ] n 2 Z n is invertible (or has a multiplicative inverse) if and only if gcd( a; n ) = 1, that is, if and only if a and n are relatively prime. Moreover, if r and s are integers such that ar + ns = 1, then [ a ] 1 n = [ r ] n . (Theorem 0.2.8 (text) and Proposition H.1.4.5, Page H.38.) 1 Exam I Review Sheet Math 4023 Know how to use the Euclidean algorithm to compute [...
View
Full
Document
This document was uploaded on 12/28/2011.
 Fall '09

Click to edit the document details