Intro to Proofs - Discrete Math Structures 3

preview_player
Показать описание
In this video, I discuss some of the basics of mathematical proofs. This ties together the topics of the last two videos, applying them to direct proofs, proofs by contraposition, and proofs by contradiction, As a bonus, I included a proof by construction.
  1. Mark's Education Tutorials
  2. Discrete Mathematics
  3. Structure (Field Of Study)
  4. Mathematics (Field Of Study)
  5. Mathematical Proof
  6. computer science
Рекомендации по теме
Discrete Math Proofs 0:22:09

Discrete Math Proofs in 22 Minutes (5 Types, 9 Examples)

❖ Four Basic 0:22:38

❖ Four Basic Proof Techniques Used in Mathematics ❖

DIRECT PROOFS - 0:07:24

DIRECT PROOFS - DISCRETE MATHEMATICS

Discrete Math - 0:09:44

Discrete Math - 1.7.1 Direct Proof

Proof by Contradiction 0:09:00

Proof by Contradiction | Method & First Example

Discrete Structures: Introduction 0:44:57

Discrete Structures: Introduction to Proofs Part 1 of 2 (Rules of Inference)

Discrete |16| Direct 0:13:08

Discrete |16| Direct Proof

Intro to Proofs 0:11:38

Intro to Proofs - Discrete Math Structures 3

Introduction and Proofs 0:15:49

Introduction and Proofs (Discrete 01)

Converse, Inverse, & 0:11:54

Converse, Inverse, & Contrapositive - Conditional & Biconditional Statements, Logic, Geometr...

Proof by induction 0:09:23

Proof by induction | Sequences, series and induction | Precalculus | Khan Academy

How to do 0:16:30

How to do a PROOF in SET THEORY - Discrete Mathematics

Intro to Discrete 0:05:59

Intro to Discrete Math - Welcome to the Course!

INTRODUCTION to PROPOSITIONAL 0:11:02

INTRODUCTION to PROPOSITIONAL LOGIC - DISCRETE MATHEMATICS

Discrete Math II 0:13:01

Discrete Math II - 5.1.1 Proof by Mathematical Induction

What does a 0:05:45

What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence

Methods of Proof 0:19:40

Methods of Proof || Discrete Structures in Urdu/hindi

Discrete Structures: Introduction 0:39:21

Discrete Structures: Introduction to Proofs Part 2 of 2 (Direct Proofs)

Introduction to Logic 0:08:39

Introduction to Logic - Logic - Discrete Mathematics

Introduction to Proofs 0:41:59

Introduction to Proofs (Discrete Math)

Mathematical Induction Practice 0:18:08

Mathematical Induction Practice Problems

Introductory Discrete Mathematics 0:00:19

Introductory Discrete Mathematics by V.K. Balakrishnan

MATHEMATICAL INDUCTION - 0:13:54

MATHEMATICAL INDUCTION - DISCRETE MATHEMATICS

Introduction to Proof 0:10:37

Introduction to Proof by Induction [Discrete Math Class]

Комментарии
Автор

hi i have a question about the rules of inference (addition) - if you add q to p, then it is no longer p, therefore, it cannot be held to the same "truth" that p was originally held to? i guess i would just like to see an example of this working so i can understand where im misunderstanding ?

daa
Автор

Hi, I think your proof of infinite primes is wrong. Just because p! + 1 is indivisible by any integer p or less, doesn't mean that it is indivisible by the integers between p and p! + 1. For example take the prime 5. 5! + 1 = 121, which is not prime, it is divisible by 11.

christophersiewert
Автор

great, do you reccomend a good book for that

johnbake