1. Part II – Theory and Computations

2. Major Ideas....

4. Fundamental Theorem of Arithmetic (Prime Factorization Theorem) Each natural number n can be written as a product of prime numbers in one and only one way (except for the order of the factors).

7. THEOREM: If n > 2 is a composite number, then n has a prime divisor p such that CORLLARY: If n > 2 has no prime divisors p such that, then n is a prime number. APPLICATION: To test whether a number n is a prime you only have to check whether n is divisible by the primes

8. The numbers 2, 3, 5 and 7 determine primes < 100 5

9. The primes above determine all primes < 10,000 5 5

10. Counting Factors... How can we count the factors of a number? For example: How many factors does 180 have?

11. Counting Factors...

17. Proofs.... (The ones that can be explained to interested students.) Infinitely many primes, determining whether a number is prime, and divisibility by 3.

45. Another Look... (with a possibility for generalization)

46. Can you see what is happening in the following slide? In particular, what are the blue numbers?

48. The blue numbers are the remainders from dividing 1, 10, 100, 1000, 10000, etc. by 3

49. Can you see what is happening in the following slide? In particular, what are the blue numbers?

50. Notice the repetition!!

51. The blue numbers are the remainders from dividing 1, 10, 100, 1000, 10000, etc. by 7

52. Can you state a give a conjecture concerning divisibility by 7?

53. 1, 3, 2, 6, 4, 5, 1, 3, 2, 6, 4, 5,...

54. Can you find the pattern for divisibility by 11?

55. Answer: 1,10,1,10,1,10,...

56. Computations...

68. Most calculators and computers use the Euclidean algorithm.

69. iPart, gcd and lcm – TI-83 commands PCHECK – (program) determines whether a number is prime. PFACT – (program) gives the prime factorization of a number. TI-83 Programs...