2009Birkhäuser Boston eBooksRequires access

Solutions to Some Advanced Methods in Solving Diophantine Equations

Titu Andreescu, Dorin Andrica, Ion Cucurezeanu

Open publisher page 0 citations

Abstract

1.Solve the equation $$x^2 + 4 = y^n,$$ where n is an integer greater than 1. Solution. For n = 2, the only solutions are (0, 2) and (0, –2). For n = 3, we have seen in Example 4 that the solutions are (2, 2), (–2, 2), (11, 5), and (–11,5). Lef now n ≥ 4. Clearly, for n even, the equation is not solvable, since no other squares differ by 4. For n odd, we may assume without loss of generality that n is a prime p ≥ 5. Indeed, if n = q k , where q is an odd prime, we obtain an equation of the same type: x 2 + 4 = (y k ) q .

About this research paper

What this paper is about

1.Solve the equation $$x^2 + 4 = y^n,$$ where n is an integer greater than 1. Solution. For n = 2, the only solutions are (0, 2) and (0, –2). For n = 3, we have seen in Example 4 that the solutions are (2, 2), (–2, 2), (11, 5), and (–11,5). Lef now n ≥ 4. Clearly, for n even, the equation is not solvable, since no other squares differ by 4. For n odd, we may assume without loss of generality that n is a prime p ≥ 5. Indeed, if n = q k , where q is an odd prime, we obtain an equation of the same type: x 2 + 4 = (y k ) q .

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

1.Solve the equation $$x^2 + 4 = y^n,$$ where n is an integer greater than 1. Solution. For n = 2, the only solutions are (0, 2) and (0, –2). For n = 3, we have seen in Example 4 that the solutions are (2, 2), (–2, 2), (11, 5), and (–11,5). Lef now n ≥ 4. Clearly, for n even, the equation is not solvable, since no other squares differ by 4. For n odd, we may assume without loss of generality that n is a prime p ≥ 5. Indeed, if n = q k , where q is an odd prime, we obtain an equation of the same type: x 2 + 4 = (y k ) q .

Key concepts: Diophantine equation, Integer (computer science), Prime (order theory), Mathematics, Type (biology), Combinatorics, Discrete mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Solutions to Some Advanced Methods in Solving Diophantine Equations — Research Paper | ScholarLens