Difference between revisions of "Talk:Collatz Problem"
Wizlearner (talk | contribs) (→Cauchy induction: new section) |
Wizlearner (talk | contribs) m (→Cauchy induction) |
||
| Line 3: | Line 3: | ||
== Cauchy induction == | == Cauchy induction == | ||
| − | Sutanay please expound | + | Sutanay please expound Collatz problem |
Latest revision as of 07:31, 27 July 2018
From Cauchy Induction, f(1) and f(2) both have a 1 in there somewhere, and we can easily prove that if it's true for n, then it's true for 2n. Now we just need to prove that if it's true for n, it's true for n-1. --1=2 23:58, 17 September 2008 (UTC)
Cauchy induction
Sutanay please expound Collatz problem
