Re: The hardest Euler problem
  Home FAQ Contact Sign in
comp.lang.forth only
 
Advanced search
POPULAR GROUPS

more...

 Up
Re: The hardest Euler problem         

Group: comp.lang.forth · Group Profile
Author: 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
SubjectArticles qty Group
cvs commit: ports/science/euler Makefile ports/science/euler/filesmailing.freebsd.cvs ·