Re: The hardest Euler problem

William James wrote:
> 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.
> 

Sigh. My solution takes 1h45m. I think maybe PARI/GP knows things about
factoring that I don't.

> A hint for problem 191: it's just a variaton of
> problem 164.

I didn't have much problem with 191. 192 on the other hand... I whipped
out some code, looks good, runs quick, gets the wrong answer...

-- Charles