This preview shows page 1. Sign up to view the full content.
Unformatted text preview: give a counterexample. 3. a. Prove that any number n so that n mod 4 = 3 has a prime factor p with p mod 4 = 3. b. Prove that there are inFnitely many primes p with p mod 4 = 3. 4. In your favorite programming language, write a program that takes no input and prints itself (its own code). Your program may not make system calls. 1...
View Full
Document
 Winter '12
 Edmonds

Click to edit the document details