A prime number is a number that is only divisible by one and itself, which is essentially saying that it has no divisor. That takes half of all possible numbers off the table right away (the evens), ...

A basic feature of number theory, prime numbers are also a fundamental building block of computer science, from hashtables to cryptography. Everyone knows that a prime number is one that cannot be ...

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 ...

This journal, begun in 1943 as Mathematical Tables and Other Aids to Computation, publishes original articles on all aspects of numerical mathematics, book reviews, mathematical tables, and technical ...

We show that the binary expansions of algebraic numbers do not form secure pseudorandom sequences; given sufficiently many initial bits of an algebraic number, its minimal polynomial can be ...