Unsolvability of two diophantine equations of the form pᵃ + (p − 1)ᵇ = c²
| creativework.keywords | Diophantine equation, integer solutions, Mihailescu’s Theorem, unsolvable. | |
| dc.contributor.author | William S. Gayo Jr. | |
| dc.contributor.author | Siong, Venus D. | |
| dc.date.accessioned | 2026-04-06T23:32:41Z | |
| dc.date.available | 2026-04-06T23:32:41Z | |
| dc.date.issued | April 24, 2024 | |
| dc.description.abstract | In this research study, we use elementary methods in number theory to show that the Diophantine equations 11ᵃ + 10ᵇ = c² and 17ᵃ + 16ᵇ = c² are unsolvable in non-negative integers. | |
| dc.identifier.citation | Gayo, W. S., & Siong, Venus D. (2024). Unsolvability of two diophantine equations of the form pᵃ + (p − 1)ᵇ = c². International Journal of Mathematics and Computer Science, 19(4), 1143-1145. | |
| dc.identifier.issn | e1814-0432 | |
| dc.identifier.uri | https://lakasa.dmmmsu.edu.ph/handle/123456789/1265 | |
| dc.language.iso | en | |
| dc.publisher | International Journal of Mathematics and Computer Science | |
| dc.relation.uri | https://future-in-tech.net/ | |
| dc.sdg | SDG 4 | |
| dc.sdg | SDG 4 | |
| dc.sdg | SDG 9 | |
| dc.subject | Diophantine equations | |
| dc.subject | Number theory | |
| dc.subject | Prime numbers | |
| dc.subject | Exponential equations | |
| dc.subject | Unsolvability | |
| dc.subject | Algebraic structures | |
| dc.subject | Algebraic structures | |
| dc.subject.ddc | Number theory | |
| dc.subject.ddc | Diophantine equations | |
| dc.subject.lcsh | Diophantine equations | |
| dc.subject.lcsh | Number theory | |
| dc.subject.lcsh | Prime numbers | |
| dc.subject.lcsh | Exponential equations | |
| dc.subject.lcsh | Mathematical proofs | |
| dc.title | Unsolvability of two diophantine equations of the form pᵃ + (p − 1)ᵇ = c² | |
| dc.type | Article | |
| oaire.citation.endPage | 1145 | |
| oaire.citation.issue | 4 | |
| oaire.citation.startPage | 1143 | |
| oaire.citation.volume | 19 |