FADWAS.ABUMURIEFAH.PDFVIP

IJMMS 28:8 (2001) 493–497 PII. S0161171201006445 ? Hindawi Publishing Corp. ON THE DIOPHANTINE EQUATION x3 = dy2 ±q6 FADWA S. ABU MURIEFAH (Received 21 December 2000) Abstract. Let q3 denote an odd prime and d a positive integer without any prime factor p ≡ 1 (mod3). In this paper, we have proved that if (x,q) = 1, then x3 = dy2 ±q6 has exactly two solutions provided q
±1 (mod24). 2000 Mathematics Subject Classi?cation. 11D41. Cohn [1] and recently Zhang [2, 3] have solved the Diophantine equation x3 = dy2 ±q6 (1) when q = 1,3,4, under some conditions on d. In this paper, we consider the general case of (1) where q ≠ 3 is any odd prime by using arguments similar to those used by Cohn [1]. Let (x,y) ∈ Z × Z be a solution of (1) with x,y 0, then the solution is trivial if x = 0, ±q2 or y =±1. We need the following lemma. Lemma 1. The equation p2 = a4 ?3b2, where p denotes an odd prime and (p,a) = l, may have a solution in positive integers a and b only if p ≡±1 (mod24). Proof. Suppose 3b2 = a4 ?p2. Then clearly a is odd and b is even. Since a4 ≡ 3b2 (modp), and (p,a) = 1 therefore the Legendre symbol (3/p) = 1 and so p ≡±1 (mod12). Now (a2 +p,a2 ?p) = 2 implies that a2 ±p = 3.2c2, (2) a2 ?p = 2d2, (3) where 2cd = b and (c,d) = 1. Whence a2 = 3c2 +d2. (4) Here d is odd, otherwise we get a contradiction modulo 4. Then considering (3) modulo 8, we get p ≡±1 (mod8). This completes the proof. Now we consider the upper sign in (1), our main result is laid down in the following. Theorem 2. Let d be a positive integer without prime factor