Unformatted text preview: (6) Use Euclidean algorithm to ﬁnd (66 , 56). Extra Credit (to be written up and submitted separately) : We extend the notion of prime and composite numbers to negative integers as follows: An integer n diﬀerent from 0 , ± 1 is prime (respectively composite) if  n  is prime (respectively composite). Let f ( x ) be a nonconstant polynomial with integer coeﬃcients. Prove that there exists an integer x such that f ( x ) is composite. 1...
View
Full Document
 Spring '10
 Applebaugh
 Math, Natural Numbers, Prime number, congruent modulo

Click to edit the document details