Page 2 of 11

Lesson 25 Handout – Strong Induction examples

Theorem NT 5.1: Every natural number n>1 is either prime or divisible by a prime.

Theorem NT 5.2: Suppose p is prime and a1,a2,a3,…,an are n integers, where nβ‰₯2. If p∣a1β‹…a2β‹…a3⋅…⋅an, then p∣ai for at least one of the ai(1≀i≀n).

Theorem NT 5.3: If n is an integer greater than 1 then n can be written as a product of primes.
(HINT: Prove using strong induction. Consider two cases, when k+1 is prime, and when it is composite)

Office hours cancelled this Thursday – will reschedule on request

Hi everyone,

I’ll be guest lecturing in another class this Thursday, 11/19, directly before our class, so I won’t be able to hold office hours at the usual time. I do have office hours on Tuesday, 11/17, 3-4pm as usual, and I will be spending some of the time in class on Tuesday answering questions about Exam #3. If you’d like to schedule additional time to meet with me this week prior to the exam on Thursday, please send me an email!

Best,

Prof. Reitz

Β« Older posts Newer posts Β»

Β© 2025 Proofs | Reitz | Fa20

Theme by Anders Noren β€” Up ↑