Any number can, in theory, be written as the product of prime numbers. For small numbers, this is easy (for example, the prime factors of 12 are 2, 2, and 3), but for large numbers, prime ...

Peter Shor didn’t set out to break the internet. But an algorithm he developed in the mid-1990s threatened to do just that. In a landmark paper, Shor showed how a hypothetical computer that exploited ...

From Quanta Magazine (find original story here). In 1847, Gabriel Lamé proved Fermat’s Last Theorem. Or so he thought. Lamé was a French mathematician who had made many important discoveries. In March ...

The phenomenal success of our integrated circuits managed to obscure an awkward fact: they're not always the best way to solve problems. The features of modern computers—binary operations, separated ...