AoPSWiki
Preparing for MATHCOUNTS or the AMC contests, and having a tough time with number theory problems? Read Art of Problem Solving's Introduction to Number Theory by Mathew Crawford.
Personal tools

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)

Do you have what it takes to be the next brilliant trader, researcher, or developer at Jane Street Capital? Find out in the Careers in Mathematics Forum.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us