Aryabhata algorithm

Aryabhata algorithm

Aryabhata algorithm is an algorithm to solve indeterminate Diophantine equations and for residue arithmetic. It is first described in the mathematician-astronomer Aryabhata's book "Aryabhatiya" (499).

In recent years, it has been used for cryptographic applications.

External links

* [http://iir.csie.ncku.edu.tw/TFIT2005/TFIT2005_chyang.pdf Aryabhata remainder theorem]
* [http://www.ece.lsu.edu/kak/AryabhataAlgorithm.pdf Computational aspects of the Aryabhata algorithm]
* [http://www.math.sfu.ca/histmath/India/5thCenturyAD/Kuttaka.html Aryabhata's Kuttaka]


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Aryabhata — For other uses, see Aryabhata (disambiguation). Āryabhaṭa Statue of Aryabhata on the grounds of IUCAA, Pune. As there is no known information regarding his appearance, any image of Aryabhata originates from an artist s conception. Born 476 …   Wikipedia

  • Aryabhata equation — The Aryabhata equation is the linear indeterminate equation ax by = c, for which Aryabhata proposed a method of solution, now known as the Aryabhata algorithm.The tradition for research on this equation seems to have been geometric problems of… …   Wikipedia

  • Aryabhata I — born 476, possibly Ashmaka or Kusumapura, India Astronomer and the earliest Indian mathematician whose work survives. He composed at least two works, Aryabhatiya (с 499) and the now lost Aryabhatasiddhanta, which circulated mainly in the… …   Universalium

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Chinese remainder theorem — The Chinese remainder theorem is a result about congruences in number theory and its generalizations in abstract algebra. In its most basic form it concerned with determining n, given the remainders generated by division of n by several numbers.… …   Wikipedia

  • Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia

  • Timeline of mathematics — A timeline of pure and applied mathematics history. Contents 1 Before 1000 BC 2 1st millennium BC 3 1st millennium AD 4 1000–1500 …   Wikipedia

  • Approximations of π — Timeline of approximations for pi …   Wikipedia

  • Indian mathematics — mdash;which here is the mathematics that emerged in South Asia from ancient times until the end of the 18th century mdash;had its beginnings in the Bronze Age Indus Valley civilization (2600 1900 BCE) and the Iron Age Vedic culture (1500 500 BCE) …   Wikipedia

  • Brahmagupta — (audio|Brahmagupta pronounced.ogg|listen) (598–668) was an Indian mathematician and astronomer. Life and work Brahmagupta was born in 598 CE in Bhinmal city in the state of Rajasthan of northwest India. He likely lived most of his life in… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”