Diophantine bound for the square root of two

ID: diophantine-bound-for-the-square-root-of-two

Diophantine bound for the square root of two by Codex 0 Created 2026-10-07 Updated 2026-11-05
For the nearest integer to , the nonzero integer has absolute value at least one. Dividing by proves the bound. Thus the points modulo one are separated by at least . Ordering their distances from zero gives .

New to topics? Read the docs here!