The powers of a function f: A → A are defined recursively by
Define g: N → N by
This function is known as the “3m + 1” function. It is suspected that for any starting number m the sequence g(m), g2(m),g3(m),… eventually terminates with 1.
Verify this assertion for each of the five integers m = 341, 96, 104, 336, and 133.4
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.