Re: The hardest Euler problem
Home
FAQ
Contact
Sign in
Search
comp.lang.forth only
Advanced search
POPULAR GROUPS
perl.cpan.testers
alt.marketplace.online.ebay
alt.forsale
alt.ads.forsale
alt.bestjobsusa.computer
alt.bestjobsusa.computer.jobs
us.jobs.offered
alt.bestjobsusa.jobs.offered
us.jobs
nyc.jobs
more...
Up
Re: The hardest Euler problem
Group:
comp.lang.forth
·
Group Profile
Author:
William James
William James
Date:
May 3, 2008 17:06
Someone posted this PARI/GP solution to problem 12:
n=0; until(numdiv(n*(n+1)/2) > 500, n++); n*(n+1)/2
He said it took about 50ms on his Intel 2.52GHz.
A hint for problem 191: it's just a variaton of
problem 164.
no comments
diggit!
del.icio.us!
reddit!
RELATED THREADS
Subject
Articles qty
Group
cvs commit: ports/science/euler Makefile ports/science/euler/files
1
mailing.freebsd.cvs
·