This preview shows page 1. Sign up to view the full content.
Unformatted text preview: us. For example, in part a, we are allowed to factor out 3
because gcd(3,10) = 1. Part b does not work because gcd(6,10) = 2, not 1.
2. Given some integer x, how many of the numbers from 0, 1, 2,… , m –1 are
congruent to x (mod m)? There is only one! By calculating x (mod m), you ensure that the result will be a
unique number between 0 and (m-1).
Don’t confuse x (mod m) with an expression asking for the number of values that
map to the same number (mod m), which is infinite, as many of you...
View Full Document
- Fall '08