On the Diophantine equation \(x^3 = dy^2 \pm q^6\) (Q1607770)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the Diophantine equation x^3 = dy^2 q^6 |
scientific article; zbMATH DE number 1780289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Diophantine equation \(x^3 = dy^2 \pm q^6\) |
scientific article; zbMATH DE number 1780289 |
Statements
On the Diophantine equation \(x^3 = dy^2 \pm q^6\) (English)
0 references
13 August 2002
0 references
Let \(q > 3\) denote an odd prime and \(d\) a positive integer without any prime factor \(p \equiv 1 (\mod 3)\). In this paper, the author states that if \((x,q) = 1\), then \(x^3 = dy^2 \pm q^6\) has exactly two solutions provided \(q\not\equiv \pm 1 \pmod {24}\). However the proof seems to be incorrect.
0 references
0.8172529935836792
0 references
0.794514536857605
0 references
