This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: n 2 â‰¡ 1 (mod 8). 5. Compute using the Euclidean algorithm: (a) GCD(1529, 14039) (b) GCD(1529, 14038) (c) GCD(1111111, 11111111) 6. Compute 10 785 (mod 23). Math 240 â€” Assignment 3 â€” Fall 2009 Marker: Gabriel Charette Instructor: Benjamin Young Date: Name: Student Number:...
View
Full Document
 Spring '08
 SZABO
 Integers, Natural number, Prime number, positive integer, odd positive integer, Gabriel Charette

Click to edit the document details