Difference between revisions of "Talk:Collatz Problem"
(New page: 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 tr...) |
Wizlearner (talk | contribs) m (→Cauchy induction) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
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. --[[User:1=2|1=2]] 23:58, 17 September 2008 (UTC) | 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. --[[User:1=2|1=2]] 23:58, 17 September 2008 (UTC) | ||
| + | |||
| + | == Cauchy induction == | ||
| + | |||
| + | Sutanay please expound Collatz problem | ||
Latest revision as of 06: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
