Math 115 - Spring 1998 - Ribet - Midterm 1

Math 115 - Spring 1998 - Ribet - Midterm 1 - k ) (0 ≤ k...

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

View Full Document Right Arrow Icon
Math 115 Professor K. A. Ribet First Midterm Exam February 25, 1998 Instructions: Answer question #2 and three other questions. 1 (6 points) . Find all solutions to the congruence x 2 p mod p 2 when p is a prime number. 2 (9 points) . Using the equation 7 · 529 - 3 · 1234 = 1, find an integer x which satisfies the two congruences x n 123 mod 529 321 mod 1234 and an integer y such that 7 y 1 mod 1234. (No need to simplify.) 3 (7 points) . Suppose that p is a prime number. Which of the p + 2 numbers ( p + 1
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: k ) (0 ≤ k ≤ p + 1) are divisible by p ? [Example: The seven binomial coefficients ( 6 k ) are 1, 6, 15, 20, 15, 6, 1; the middle three are divisible by 5.] 4 (7 points) . Let p be a prime and let n be a non-negative integer. Suppose that a is an integer prime to p . Show that b := a p n satisfies b ≡ a mod p and b p-1 ≡ 1 mod p n +1 . 5 (6 points) . Show that n 4 + n 2 + 1 is composite for all n ≥ 2....
View Full Document

This note was uploaded on 10/31/2009 for the course STAT 131A taught by Professor Isber during the Spring '08 term at Berkeley.

Ask a homework question - tutors are online