2010Chongqing Shifan Daxue xuebao. Ziran kexue banRequires access

On the Diophantine Equation x~3+1=57y~2

Huiming Duan

Open publisher page 0 citations

Abstract

In this paper the author studies all the integer solutions to the diophantine equation x3+1=57y2.The process is as follows:classify the will-be integer solutions to the diophantine equation into four equations by equation firstly,then take models on these equations,the first equation and second equantion aren't integer solutions.At last two equations are integer solutions,at the same time,the methods of recursive sequences and maple formality and Pell equation and quadratic remainder are used.At last,it is proved that the diophantine equation x3+1=57y2 has only positive integer solutions(x,y)=(-1,0),(8,±3).

About this research paper

What this paper is about

In this paper the author studies all the integer solutions to the diophantine equation x3+1=57y2.The process is as follows:classify the will-be integer solutions to the diophantine equation into four equations by equation firstly,then take models on these equations,the first equation and second equantion aren't integer solutions.At last two equations are integer solutions,at the same time,the methods of recursive sequences and maple formality and Pell equation and quadratic remainder are used.At last,it is proved that the diophantine equation x3+1=57y2 has only positive integer solutions(x,y)=(-1,0),(8,±3).

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

In this paper the author studies all the integer solutions to the diophantine equation x3+1=57y2.The process is as follows:classify the will-be integer solutions to the diophantine equation into four equations by equation firstly,then take models on these equations,the first equation and second equantion aren't integer solutions.At last two equations are integer solutions,at the same time,the methods of recursive sequences and maple formality and Pell equation and quadratic remainder are used.At last,it is proved that the diophantine equation x3+1=57y2 has only positive integer solutions(x,y)=(-1,0),(8,±3).

Key concepts: Diophantine equation, Integer (computer science), Mathematics, Diophantine set, Legendre's equation, Thue equation, Formality, Diophantine geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
On the Diophantine Equation x~3+1=57y~2 — Research Paper | ScholarLens