10-25-2011, 07:32 PM
|
#95
|
FFR Player
Join Date: Oct 2011
Posts: 13
|
Re: THE project euler thread
Reincarnate
I have been lurking on this thread for a few days. I wanted to see if I could pick your brain a bit on problem 355.
I have been getting close by implementing FFR4EVA_00's method of [a_2,a_3,a_5...a_p]. It is basically bumping the exponent of all primes < N
But alas, the answer is incorrect.
Did you use a method like this? Or did you go down a different path?
|
|
|