Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

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

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


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 07: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
Node Status?
node history
Node Type: note [id://527991]
help
Chatterbox?
[Discipulus]: M4ver1k are you debug/dump vars in the loops? are you sure you are not quitting the loop earlier?
[Corion]: A good weekstart to everybody!
[Discipulus]: good morning nuns and monks! hello Corion

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2017-11-20 08:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (285 votes). Check out past polls.

    Notices?