This preview shows page 1. Sign up to view the full content.
Unformatted text preview: What can you say about whether the other one is prime? (C) Use Pollards algorithm, with f ( x ) = x 2 + 2, and starting value y = z = 6, to factor 17741. (D) (i) Prove that 2 n + 1 is a pseudoprime to the base 2 if and only if n is a power of 2, and deduce that if 2 n + 1 is prime, then n must be a power of 2. (ii) Verify that 2 1 + 1, 2 2 + 1, 2 4 + 1, 2 8 + 1, and 2 16 + 1 are prime, but that 641 is a factor of 2 32 + 1. Reminder: The rst midterm exam is Friday, Oct. 3. The exam will cover the material on homework assignments 1 through 4....
View Full
Document
 Fall '08
 STRAIN
 Math, Factoring

Click to edit the document details