R. Srikanth and S. Subburam
Notes on Number Theory and Discrete Mathematics, ISSN 1310-5132
Volume 17, 2011, Number 3, Pages 18—21
Download full paper: PDF, 131 Kb
Details
Authors and affiliations
R. Srikanth
Department of Mathematics, Sastra University
Thanjavur-613 401, India
S. Subburam
Department of Mathematics, Sastra University
Thanjavur-613 401, India
Abstract
In this paper, we simplify the algorithm of Szalay [5].
Keywords
- Diophantine equation
- Irreducible polynomial
- Height
- Monic polynomial
AMS Classification
- 11B41
References
- Baker, A. Bounds for the solutions of the hyperelliptic equation. Proc. Cambridge Philos. Soc. 65 (1969) 439–444.
- Poulakis, D. A simple method for solving the diophantine equation y2 = x4 + ax3 + bx2 +cx + d. Elem. Math., 54 (1999) 32–36.
- Runge, C. Uber ganzzahlige Losungen von Gleichungen zwischen wei Veranderlichen. J. reine Angew. Math. 100 (1887) 425–435.
- Szalay, L. Fast Algorithm for Solving Superelliptic Equations of Certain types. Acta Acad. Paed. Agriensis, Sectio Mathematicae, 27 (2000) 19–24.
- Szalay, L. Superelliptic equation y p = x k p + akp-1xkp-1 + …+ a0 . Bull. Greek Math. Soc.,
46 (2002) 23–33.
Related papers
Cite this paper
Srikanth, R. & Subburam, S. (2011). On the Diophantine equation yn = f(x)n + g(x), Notes on Number Theory and Discrete Mathematics, 17(3), 18-21.