intsu011h2

# intsu011h2 - Introductory Number Theory Homework#2 All...

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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Introductory Number Theory. Homework #2 All numbers are integers. 1. The Fibonacci sequence { F n } is defined recursively as follows: F 1 = 1, F 2 = 1, and then F n = F n − 1 + F n − 2 if n ≥ 3. Prove: gcd( F n , F n − 1 ) = 1for all n ∈ N . Use induction! 2. Prime power factorization. One way of emphasizing the uniqueness of the prime factorization of a number n ≥ 0 is to order the primes by size, group equals together as powers. One obtains the following theorem. Theorem. (Prime power factorization). Every natural number n ≥ 2 can be written uniquely in the form n = p e 1 1 ··· p e r r , where p 1 , . . . , p r are primes such that 2 ≤ p 1 < ··· < p r and e 1 , . . . , e r are positive integers. Uniqueness here means that if one also has n = q f 1 1 ··· q f s s , where q 1 , . . . , q s are primes such that 2 ≤ q 1 < ··· < q s and f 1 , . . . , f s are positive integers, then r = s ; p i = q i for i = 1 , . . . , r ; e i = f i for i = 1 , . . . , r....
View Full Document

{[ snackBarMessage ]}

### Page1 / 2

intsu011h2 - Introductory Number Theory Homework#2 All...

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

View Full Document
Ask a homework question - tutors are online