
A Prime-by-Prime Test Solves a Surprisingly Global Matching Puzzle
A divisor-matching puzzle has a surprisingly local solution: prime-by-prime counts guarantee a global coprime pairing.

A divisor-matching puzzle has a surprisingly local solution: prime-by-prime counts guarantee a global coprime pairing.