ULAM  Using Ulam's Conjecture to determine the number of steps it takes to reduce an integer N to 1 using the following rules:
If N is odd: N = 3×N+1
If N is even: N=N/2
9/24/2013
Program:
EXPORT ULAM(N)
BEGIN
LOCAL C;
PRINT();
REPEAT
IF FP(N/2)==0 THEN
N:=N/2;
ELSE
N:=3*N+1;
END;
C:=C+1;
PRINT(N);
UNTIL N==1;
RETURN C;
END;
Examples:
ULAM(69): 208, 104, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1 (14 steps)
ULAM(84): 42, 21, 64, 32, 16, 8, 4, 2, 1 (9 steps)
This blog is property of Edward Shore. 2013
A blog is that is all about mathematics and calculators, two of my passions in life.
Wednesday, October 2, 2013
HP Prime Program: ULAM
Subscribe to:
Post Comments (Atom)
Retro Review: Radio Shack EC2024
Retro Review: Radio Shack EC2024 Quick Facts Company: Radio Shack Years in Production: Around 1994 Original Price: $24.99 Bat...

Casio fx991EX Classwiz Review Casio FX991EX The next incarnation of the fx991 line of Casio calculators is the fx991 EX. ...

The Odds of Hitting it Big The number of possible combinations is fairly easy to calculate. You multiply the number symbols each slot has ...

HP Prime: Basic CAS Commands for Polynomials and Rational Expressions Define the following variables: poly: a polynomial o...
No comments:
Post a Comment