to %: 5e15 which may be possible but I doubt it. I will think about it
again tomorrow.
>
> --- Original Message ---
>
> From: mike_liz.
d...@tiscali.co.uk
> Sent: July 13, 2015 3:39 AM
> To:
programm...@jsoftware.com
> Subject: Re: [Jprogramming] Here we go
again... another P
gramm...@jsoftware.com
Subject: Re: [Jprogramming] Here we go again... another Project Euler Question
Problem 484 is still on my to-do list. I haven't looked at
it in a
while, but my working script includes a remark:
NB. ... suggests a
sieve might be ok - but for 5e15!!!
Also, I seemed to be tryin
Problem 484 is still on my to-do list. I haven't looked at
it in a
while, but my working script includes a remark:
NB. ... suggests a
sieve might be ok - but for 5e15!!!
Also, I seemed to be trying to
use a moebius function or
Moebius' Theorem...
As I haven't managed to
solve it yet,
I don't do project euler, I've never really gotten into it. But my
impression is that the problems are chosen to make brute force
solutions impractical.
Here, I think I see a pattern in the relationship between >./@(_&q:)
and func (for your definition of func) and I expect that the mechanism
behin
Project Euler #484
https://projecteuler.net/problem=484
is particularly troublesome. My solution is:
f =: monad define
T =: 5 * 10^15
ctr=:1
sum =: 0
func=:+.(+/@:(1&(*/\.))@:q:)
while. ctr < T + 1 do.
sum =: sum + func ctr
ctr =: ctr+1
end.
sum
)
But on my Mac this causes a crash. (Do
