4383_Notes_3o1_fill2

# 4383_Notes_3o1_fill2 - Math 4383 Section 3.1 Page 1 of 6...

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

Math 4383 Section 3.1 Page 1 of 6 Number Theory Section 3.1 The Fundamental Theorem of Arithmetic A prime is a positive integer p > 1 with the property that the only positive divisors of p and 1 and p itself. A positive integer > 1 is called composite if it is not prime. Smallest primes – 2, 3,5, 7, 11, 13, 17, 19, … Why primes? Answer: positive composite integer can be written as a product of prime integers, and the factoring is unique up to the order of the factors. Notice that none of the divisibility material we discussed in Chapter 2 needed the concept of a prime number, but to go further in number theory, primes are essential. Let’s start with the following basic consequences of the definition of a prime number: Theorem: If p is a prime number and p|ab, then either p|a or p|b. Proof:

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

View Full Document

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

View Full Document

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.

## This note was uploaded on 02/21/2012 for the course MATH 4383 taught by Professor Flagg during the Spring '09 term at University of Houston.

### Page1 / 6

4383_Notes_3o1_fill2 - Math 4383 Section 3.1 Page 1 of 6...

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

View Full Document
Ask a homework question - tutors are online