On the Diophantine Equation 〔x 2〕-1=q~n+1
LE Mao-hua
Abstract
LE Mao-hua
Abstract
Let q=p~r, where p is a prime and r is a positive integer, In this paper we prove that if p100 and p≠47,53,59,67,83 or 89, then the equation x2-1=q~n+1 has no positive integer solution (x,n).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let q=p~r, where p is a prime and r is a positive integer, In this paper we prove that if p100 and p≠47,53,59,67,83 or 89, then the equation x2-1=q~n+1 has no positive integer solution (x,n).
Key concepts: Diophantine equation, Integer (computer science), Prime (order theory), Mathematics, Combinatorics, Diophantine set, Prime factor, Discrete mathematics