Path: ...!2.eu.feeder.erje.net!feeder.erje.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: HenHanna <HenHanna@devnull.tb>
Newsgroups: comp.lang.lisp
Subject: Re: Euler 14.
Date: Tue, 23 Jul 2024 12:24:00 -0700
Organization: A noiseless patient Spider
Lines: 41
Message-ID: <v7p00g$1b339$3@dont-email.me>
References: <v34fp4$iunh$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Tue, 23 Jul 2024 21:24:00 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="45120b53e64fc89465e7bcc84dd55152";
	logging-data="1412201"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19yNV6IUdWCDUzFs1gF1cv4AAFQ4/OVs4w="
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:yCH5W0MqdS37CibLrvAEQSF6pLw=
Content-Language: en-US
In-Reply-To: <v34fp4$iunh$1@dont-email.me>
Bytes: 2044

On 5/28/2024 4:39 AM, B. Pym wrote:
> 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



is this fast?

what does the SUBJ line mean?   ( Euler 14.)