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 [...]
All posts tagged programming
Fast and elegant way to sum primes in a gigantic range
Posted by Kevin J. Qiu on June 1, 2009
http://reminiscential.wordpress.com/2009/06/01/fast-and-elegant-way-to-sum-primes-in-a-gigantic-range/
Hexspeak word list
BAFFLED BAFF1ED LIFE 11FE ASSAILS A55A115 SILLIES 51111E5 SEEDED 5EEDED BASEBALLS BA5EBA115 ACED ACED SISAL 515A1 BEFALL BEFA11 CLEO C1E0 BAFFLES BAFF1E5 FALL FA11 ACES ACE5 DILLS D1115 SAILED 5A11ED BLAB B1AB CLEF C1EF CODAS C0DA5 ABODE [...]
Posted by Kevin J. Qiu on September 3, 2008
http://reminiscential.wordpress.com/2008/09/03/hexspeak-word-list/
