Joshua Branson

2018-11-07 15:14:06 UTC

Hello,

I spent a week or two working on the 3+1 problem. The 3+1 problem is a

fun number theory conjecture. It states that there exists a procedure

for turning all positive whole integers into 1. The procedure is:

If the number is even, then divide it by two.

If the number is odd, multiply by 3 and add 1.

repeat.

I decided to write a program to graph the number of iterations it takes

for the set of numbers 2-n to reach 1. It uses ice-9 getopt-long, so

the usual --help and --version work. It uses gnuplot, because I

couldn't get guile-charting to work. If anyone has enough free time to

comment on the state of this program, or any tips about how to make it

better, etc. that would be most helpful.

Thanks,

Joshua

I spent a week or two working on the 3+1 problem. The 3+1 problem is a

fun number theory conjecture. It states that there exists a procedure

for turning all positive whole integers into 1. The procedure is:

If the number is even, then divide it by two.

If the number is odd, multiply by 3 and add 1.

repeat.

I decided to write a program to graph the number of iterations it takes

for the set of numbers 2-n to reach 1. It uses ice-9 getopt-long, so

the usual --help and --version work. It uses gnuplot, because I

couldn't get guile-charting to work. If anyone has enough free time to

comment on the state of this program, or any tips about how to make it

better, etc. that would be most helpful.

Thanks,

Joshua