online advertising

Wednesday, June 10, 2015

Haskell 99 Problem 41


Please find the problem here.


Please see the solution as follow:

Leveraging the previous problem I just compute the primes once and build the tree once. It results in a blazing fast algorithm, it can check the goldbach conjecture is valid for up to 10,000,000 in less than a second.

No comments :

Post a Comment