Spr10_test1_soln

Spr10_test1_soln - Name: Prasad Tetali Math 4150...

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

View Full Document Right Arrow Icon
Prasad Tetali Math 4150 – Introduction to Number Theory Spring 2010 Test # 1 You have 50 minutes to take this test. There are 52 total points possible. Simple calculators are fine, but no programmable calculators are allowed. Please write your answers neatly and show all of your work. Feel free to write on both sides of each sheet. 1. (4+6=10 points) a. State Fermat’s Little Theorem. Soln . For p : prime and a : an arbitrary integer, a p a (mod p ). Or for p prime, and a such that ( a,p ) = 1, a p - 1 1 (mod p ). b. Let p and q be distinct primes. Let b be a positive integer so that GCD( b,pq ) = 1. Then explain why the following is true. b ( p - 1)( q - 1) 1 (mod pq) . Soln . One way to show this is to appeal to Euler’s theorem: for n and a positive integers so that ( a,n ) = 1, we have a φ ( n ) 1 (mod n ). Since φ ( pq ) = φ ( p ) φ ( q ) = ( p - 1)( q - 1), we are done. Alternately, we could use Fermat’s little theorem on primes p and q and note that b ( p - 1)( q - 1) ± b p - 1 ² q - 1 1( mod p ) , b ( p - 1)( q - 1) ± b q - 1 ² p - 1 1( mod
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 02/18/2010 for the course MATH 4150 taught by Professor Prasadtetali during the Spring '10 term at Georgia Tech.

Page1 / 3

Spr10_test1_soln - Name: Prasad Tetali Math 4150...

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