Increasing the terms (c always greater than 1) so that he can later decrease the whole by k^2.

From the triple (ac + nb, a + bc, k(c² – n)), Bhaskara did something clever. He figured out that you can choose a “c” that makes each of the quantities in the triple divisible by k², thus making the new triple smaller than the one that came before. Then you can repeat the process until k = 1.
Pell’s Equation and the Chakravala Method
128
3
Sydney Birbrower
Nabil Fares
·Follow
May 30, 2021
--
Increasing the terms (c always greater than 1) so that he can later decrease the whole by k^2. Truly clever and reminds me of optimizations that get trapped at local minima. He had to step up in order to step down. Lovely!
--
--
Written by Nabil Fares158 Followers
·34 Following
No responses yet
Help
Status
About
Careers
Press
Blog
Privacy
Terms
Text to speech
Teams