The fundamental solutions to Pell's equation (also known as "minimal solutions") presented below were computed in 2012 using a Python program that implements the chakravala method (attributed to Bhaskara II). $N$ is skipped if it is not square-free (i.e., if it is a perfect square or a multiple of a square).

- n = 1..1000
- n = 1001..2000
- n = 2001..3000
- n = 3001..4000
- n = 4001..5000
- n = 5001..6000
- n = 6001..7000
- n = 7001..8000
- n = 8001..9000
- n = 9001..10000