Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q619388> ?p ?o }
Showing triples 1 to 52 of
52
with 100 triples per page.
- Q619388 subject Q6799333.
- Q619388 subject Q7153823.
- Q619388 subject Q7264611.
- Q619388 abstract "In mathematics, a proof by infinite descent is a particular kind of proof by contradiction that relies on the least integer principle. One typical application is to show that a given equation has no solutions.Typically, one shows that if a solution to a problem existed, which in some sense was related to one or more natural numbers, it would necessarily imply that a second solution existed, which was related to one or more 'smaller' natural numbers. This in turn would imply a third solution related to smaller natural numbers, implying a fourth solution, therefore a fifth solution, and so on. However, there cannot be an infinity of ever-smaller natural numbers, and therefore by mathematical induction (repeating the same step) the original premise—that any solution exists— is incorrect: its correctness produces a contradiction.An alternative way to express this is to assume one or more solutions or examples exists. Then there must be a smallest solution or example—a minimal counterexample. We then prove that if a smallest solution exists, it must imply the existence of a smaller solution (in some sense)—which again proves that the existence of any solution would lead to a contradiction.The method of infinite descent was developed by Fermat, who often used it for Diophantine equations. Two typical examples are showing the non-solvability of the Diophantine equation r2 + s4 = t4 and proving Fermat's theorem on sums of two squares, which states that an odd prime p can be expressed as a sum of two squares only when p ≡ 1 (mod 4) (see proof). In some cases, to the modern eye, his "method of infinite descent" is an exploitation of the inversion of the doubling function for rational points on an elliptic curve E. The context is of a hypothetical non-trivial rational point on E. Doubling a point on E roughly doubles the length of the numbers required to write it (as number of digits), so that a "halving" a point gives a rational with smaller terms. Since the terms are positive, they cannot decrease forever. In this way Fermat was able to show the non-existence of solutions in many cases of Diophantine equations of classical interest (for example, the problem of four perfect squares in arithmetic progression).".
- Q619388 wikiPageExternalLink sq_root.shtml.
- Q619388 wikiPageWikiLink Q104752.
- Q619388 wikiPageWikiLink Q1244890.
- Q619388 wikiPageWikiLink Q12479.
- Q619388 wikiPageWikiLink Q12916.
- Q619388 wikiPageWikiLink Q132469.
- Q619388 wikiPageWikiLink Q142140.
- Q619388 wikiPageWikiLink Q16249614.
- Q619388 wikiPageWikiLink Q170008.
- Q619388 wikiPageWikiLink Q178377.
- Q619388 wikiPageWikiLink Q1789063.
- Q619388 wikiPageWikiLink Q184899.
- Q619388 wikiPageWikiLink Q191359.
- Q619388 wikiPageWikiLink Q206793.
- Q619388 wikiPageWikiLink Q208225.
- Q619388 wikiPageWikiLink Q2488476.
- Q619388 wikiPageWikiLink Q2640920.
- Q619388 wikiPageWikiLink Q268961.
- Q619388 wikiPageWikiLink Q284960.
- Q619388 wikiPageWikiLink Q298860.
- Q619388 wikiPageWikiLink Q318751.
- Q619388 wikiPageWikiLink Q319400.
- Q619388 wikiPageWikiLink Q323232.
- Q619388 wikiPageWikiLink Q3393476.
- Q619388 wikiPageWikiLink Q35497.
- Q619388 wikiPageWikiLink Q363948.
- Q619388 wikiPageWikiLink Q382839.
- Q619388 wikiPageWikiLink Q389813.
- Q619388 wikiPageWikiLink Q395.
- Q619388 wikiPageWikiLink Q3968.
- Q619388 wikiPageWikiLink Q49008.
- Q619388 wikiPageWikiLink Q50705.
- Q619388 wikiPageWikiLink Q5892827.
- Q619388 wikiPageWikiLink Q607728.
- Q619388 wikiPageWikiLink Q613048.
- Q619388 wikiPageWikiLink Q6799333.
- Q619388 wikiPageWikiLink Q6865307.
- Q619388 wikiPageWikiLink Q7153823.
- Q619388 wikiPageWikiLink Q7264611.
- Q619388 wikiPageWikiLink Q726833.
- Q619388 wikiPageWikiLink Q75655.
- Q619388 wikiPageWikiLink Q905896.
- Q619388 wikiPageWikiLink Q914517.
- Q619388 wikiPageWikiLink Q9267097.
- Q619388 type Thing.
- Q619388 comment "In mathematics, a proof by infinite descent is a particular kind of proof by contradiction that relies on the least integer principle. One typical application is to show that a given equation has no solutions.Typically, one shows that if a solution to a problem existed, which in some sense was related to one or more natural numbers, it would necessarily imply that a second solution existed, which was related to one or more 'smaller' natural numbers.".
- Q619388 label "Proof by infinite descent".
- Q619388 seeAlso Q18640217.