Computer Science 70 - Fall 2000 - Russell - Midterm 2

Computer Science 70 - Fall 2000 - Russell - Midterm 2 - CS...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 70, Midterm #2, Fall 2000 CS 70, Fall 2000 Midterm 2 Papadimtriou/Russell/Sinclair Problem #1 (20 pts.) Extended GCD For each of the following equations, find a pair of integers x and y that satisfies that equation or prove that no such pair exists. [ Note : these are not simultaneous equations.] (a) (5 pts) 13 x + 21 y = 1 (b) (5 pts) 13 x + 21 y = 2 (c) (5 pts) 33 x + 21 y = 1 (d) (5 pts) 33 x + 21 y = 3 Problem #2 (20+5 pts.) Perfect Squares Let p be a prime greater than 2. An integer y is called a perfect square modulo p if y = x ² mod p for some integer x ; x is called a square root of y modulo p . (a) (6 pts) Which among the integers 0,1,. ..,10 are perfect squares modulo 11? (b) (8 pts) Prove rigorously that each integer y , where 0 < y < p , has either zero or two square roots modulo p . [ Hint : Suppose w and x are square roots of y ; what can you deduce about the relationship between them?] (c) (6 pts) Using the result in (b), prove that there are exactly ( p +1)/2 perfect squares modulo
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/26/2009 for the course CS 70 taught by Professor Papadimitrou during the Fall '08 term at University of California, Berkeley.

Page1 / 3

Computer Science 70 - Fall 2000 - Russell - Midterm 2 - CS...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online