JB : Program certainly equivalent to the one used in arXiv:2107.11160v4

Author : Jacques BALLASI

Program certainly equivalent to the one used in arXiv:2107.11160v4 "Is the Syracuse falling time bounded by 12?"
Authors : Shalom Eliahou, Jean Fromentin and Rénald Simonetto

License CC BY-NC-ND 4.0 : https://creativecommons.org/licenses/by-nc-nd/4.0/

Before doing intensive computations, you can download the proof of the Syracuse conjecture on https://www.bajaxe.com and get also more details

Value of N =
Value of L =
Try up to 2^N
Try up to 2^N

(about 40 minutes with N = 33 on my own computer)
(N must be greater than 48 and ideally 50 and the computations will take a very long time)

Try up to 2^N
Try for n up to L
Try for n up to L

Used for the answers of these conjectures
Try
Try for Ceil(N)