http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
( Elif Kizildere ),( Gökhan Soydan ) 호남수학회 2020 호남수학학술지 Vol.42 No.1
Let p be a prime number with p > 3, p ≡ 3 (mod 4) and let n be a positive integer. In this paper, we prove that the Diophantine equation (5pn<sup>2</sup> - 1)<sup>x</sup> + (p(p - 5)n<sup>2</sup> + 1)<sup>y</sup> = (pn)<sup>z</sup> has only the positive integer solution (x; y; z) = (1; 1; 2) where pn ≡ ±1 (mod 5). As an another result, we show that the Diophantine equation (35n<sup>2</sup> - 1)<sup>x</sup> + (14n<sup>2</sup> + 1)<sup>y</sup> = (7n)<sup>z</sup> has only the positive integer solution (x, y, z) = (1, 1, 2) where n ≡ ±3 (mod 5) or 5 | n. On the proofs, we use the properties of Jacobi symbol and Baker's method.