Indeterminate equations

A problem of great interest to Indian mathematicians since ancient times has been to find integer solutions to Diophantine equations that have the form ax + by = c. (This problem was also studied in ancient Chinese mathematics, and its solution is usually referred to as the Chinese remainder theorem.) This is an example from Bhāskara's commentary on Aryabhatiya:

Find the number which gives 5 as the remainder when divided by 8, 4 as the remainder when divided by 9, and 1 as the remainder when divided by 7

That is, find N = 8x+5 = 9y+4 = 7z+1. It turns out that the smallest value for N is 85. In general, diophantine equations, such as this, can be notoriously difficult. They were discussed extensively in ancient Vedic text Sulba Sutras, whose more ancient parts might date to 800 BCE. Aryabhata's method of solving such problems, elaborated by Bhaskara in 621 CE, is called the kuṭṭaka method. Kuṭṭaka means "pulverizing" or "breaking into small pieces", and the method involves a recursive algorithm for writing the original factors in smaller numbers. This algorithm became the standard method for solving first-order diophantine equations in Indian mathematics, and initially the whole subject of algebra was called kuṭṭaka-gaṇita or simply kuṭṭaka.

Algebra

In Aryabhatiya, Aryabhata provided elegant results for the summation of series of squares and cubes:[23]

{\displaystyle 1^{2}+2^{2}+\cdots +n^{2}={n(n+1)(2n+1) \over 6}}1^2 + 2^2 + \cdots + n^2 = {n(n + 1)(2n + 1) \over 6}

and

{\displaystyle 1^{3}+2^{3}+\cdots +n^{3}=(1+2+\cdots +n)^{2}}1^3 + 2^3 + \cdots + n^3 = (1 + 2 + \cdots + n)^2

This website uses cookies to ensure you get the best experience on our website. Learn More

## 0+ Comments