Unformatted text preview: q n p n + a n1 p n1 q + . . . + a 1 pq n1 + a q n = 0 Rewrite the equation q ± a n1 p n1 + . . . + a 1 pq n2 + a q n1 ² =p n Hence, q = 1 as otherwise any prime dividing q would also divide p (Euclid’s Theorem). This shows that r must be an integer. 1...
View
Full Document
 Winter '11
 PhanThuongCang
 Prime number, Jacek Nowacki, Homework Solutions HW3, an1 pn1

Click to edit the document details