It can be seen that this sequence (starting at 13 and
finishing at 1) contains 10 terms. Although it has not been
proved yet (Collatz Problem), it is thought that all starting
numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one
million.
Gauche Scheme
(use gauche.collection) ;; find-max
(define (cltz n) (if (odd? n) (+ 1 (* n 3)) (/ n 2)))
(define (d c n)
(if (= n 1) c (d (+ 1 c) (cltz n))))
(find-max (lrange 1 1000000) :key (pa$ d 1))
===>
837799
--- Synchronet 3.22a-Linux NewsLink 1.2
Who's Online
Recent Visitors
Jas Hud
Mon Nov 16 00:41:01 2026
from
Bbs.Eob-Bbs.Com,wi
via
Telnet
Geek2
Sun Nov 15 09:22:57 2026
from
Euclid, Oh
via
Telnet
Amr
Fri Nov 13 16:10:06 2026
from
Fayetteville, Nc
via
Telnet
Geek2
Fri Nov 13 13:11:13 2026
from
Euclid, Oh
via
Telnet