Euler Problems

[Andrew Mathenge]

I've been working on #12 and the performance is simply not acceptable.
Has anyone been able to get this running as fast as some of the posts
on the site claim?

Andrew.

On Tue, Jul 8, 2008 at 12:40 PM, kinuthiA muchanE <muchanek at gmail.com> wrote:
> Andrew,
> For #10, if you do not use a sieve to find the primes, it will run
> forever!
> There is one called the Sieve of Erastothenes. Check it out on
> Wikipedia.
>
> Good luck :-)
> Kinuthia...
> On Tue, 2008-07-08 at 10:47 -0400, Andrew Mathenge wrote:
>> I'm still trying them. I started at #1 after the one you proposed
>> (#26) and I'm at #10 now. This one should be very simple but I don't
>> know why it's taking so long to run.
>>
>> Andrew.
>>
>> On Tue, Jul 8, 2008 at 6:52 AM, kinuthiA muchanE <muchanek at gmail.com> wrote:
>> > Habari,
>> > Anybody still trying these problems, you are all so, so silent...
>> >
>> > Kinuthia...
>> >
>> >
>
>