Join Peggy Fisher for an in-depth discussion in this video Write a general outline for a proof, part of Foundations of Programming: Discrete Mathematics.
- View Offline
- Exercise Files
- A theorem is a statement that can be proven true or false.…A proof consists of a series of steps,…each of which follows logically from assumptions…or from previously proven statements…whose final step should result in a statement…of the theorem being proven.…Axioms are statements assumed to be true,…or previously proven theorems.…An example is the definition of even and odd integers.…An even integer is any integer…that can be represented by two times x,…where x is also an integer.…
10 is two times five,…200 is two times 100, etcetera.…An odd number is represented by any number…such that it can be written as two times x plus one.…So 11 is two times five, plus one.…Proofs fall into two categories, direct and indirect proofs.…With an indirect proof, instead of proving…that the conclusion is true, you start by assuming…that the opposite is true.…
Then, using deductive reasoning…to lead to a contradiction, you can prove…the original hypotheses is true.…Proof by contradiction is another type of indirect proof,…and requires a counter-example.…
This course relies on an open-source SML (standard machine language) library to demo the concepts behind discrete math. Peggy Fisher shows you how to manipulate sets of data, write proofs and truth tables, analyze data sequences, and visualize data using graph theory. Challenges at the end of every chapter allow you to test your knowledge. By the end of the course, you should be able to make the leap from theory to using discrete math in practice: saving time and resulting in code that's cleaner and easier to maintain in the long run.
- Real-world discrete math
- Objects as sets
- Set notation and operations
- Standard machine language (SML) setup
- Working with data types, strings, and functions in SML
- Analyzing data sequences
- Writing truth tables
- Identifying and evaluating predicates
- Validating arguments
- Writing proofs: subset, conditional, and biconditional proofs
- Visualizing data with graphs
- Advanced discrete math techniques
Skill Level Intermediate
Foundations of Programming: Design Patternswith Elisabeth Robson2h 19m Intermediate
1. Discrete Math Uses
3. Setting Up SML
4. Analyzing Data Sequences
5. Effective Arguments and Defensible Decisions
6. Proofs Made Easy
7. Advanced Discrete Math Topics
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.Cancel
Take notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.