This preview shows page 1. Sign up to view the full content.
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 (Euclids Theorem). This shows that r must be an integer. 1...
View Full Document
This note was uploaded on 01/18/2012 for the course INFORMATIK 2011 taught by Professor Phanthuongcang during the Winter '11 term at Cornell University (Engineering School).
- Winter '11