Beefy Boxes and Bandwidth Generously Provided by pair Networks Bob
"be consistent"
 
PerlMonks  

Re: Project Euler (a series of challenging mathematical/computer programming problems)

by mpolo (Chaplain)
on Feb 04, 2006 at 15:36 UTC ( [id://527991]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


in reply to Project Euler (a series of challenging mathematical/computer programming problems)

Well, I've wasted a lot of time with that site now...

I've solved 18 thus far, and have credited perl for all but #5. A very useful resource for a lot of these is one of merlyn's columns, which calculates the primes pretty quickly. And Math::BigInt is your friend for many of these as well.

Currently, #48 has me a little stumped, as it managed to "inf" out BigInt. All the sums from 18 to 143 have the same last 10 digits, but the site claims that these are not the answer. I suppose I'm going to be forced to think about that one some more. :)

  • Comment on Re: Project Euler (a series of challenging mathematical/computer programming problems)

Replies are listed 'Best First'.
Re^2: Project Euler (a series of challenging mathematical/computer programming problems)
by mpolo (Chaplain) on Feb 05, 2006 at 02:08 UTC
    O.K. I was totally stupid on #48. I've solved it now (without even needing BigInt).

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://527991]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    hippoepoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.