AoPSWiki
Trying to get to the USAMO in 2010? Our AIME Problem Series can help you get there! Click here to enroll today!

Talk:Collatz Problem

From AoPSWiki

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)

Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us