A statistical analysis of the most prestegious speedcubing title in Canada, released just before the final round.

Both sides had chances for an advantage, but the game was mostly equal. Although it was a balanced game, ultimately ending in a draw, it was a fighting game with the possibility for both sides to go wrong. I had a worse position for the last half of the game, but managed to hold onto the draw.

Let's suppose we wanted to find a list of prime numbers (because let's face it - who doesn't?). What would be the fastest way to do that? This article goes over the Sieve of Eratosthenes, what it is, and why it is so fast. You also get a special birthday gift from me - all the prime numbers less than 10 million, because, of course, who WOULDN'T WANT all the prime numbers less than 10 million?!

An interesting, contest-like solution to a concise and seemingly simple expression.

From a beginning chess player.