(12C Platinum) 3n+1 Conjecture
|
12-25-2018, 11:55 AM
(This post was last modified: 12-25-2018 12:51 PM by Gamo.)
Post: #1
|
|||
|
|||
(12C Platinum) 3n+1 Conjecture
This program allows to test the 3n + 1 conjecture.
Consider an integer n. If it's even, divide it by 2 (n÷2) If it's odd, multiply by 3 and add 1 (3n + 1) No matter what value of n, the sequence will always reach 1. The question is: if we start with an arbitrary integer will we always reach 1? Nobody knows. -------------------------------------- Procedure: Positive Integer Number [R/S] display 1 [X<>Y] display Total Iterations [RCL] 1 display how many time is Odd [RCL] 2 display how many time is Even -------------------------------------- Example: Desire Positive Integer Number is 7 7 [R/S] display 1 [X<>Y] display 16 // Total Iterations [RCL] 1 display 5 // Odd [RCL] 2 display 11 // Even ------------------------------------- Program: FIX 0 (ALG Mode) 38 steps Code:
***Let's try this on a much faster 12C Platinum Emulator.*** [EEX] 99 [R/S] display 1 [X<>Y] display 567 RCL 1 display 92 RCL 2 display 475 That 92 odds VS 475 even numbers !!! Gamo |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
(12C Platinum) 3n+1 Conjecture - Gamo - 12-25-2018 11:55 AM
RE: (12C Platinum) 3n+1 Conjecture - Gamo - 12-27-2018, 07:04 AM
RE: (12C Platinum) 3n+1 Conjecture - Nihotte(lma) - 04-05-2020, 04:04 PM
RE: (12C Platinum) 3n+1 Conjecture - Gamo - 04-06-2020, 01:57 AM
|
User(s) browsing this thread: 1 Guest(s)