severalgos/3np1 mod problem C++
June 21, 2020
|
Module lib_3np1_mod (February 29, 2016)
The C++ program prog_3np1_mod check the dynamic of 3n+1 function in a modulo arithmetic.
Results:
---------- Null and odd exceptions with modulo = 2^8 = 255 + 1 for T function ---------- 0 -> 0 85 -> 0 227 -> 85
---------- Null and odd exceptions with modulo = 2^16 = 65535 + 1 for T function ---------- 0 -> 0 14563 -> 21845 -> 0 19417 -> 29126 -> 14563 21845 -> 0 53399 -> 14563 56635 -> 19417
---------- Null and odd exceptions with modulo = 2^24 = 16777215 + 1 for T function ---------- 0 -> 0 5592405 -> 0 9320675 -> 5592405
---------- Null and odd exceptions with modulo = 2^32 = 4294967295 + 1 for T function ---------- 0 -> 0 1431655765 -> 0 3817748707 -> 1431655765
See
Piece of severalgos. https://bitbucket.org/OPiMedia/severalgos
GPLv3 — Copyright (C) 2015, 2016 Olivier Pirson http://www.opimedia.be/