The chakravala method is a cyclic algorithm to solve indeterminatequadratic equations, including Pell's equation. It is commonly attributed to Bhāskara II, although some attribute it to Jayadeva. Jayadeva pointed out that Brahmagupta's approach to solving equations of this type could be generalized, and he then described this general method, which was later refined by Bhāskara II in his Bijaganita treatise. He called it the Chakravala method: chakra meaning "wheel" in Sanskrit, a reference to the cyclic nature of the algorithm. C.-O. Selenius held that no European performances at the time of Bhāskara, nor much later, exceeded its marvellous height of mathematical complexity. This method is also known as the cyclic method and contains traces of mathematical induction.
History
Chakra in Sanskrit means cycle. As per popular legend, Chakravala indicates a mythical range of mountains which orbits around the earth like a wall and not limited by light and darkness. Brahmagupta in 628 CE studied indeterminate quadratic equations, including Pell's equation for minimum integers x and y. Brahmagupta could solve it for several N, but not all. Jayadeva and Bhaskara offered the first complete solution to the equation, using the chakravala method to find for the solution This case was notorious for its difficulty, and was first solved in Europe by Brouncker in 1657–58 in response to a challenge by Fermat, using continued fractions. A method for the general problem was first completely described rigorously by Lagrange in 1766. Lagrange's method, however, requires the calculation of 21 successive convergents of the continued fraction for the square root of 61, while the chakravala method is much simpler. Selenius, in his assessment of the chakravala method, states Hermann Hankelcalls the chakravala method
The method
From Brahmagupta's identity, we observe that for given N, For the equation, this allows the "composition" of two solution triples and into a new triple In the general method, the main idea is that any triple can be composed with the trivial triple to get the new triple for any m. Assuming we started with a triple for which, this can be scaled down by k : Since the signs inside the squares do not matter, the following substitutions are possible: When a positive integerm is chosen so that /k is an integer, so are the other two numbers in the triple. Among such m, the method chooses one that minimizes the absolute value of m2 − N and hence that of /k. Then the substitution relations are applied for mequal to the chosen value. This results in a new triple. The process is repeated until a triple with is found. This method always terminates with a solution. Optionally, we can stop when k is ±1, ±2, or ±4, as Brahmagupta's approach gives a solution for those cases.
Examples
''n'' = 61
The n = 61 case, issued as a challenge by Fermat many centuries later, was given by Bhaskara as an example. We start with a solution for any k found by any means. In this case we can let bbe 1, thus, since, we have the triple. Composing it with gives the triple, which is scaled down to get: For 3 to divide and to be minimal, we choose, so that we have the triple. Now that k is −4, we can use Brahmagupta's idea: it can be scaled down to the rational solution, which composed with itself three times, with respectively, when k becomes square and scaling can be applied, this gives. Finally, such procedure can be repeated until the solution is found :. This is the minimal integer solution.
''n'' = 67
Suppose we are to solve for x and y. We start with a solution for any k found by any means; in this case we can let b be 1, thus producing. At each step, we find an m > 0 such that k divides a + bm, and |m2 − 67| is minimal. We then update a, b, and k to and respectively. ;First iteration We have. We want a positive integer m such that k divides a + bm, i.e. 3 divides 8 + m, and |m2 − 67| is minimal. The first condition implies that m is of the form 3t + 1, and among such m, the minimal value is attained for m = 7. Replacing with, we get the new values. That is, we have the new solution: At this point, one round of the cyclic algorithm is complete. ;Second iteration We now repeat the process. We have. We want an m > 0 such that k divides a + bm, i.e. 6 divides 41 + 5m, and |m2 − 67| is minimal. The first condition implies that m is of the form 6t + 5, and among such m, |m2 − 67| is minimal for m = 5. This leads to the new solution a = /6, etc.: ;Third iteration For 7 to divide 90 + 11m, we must have m = 2 + 7t and among such m, we pick m = 9. ;Final solution At this point, we could continue with the cyclic method, but since the right-hand side is among ±1, ±2, ±4, we can also use Brahmagupta's observation directly. Composing the triple with itself, we get that is, we have the integer solution: This equation approximates as to within a margin of about.
