| Sysop: | Amessyroom |
|---|---|
| Location: | Fayetteville, NC |
| Users: | 21 |
| Nodes: | 6 (0 / 6) |
| Uptime: | 30:46:32 |
| Calls: | 139 |
| Files: | 91 |
| Messages: | 42,713 |
HenHanna <HenHanna@devnull.tb> writes:
is this fast?
No it is slow, it needs memoization
what does the SUBJ line mean? ( Euler 14.)
It is problem 14 of projecteuler.net .
HenHanna <HenHanna@devnull.tb> writes:
is this fast?
No it is slow, it needs memoization
what does the SUBJ line mean? ( Euler 14.)
It is problem 14 of projecteuler.net .
The following iterative sequence is defined for the set of positive
integers:
n -> n/2 (n is even)
n -> 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 -> 40 -> 20 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1
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