3_NumberTheory

3_NumberTheory - Examples Mersenne primes have the form...

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

View Full Document Right Arrow Icon
Primes 9/1/11 Theorem 1. Fundamental Theorem of Arithmetic Every positive integer greater than 1 can be written uniquely as a prime or as a product of two or more primes written in the order of nondecreasing size. Examples Definition : Let P be a positive integer greater than 1. p is a prime number if the only positive factors of p are 1 and p. p is a composite number if it has a positive factor other than 1 and itself.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Theorem 2. Theorems 3&4.
Background image of page 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Examples Mersenne primes have the form Greatest Common Divisor (GCD) Definition : Example Definition : Least Common Multiple (LCM) Example: Example: Theorem 5 . Let a and b be positive integers. Then ab = gcd(a,b)*lcm(a,b). Euclidean Algorithm Proof of Euclidean Algorithm Theorem 6 Lemma 3 Section 4.3, Problem 15' . Find all primes <= 30. Problem 15 . Find all positive integers that are < 30 and relatively prime to 30....
View Full Document

Page1 / 8

3_NumberTheory - Examples Mersenne primes have the form...

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

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