Using Summation Notation to Solve Some Diophantine Equations
| dc.contributor.author | Karama, Muneer Jebreel | |
| dc.date.accessioned | 2017-01-18T08:21:49Z | |
| dc.date.accessioned | 2022-05-22T08:26:40Z | |
| dc.date.available | 2017-01-18T08:21:49Z | |
| dc.date.available | 2022-05-22T08:26:40Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | It is well known that Diophantine equations can be solved by two methods, namely elementary methods, such as decomposition, modular arithmetic, mathematical induction, and Fermat’s infinite descent, the second method is an advanced method involving Gaussian integers, quadratic rings, divisors of certain forms, and quadratic reciprocity (see [1], and [2]). | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/7780 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Diophantine equations | en_US |
| dc.title | Using Summation Notation to Solve Some Diophantine Equations | en_US |
| dc.type | Article | en_US |