On the Diophantine equation \(y^2=4q^n+4q+1\) (Q1071797): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Nicholas Tzanakis / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Frits Beukers / rank | |||
Normal rank |
Revision as of 18:18, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Diophantine equation \(y^2=4q^n+4q+1\) |
scientific article |
Statements
On the Diophantine equation \(y^2=4q^n+4q+1\) (English)
0 references
1986
0 references
This paper deals with the equation \(y^2=4q^n+4q+1\) in the unknowns \(n,y\in\mathbb N\) and \(q\) is a fixed prime power. It arises from coding theory as Calderbank's equation. The methods used are the reviewer's hypergeometric method and algebraic considerations, but the equation is not completely solved. However, by an alternative use of the hypergeometric method the authors have recently shown in a forthcoming paper that the only solutions are \((y,n)=(2q+1,2)\) or, when \(q=3\), \((y,n)=(5,1),\;(11,3)\).
0 references
[n,k] codes over GF(q)
0 references
higher degree Diophantine equation
0 references
Calderbank's equation
0 references
hypergeometric method
0 references