Unformatted text preview: q n p n + a n-1 p n-1 q + . . . + a 1 pq n-1 + a q n = 0 Rewrite the equation q ± a n-1 p n-1 + . . . + a 1 pq n-2 + a q n-1 ² =-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
- Prime number, Jacek Nowacki, Homework Solutions HW3, an-1 pn-1