Discrete Structures Lecture 3 Segment

Media Summary: Proof technique: Universal generalization 00:00 Definition: arbitrary element of the domain 01:13 Proof of theorem in previous ... Proof by cases: A variation based on the logical equivalence between (P_1 OR P_2 OR ... OR P_n) → Q and (P_1 → Q) AND ... 0:00 Basic terminology: index of summation, lower limit, upper limit

Discrete Structures Lecture 3 Segment - Detailed Analysis & Overview

Proof technique: Universal generalization 00:00 Definition: arbitrary element of the domain 01:13 Proof of theorem in previous ... Proof by cases: A variation based on the logical equivalence between (P_1 OR P_2 OR ... OR P_n) → Q and (P_1 → Q) AND ... 0:00 Basic terminology: index of summation, lower limit, upper limit Formal proofs in propositional logic 0:00 First argument 2:21 Informal definition of a proof 4:07 Proof of the first argument 9:01 ... 0:00 Logical consequence in predicate logic 1:04 Proof by counter-example 5:52 Another proof by counter-example 8:06 Informal ... 10 practice problems in basic set theory.

LHRRCC: Linear recurrence relation with constant coefficients Definition, examples, counter-examples. Binary search algorithm 0:00 Binary search algorithm to solve the same problem as before but with a sorted sequence 5:37 ... Combinations, r-combinations from a set of size n, C(n,r) or "n choose r" Proving: C(n,r) = C(n,n-r)