Applying the recurrence formula to this solution generates the infinite sequence of solutions:(1, 0); (8, 3); (127, 48); (2024, 765); (32257, 12192); (514088, 194307); (8193151, 3096720); (130576328, 49353213); ... (sequence ("x") and ("y") in OEIS)The smallest solution can be very large.
Arhimedov problem o govedu se na primer lahko reši s pomočjo Pellove enačbe:: formula_43Njena osnovna rešitev ima 206545 števk, če se jo zapiše eksplicitno.