Advertisement

Elementary Methods for Solving Diophantine Equations

  • Titu Andreescu
  • Dorin Andrica
  • Ion Cucurezeanu
Chapter

Abstract

Given the equation f(x1, x2, …, xn) = 0, we write it in the equivalent form
$$f_1(x_1, x_2, \ldots , x_n)f_2(x_1, x_2, \ldots , x_n) \cdots f_k(x_1, x_2, \ldots, x_n) = a,$$

Keywords

Positive Integer Nonnegative Integer Prime Divisor Integral Solution Integer Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 2009

Authors and Affiliations

  • Titu Andreescu
    • 1
  • Dorin Andrica
    • 2
    • 3
  • Ion Cucurezeanu
    • 4
  1. 1.School of Natural Sciences and MathematicsUniversity of Texas at DallasRichardsonUSA
  2. 2.Faculty of Mathematics and Computer ScienceBabeş-Bolyai UniversityCluj-NapocaRomania
  3. 3.Department of Mathematics College of ScienceKing Saud UniversityRiyadhSaudi Arabia
  4. 4.Faculty of Mathematics and Computer ScienceOvidius University of ConstantaConstantaRomania

Personalised recommendations