It is to the Sanskrit word kuttaka, freely translated as "the pulveriser", that this site owes its name. Kuttaka is the generic name for a set of rules/algorithms, that ancient Indian mathematicians used to solve remainder problems (or linear Diophantine equations). Aryabhata was the first mathematician to use it, but it was further developed and refined by the next generations.
The rule is roughly similar to the later algorithms of Euler (continued fractions) and Gauss (modular arithmetics). It also depends upon the Euclidean algorithm to find the greatest common divisor, but differs subtly from the European methods. The connection and differences between kuttaka and modular arithmetic clarify the fact that the presentation, interpretation and implementation of the algorithm are dependent on cultural and contextual factors, but incidentally also bring computational issues to the fore. Recenty, Rao and Yang showed that Aryabhata's method has advantages over Gauss's and Garner's methods.

Another aspect should be highlighted: The kuttaka-rules first break the problem (i.e. the numbers) into little pieces, then assemble them again into a solution. This principle -- that I anachronistically but nostalgically would like to call the lego-principle -- is the reason why this site is called kuttaka.