Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Discrete Math - 5.2.1 The Well-Ordering Principle and Strong Induction
Play lesson

Discrete Math I (Entire Course) - Discrete Math - 5.2.1 The Well-Ordering Principle and Strong Induction

Unlock the Logic: Master Discrete Math with Kimberly Brehm – From Propositions to Graphs, Equip Yourself with Essential Problem-Solving Skills!

5.0 (2)
18 learners

What you'll learn

Understand and apply logical operations and connectives in propositions.
Construct truth tables to evaluate compound statements and logical equivalences.
Translate complex logic statements into predicate logic with quantifiers.
Utilize set theory and functions in solving mathematical and real-world problems.

This course includes

  • 18.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Full Transcript

In this video we introduce the well-ordering principle and look and one proof by strong induction. Video Chapters: Introduction 0:00 The Well-Ordering Principle 0:10 Postage Stamp Example Using Induction 2:11 Postage Stamp Example Using Strong Induction 7:01 Up Next 9:35 Textbook: Rosen, Discrete Mathematics and Its Applications, 7e Playlist: https://www.youtube.com/playlist?list=PLl-gb0E4MII28GykmtuBXNUNoej-vY5Rz

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere