Final-sp02 - 1[20 points Let a b c Z with(a b = 1 Prove(without assuming the Fundamental Theorem of Arithmetic that if a | c and b | c then ab | c

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

View Full Document Right Arrow Icon
1. [20 points] Let a , b , c Z with ( a,b ) = 1. Prove (without assuming the Fundamental Theorem of Arithmetic) that if a | c and b | c then ab | c . HINT : Since ( a,b ) = 1 there are integers x , y such that ax + by = 1. 2. [20 points] Let a , b , c Z and assume that a and b are not both zero and let d = ( a,b ). Prove that ax + by = c for some integers x and y if and only if d | c . HINT : Use the result that ( a,b ) = min { ma + nb : m,n Z ,ma + nb > 0 } . 3. [5 + 15 = 20 points] (i) Define pseudoprime . (ii) Prove that 161038 = (2)(73)(1103) is a pseudoprime. 4. [5 + 15 = 20 points] (i) State Euler’s Theorem. (ii) Let m , n be positive relatively prime integers. Prove that m φ ( n ) + n φ ( m ) 1 (mod mn ) . 5. [4 × 5 = 20 points] (i) Define what it means for an arithmetic function to be multiplicative . (ii) Prove that if f is a multiplicative function and f (1) = 0 then f ( n ) = 0 for all n . (iii) Prove that if
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 06/04/2011 for the course MAS 4202 taught by Professor Boyland during the Spring '10 term at University of Florida.

Page1 / 2

Final-sp02 - 1[20 points Let a b c Z with(a b = 1 Prove(without assuming the Fundamental Theorem of Arithmetic that if a | c and b | c then ab | c

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