Re: Project Euclid Problem 26 SOLVED!!!

On Sat, 09 Mar 2024 13:28:40 +0000, Farley Flud wrote:

Project Euclid Problem is SOLVED!!!
 https://projecteuler.net/problem=26
 

1000?  Why stop at a measly-peasly 1000?  Let's do 100,000.
Just paste the following maxima code into a "file.mac"
and then copy the file into the maxima search path.
Then, from maxima (not wxMaxima) do:
load("file.mac");
Wanna go for 1 million? 10 million?  A billion?
It's no problem.  Just change the "for" loop maximum,
but you'd better also compile the code for faster
execution. ==============================================================
file_output_append:true;
f:"/some/path/prob26.txt";
max:1$
maxd:3$
for num:3 thru 100000 step 1 do (
    d:1,
    fact_list:ifactors(num),
    for i:1 thru length(fact_list) do (
    if not(fact_list[1] = 2 or fact_list[1] = 5) then d:d*fact_list[1]^fact_list[2]
      ),
    if not(d = 1) then (
        rep:zn_order(10,d), with_stdout(f,print("denom = ", num, "repeats = ", rep)),
        if (rep > max) then (max:rep, maxd:num)
    )
    else with_stdout(f,(print("denom = ", num, "terminating")))   );
with_stdout(f, print("Max rep =", max, "at denom =", maxd));
================================================================================

 Hail Linux!
 Hail GNU, FOSS, and the FSF!
 Hail Stallman!
>