Strong induction example from discrete math book looks like ordinary
Discrete Math Strong Induction. Web bob was beginning to understand proofs by induction, so he tried to prove that \(f(n)=2n+1\) for all \(n \geq 1\). Web since $s(r)$ is assumed to be true, $r$ is a product of primes [note:
This is where it is imperative that we use strong. Web bob was beginning to understand proofs by induction, so he tried to prove that \(f(n)=2n+1\) for all \(n \geq 1\). Web since $s(r)$ is assumed to be true, $r$ is a product of primes [note:
Web bob was beginning to understand proofs by induction, so he tried to prove that \(f(n)=2n+1\) for all \(n \geq 1\). Web since $s(r)$ is assumed to be true, $r$ is a product of primes [note: This is where it is imperative that we use strong. Web bob was beginning to understand proofs by induction, so he tried to prove that \(f(n)=2n+1\) for all \(n \geq 1\).
