781hw2 - ing or asking PARI via “isprime” why you think...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
18.781, Fall 2007 Problem Set 2 Due: FRIDAY, September 21 1. Complete the following problems from Niven-Zuckerman-Montgomery (henceforth NZM): NZM 2.1: 5, 9, 17, 25, 28, 46, 54, 55 NZM 2.2: 6, 8, 11, 12, 13 NZM 2.3: 7 2. CHOICE OF PARI PROGRAMS: Find a large integer that’s probably prime. That is, pick a rela- tively big integer (at least 15 digits) and explain (without factor-
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ing, or asking PARI via “isprime”) why you think it is probably prime. • Write a PARI program which tests for Carmichael numbers – those numbers N for which: a N-1 ≡ 1 (mod N ) for all a with gcd( a, N ) = 1 and find at least 3 of them....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online