6120a Discrete Mathematics And Proof For Computer Science Fix Jun 2026

Claim : ∀n ∈ ℕ, n ≥ 1 → P(n) Proof (by simple induction on n) : n = 1: … Inductive hypothesis : Assume P(k) for some arbitrary k ≥ 1. Inductive step : Show P(k+1) using the hypothesis. ∎

Discrete mathematics forms the logical backbone of computer science. Unlike continuous math (calculus), discrete math deals with distinct, separated values — integers, graphs, statements, sets. Course typically emphasizes: Claim : ∀n ∈ ℕ, n ≥ 1