Diophantine equation: Difference between revisions
Jump to navigation
Jump to search
imported>Hayford Peirce (Welcome aboard! I changed the first usage of the article's title in the lede sentence from italics to boldface, as per our usage....) |
imported>Josy Shewell Brockway No edit summary |
||
Line 3: | Line 3: | ||
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:CZ Live]] | |||
[[Category:Stub Articles]] | |||
[[Category:Mathematics Workgroup]] | [[Category:Mathematics Workgroup]] |
Revision as of 14:21, 6 April 2009
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.