In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Using high school algebra and geometry, and knowing just one rational point on a circle or elliptic curve, we can locate infinitely many others. You’re sitting at the end of a long conference table, ...