1/Jun 2009
6 min. read
The problem is taken from Project-Euler, which asks what is the sum of all prime numbers under 2 million.
Traditional Approach Project-Euler has many problems like this which looks ridiculously easy in theory, but practically impossible when using the old-school brute force way to solve them.
Even after applying some well-known techniques to shrink the problem space, the computation still takes a long time (too long for me to stick around and wait it to finish).
1/Jun 2009
6 min. read
The problem is taken from Project-Euler, which asks what is the sum of all prime numbers under 2 million.
Traditional Approach Project-Euler has many problems like this which looks ridiculously easy in theory, but practically impossible when using the old-school brute force way to solve them.
Even after applying some well-known techniques to shrink the problem space, the computation still takes a long time (too long for me to stick around and wait it to finish).