Diophantine equation: Difference between revisions
Jump to navigation
Jump to search
imported>Todd Coles (subpages) |
mNo edit summary |
||
| Line 2: | Line 2: | ||
A '''Diophantine equation''', named after the [[Ancient Greece|Ancient Greek]] mathematician [[Diophantus]], is an [[equation]] in any number of variables that only admits solutions from the [[ring (mathematics)|ring]] of [[integers]], <math>\mathbb Z</math>. Their study forms a part of the branch of [[mathematics]] known as [[number theory]]. | A '''Diophantine equation''', named after the [[Ancient Greece|Ancient Greek]] mathematician [[Diophantus]], is an [[equation]] in any number of variables that only admits solutions from the [[ring (mathematics)|ring]] of [[integers]], <math>\mathbb Z</math>. Their study forms a part of the branch of [[mathematics]] known as [[number theory]]. | ||
Of particular interest are linear Diophantine equations, of the form <math>a_1x_1+a_2x_2+\cdots+a_nx_n=b</math>, which may be solved by means of the extended [[Euclidean algorithm]]. | Of particular interest are linear Diophantine equations, of the form <math>a_1x_1+a_2x_2+\cdots+a_nx_n=b</math>, which may be solved by means of the extended [[Euclidean algorithm]].[[Category:Suggestion Bot Tag]] | ||
Latest revision as of 11:00, 7 August 2024
A Diophantine equation, named after the Ancient Greek mathematician Diophantus, is an equation in any number of variables that only admits solutions from the ring of integers, . Their study forms a part of the branch of mathematics known as number theory.
Of particular interest are linear Diophantine equations, of the form , which may be solved by means of the extended Euclidean algorithm.
