|
Kuṭṭaka
Kuṭṭaka is an algorithm for finding integer solutions of linear Diophantine equations. A linear Diophantine equation is an equation of the form ''ax'' + ''by'' = ''c'' where ''x'' and ''y'' are unknown quantities and ''a'', ''b'', and ''c'' are known quantities with integer values. The algorithm was originally invented by the Indian astronomer-mathematician Āryabhaṭa (476–550 CE) and is described very briefly in his Āryabhaṭīya. Āryabhaṭa did not give the algorithm the name ''Kuṭṭaka'', and his description of the method was mostly obscure and incomprehensible. It was Bhāskara I (c. 600 – c. 680) who gave a detailed description of the algorithm with several examples from astronomy in his ''Āryabhatiyabhāṣya'', who gave the algorithm the name ''Kuṭṭaka''. In Sanskrit, the word Kuṭṭaka means ''pulverization'' (reducing to powder), and it indicates the nature of the algorithm. The algorithm in essence is a process where the coefficients in a given lin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bhāskara II
Bhāskara II ('; 1114–1185), also known as Bhāskarāchārya (), was an Indian people, Indian polymath, Indian mathematicians, mathematician, astronomer and engineer. From verses in his main work, Siddhānta Śiromaṇi, it can be inferred that he was born in 1114 in Vijjadavida (Vijjalavida) and living in the Satpura mountain ranges of Western Ghats, believed to be the town of Patana in Chalisgaon, located in present-day Khandesh region of Maharashtra by scholars. In a temple in Maharashtra, an inscription supposedly created by his grandson Changadeva, lists Bhaskaracharya's ancestral lineage for several generations before him as well as two generations after him. Henry Thomas Colebrooke, Henry Colebrooke who was the first European to translate (1817) Bhaskaracharya II's mathematical classics refers to the family as Maharashtrian Brahmins residing on the banks of the Godavari River, Godavari. Born in a Hindu Deshastha Brahmin family of scholars, mathematicians and astrono ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kuṭṭākāra Śirōmaṇi
The ''Kuṭṭākāra Śirōmaṇi'' is a medieval Indian treatise in Sanskrit devoted exclusively to the study of the Kuṭṭākāra, or Kuṭṭaka, an algorithm for solving linear Diophantine equations. It is authored by one Dēvarāja about whom little is known. From statements given by the author at the end of the book, one can infer that the name of Dēvarāja's father was Varadarājācārya, then famously known as Siddhāntavallabha. Since the book contains a few verses from the Lilavati, it should have been composed during a period after the Lilavati was composed, that is after 1150 CE. Treatises such as the Kuṭṭākāra Śirōmaṇi devoted exclusively to specialized topics are very rare in Indian mathematical literature. The algorithm was first formulated by Aryabhata I and given in verses in the Ganitapada of his Aryabhatiya. Aryabhata's description of the algorithm was brief and hence obscure and incomprehensible. However, from the interpretations of the verses ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Āryabhaṭa
Aryabhata ( ISO: ) or Aryabhata I (476–550 CE) was the first of the major mathematician-astronomers from the classical age of Indian mathematics and Indian astronomy. His works include the '' Āryabhaṭīya'' (which mentions that in 3600 '' Kali Yuga'', 499 CE, he was 23 years old) and the ''Arya- siddhanta''. For his explicit mention of the relativity of motion, he also qualifies as a major early physicist. Biography Name While there is a tendency to misspell his name as "Aryabhatta" by analogy with other names having the " bhatta" suffix, his name is properly spelled Aryabhata: every astronomical text spells his name thus, including Brahmagupta's references to him "in more than a hundred places by name". Furthermore, in most instances "Aryabhatta" would not fit the metre either. Time and place of birth Aryabhata mentions in the ''Aryabhatiya'' that he was 23 years old 3,600 years into the '' Kali Yuga'', but this is not to mean that the text was composed at that ti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aryabhatiya
''Aryabhatiya'' (IAST: ') or ''Aryabhatiyam'' ('), a Indian astronomy, Sanskrit astronomical treatise, is the ''Masterpiece, magnum opus'' and only known surviving work of the 5th century Indian mathematics, Indian mathematician Aryabhata. Philosopher of astronomy Roger Billard estimates that the book was composed around 510 CE based on historical references it mentions. Structure and style Aryabhatiya is written in Sanskrit and divided into four sections; it covers a total of 121 verses describing different moralitus via a mnemonic writing style typical for such works in India (see definitions below): # Gitikapada (13 verses): large units of time—Kalpa (aeon), kalpa, manvantara, and Yuga Cycle, yuga—which present a cosmology different from earlier texts such as Lagadha's Vedanga Jyotisha (ca. 1st century BCE). There is also a table of [sine]s (jya), given in a single verse. The duration of the planetary revolutions during a mahayuga is given as 4.32 million years, using the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Extended Euclidean Algorithm
In arithmetic and computer programming, the extended Euclidean algorithm is an extension to the Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers ''a'' and ''b'', also the coefficients of Bézout's identity, which are integers ''x'' and ''y'' such that : ax + by = \gcd(a, b). This is a certifying algorithm, because the gcd is the only number that can simultaneously satisfy this equation and divide the inputs. It allows one to compute also, with almost no extra cost, the quotients of ''a'' and ''b'' by their greatest common divisor. also refers to a very similar algorithm for computing the polynomial greatest common divisor and the coefficients of Bézout's identity of two univariate polynomials. The extended Euclidean algorithm is particularly useful when ''a'' and ''b'' are coprime. With that provision, ''x'' is the modular multiplicative inverse of ''a'' modulo ''b'', and ''y'' is the modular multiplicative inverse of ''b'' mod ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algorithm
In mathematics and computer science, an algorithm () is a finite sequence of Rigour#Mathematics, mathematically rigorous instructions, typically used to solve a class of specific Computational problem, problems or to perform a computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use Conditional (computer programming), conditionals to divert the code execution through various routes (referred to as automated decision-making) and deduce valid inferences (referred to as automated reasoning). In contrast, a Heuristic (computer science), heuristic is an approach to solving problems without well-defined correct or optimal results.David A. Grossman, Ophir Frieder, ''Information Retrieval: Algorithms and Heuristics'', 2nd edition, 2004, For example, although social media recommender systems are commonly called "algorithms", they actually rely on heuristics as there is no truly "correct" recommendation. As an e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Relatively Prime
In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equivalent to their greatest common divisor (GCD) being 1. One says also ''is prime to'' or ''is coprime with'' . The numbers 8 and 9 are coprime, despite the fact that neither—considered individually—is a prime number, since 1 is their only common divisor. On the other hand, 6 and 9 are not coprime, because they are both divisible by 3. The numerator and denominator of a reduced fraction are coprime, by definition. Notation and testing When the integers and are coprime, the standard way of expressing this fact in mathematical notation is to indicate that their greatest common divisor is one, by the formula or . In their 1989 textbook '' Concrete Mathematics'', Ronald Graham, Donald Knuth, and Oren Patashnik proposed an alter ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Division
In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, ''Euclidean division'' is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division. Euclidean division, and algorithms to compute it, are fundamental for many questions concerning integers, such as the Euclidean algorithm for finding the greatest common divisor of two integers, and modular arithmetic, for which only remainders are considered. The operation consisting of computing only ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aryabhata II
Āryabhaṭa (c. 920 – c. 1000) was an Indian mathematician and astronomer, and the author of the ''Maha-Siddhanta''. The numeral II is given to him to distinguish him from the earlier and more influential Āryabhaṭa I. Scholars are unsure of when exactly he was born, though David Pingree dates of his main publications between 950–1100. The manuscripts of his ''Maha-Siddhanta'' have been discovered from Gujarat, Rajasthan, Uttar Pradesh, and Bengal, so he probably lived in northern India. Maha Siddhanta Aryabhata wrote ''Maha-Siddhanta'', also known as ''Arya-siddhanta'', Sanskrit language work containing 18 chapters. It summarizes a lost work attributed to Parashara, and is probably based on Shridhara's work. The initial twelve chapters deal with topics related to mathematical astronomy and cover the topics that Indian mathematicians of that period had already worked on. The various topics that have been included in these twelve chapters are: the longitud ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mahavira
Mahavira (Devanagari: महावीर, ), also known as Vardhamana (Devanagari: वर्धमान, ), was the 24th ''Tirthankara'' (Supreme Preacher and Ford Maker) of Jainism. Although the dates and most historical details of his life are uncertain and varies by sect, historians generally consider that he lived during the 6th or 5th century BCE, reviving and reforming a proto-Jain community (which had possibly been founded by Pārśvanātha), and that he was an older contemporary of Gautama Buddha. Jains regard him as the spiritual successor of the 23rd ''Tirthankara'' Parshvanatha. According to traditional legends and hagiographies, Mahavira was born in the early 6th century BCE to a royal Kshatriya Jain family of ancient India. His mother's name was Trishala and his father's name was Siddhartha. According to the second chapter of the Śvētāmbara Ācārāṅga Sūtra, Siddhartha and his family were devotees of Parshvanatha. Mahavira abandoned all worldly p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Brahmagupta
Brahmagupta ( – ) was an Indian Indian mathematics, mathematician and Indian astronomy, astronomer. He is the author of two early works on mathematics and astronomy: the ''Brāhmasphuṭasiddhānta'' (BSS, "correctly established Siddhanta, doctrine of Brahma", dated 628), a theoretical treatise, and the ''Khandakhadyaka'' ("edible bite", dated 665), a more practical text. In 628 CE, Brahmagupta first described gravity as an attractive force, and used the term "gurutvākarṣaṇam (गुरुत्वाकर्षणम्)" in Sanskrit to describe it. He is also credited with the first clear description of the quadratic formula (the solution of the quadratic equation)Bradley, Michael. ''The Birth of Mathematics: Ancient Times to 1300'', p. 86 (Infobase Publishing 2006) in his main work, the ''Brāhma-sphuṭa-siddhānta''. Life and career Brahmagupta, according to his own statement, was born in 598 CE. Born in ''Bhillamāla'' in Gurjaradesa (modern Bhinmal in Rajasthan, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
