Hi my name is Javier Taylor and I am working on a program that will take 1 mod 3 and 2 mod 3 mumbers backward in the Collatz conjecture. The problem is that I can't figure how to do two different operation under a while loop. So while the input is not 0 mod 3 I want the program to check th eremajndef mod3. If it is 1 then multiply by 4, subtract 1 and divide the difference by 3. If number is 2 mod 3 the multiply by 2, subtract 1 and divide by 3. When the sequence reaches a 0 mod 3 then end program and display list of odd numbers in sequence.
|
We're glad you came by, but you might find what you're looking for elsewhere. TI-Basic Developer is not the site it once was. While its information on commands and other calculator features remains almost second-to-none, its forum, archives, and even hosting service, Wikidot, have been decaying for years. The calculator community would love to see what you're working on, or help you in your next coding adventure, but TI-Basic Developer is no longer the place to do it. Instead, you should head over to Cemetech (primarily American) or TI-Planet (primarily international). Both are active, well-established forums with their own archives, chatrooms, reference material, and abundant coding tools and resources. We'll see you there, we hope. |