#proofstrategy — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #proofstrategy, aggregated by home.social.
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!
-
Alright, future engineers!
**Induction** proves a statement for all natural numbers: 1) Show base case (n=1). 2) Assume true for k. 3) Prove true for k+1. Ex: Sum of 1st N ints is N(N+1)/2. Pro-Tip: Your rigorous way to prove properties for *all* integers!