2010Journal of Zhanjiang Normal CollegeRequires access

Conditions for the Solubility of the Diophantine Equation(a~n-1)((a+1)~n-1)=x~2

LE Mao-hua

Open publisher page 0 citations

Abstract

Let a be a positive integer with a1,and let a≡λ(mod 2),where λ∈{0,1}.Let f(a)=ord 2(a-λ) denote the degree of 2 in the factorization of a-λ.In this paper,using some elementary number theories,we prove that if the equation(an-1)((a+1)n-1)=x2 has positive integer solutions(n,x),then a satisfies the following conditions:(i) f(a)=2r,where r is a positive integer with r1.(ii) Every odd prime divisor p of a+1 satisfies p≡±1(mod 8).

About this research paper

What this paper is about

Let a be a positive integer with a1,and let a≡λ(mod 2),where λ∈{0,1}.Let f(a)=ord 2(a-λ) denote the degree of 2 in the factorization of a-λ.In this paper,using some elementary number theories,we prove that if the equation(an-1)((a+1)n-1)=x2 has positive integer solutions(n,x),then a satisfies the following conditions:(i) f(a)=2r,where r is a positive integer with r1.(ii) Every odd prime divisor p of a+1 satisfies p≡±1(mod 8).

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

Let a be a positive integer with a1,and let a≡λ(mod 2),where λ∈{0,1}.Let f(a)=ord 2(a-λ) denote the degree of 2 in the factorization of a-λ.In this paper,using some elementary number theories,we prove that if the equation(an-1)((a+1)n-1)=x2 has positive integer solutions(n,x),then a satisfies the following conditions:(i) f(a)=2r,where r is a positive integer with r1.(ii) Every odd prime divisor p of a+1 satisfies p≡±1(mod 8).

Key concepts: Integer (computer science), Diophantine equation, Mathematics, Prime factor, Factorization, Prime (order theory), Radical of an integer, Combinatorics

Related papers

Back to paper searchBrowse research topicsOriginal source
Conditions for the Solubility of the Diophantine Equation(a~n-1)((a+1)~n-1)=x~2 — Research Paper | ScholarLens