Abstract
This paper proves that for all positive integers n, the equation
where p = 1 or p is a prime congruent to 1 (mod8), does not have solutions in positive integers.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
The problem concerning the sum of rationals whose product is 1 has been studied by many authors. Cassels [5] showed that the equation
does not have solutions in integers. Bremner and Guy [3] found integer solutions to the equation
for many values of n in the range |n|≤ 1000. Sierpinski [6] asked if the equation
has solutions in positive integers? Bondarenko [1] showed that the equation
does not have solutions in positive integers if \(3\nmid k\). Using the technique developed by Bremner and Tho [4], which is based on Stoll’s idea [8], we will prove the following results:
Theorem 1
Let n be a positive integer. Then the equation
does not have solutions in positive integers.
Theorem 2
Let n be a positive integer, p - a prime congruent to 1 (mod8). Then the equation
does not have solutions in positive integers.
An equivalent form of Theorem 1 is that there are no four positive rationals whose product is 1 and sum is an integer divisible by 8. In the next section, we give a proof for Theorem 2. Theorem 1 can be proven in a similar (and simpler) way. All computations in the paper are done in Magma [2].
2 Proof of Theorem 2
2.1 Notation
For a prime q and a nonzero q-adic number a, denote vq(a) the highest power of q dividing a. By definition, \(\mathbb {Q}_{\infty }=\mathbb {R}\). Let \(k=\mathbb {Q}_{q}\) or \(k=\mathbb {R}\). For a,b in k∗, the Hilbert symbol (a,b)q is defined by
When \(k=\mathbb {Q}_{\infty }\), the symbol \((a,b)_{\infty }\) is defined similarly. The following properties of Hilbert symbol are true, see Serre [7, Chap. III]:
-
(i)
For \(a,b,c\in \mathbb {Q}_{q}^{\ast }\),
$$ \begin{array}{@{}rcl@{}} (a,bc)_{q}&=&(a,b)_{q}(a,c)_{q},\\ (a,b^{2})_{q}&=&1. \end{array} $$ -
(ii)
For \(a,b\in \mathbb {Q}^{\ast }\),
$$ (a,b)_{\infty}{\prod}_{q\text{ prime}}(a,b)_{q}=1. $$ -
(iii)
For \(a,b\in \mathbb {Q}_{q}^{\ast }\), let a = qαu, b = qβv, where α = vq(a) and β = vq(b). Then
$$ \begin{array}{@{}rcl@{}} (a,b)_{q}&=&(-1)^{\alpha\beta(q-1)/2}\left( \frac{u}{q}\right)^{\beta}\left( \frac{v}{q}\right)^{\alpha},\quad\text{ if } q\neq 2,\\ (a,b)_{q}&=&(-1)^{\frac{(u-1)(v-1)}{4}+\frac{\alpha(v^{2}-1)}{8}+\frac{\beta(u^{2}-1)}{8}},\quad\text{ if } q=2, \end{array} $$where \(\left (\frac {u}{q}\right )\) denotes the Legendre symbol.
2.2 Proof
Assume that (x,y,z,w) is a positive integer solution to
with \(\gcd (x,y,z,w)=1\).
Consider two quadratic forms:
Lemma 1
Proof
From (1) and the AM-GM inequality, we have
Thus,
Hence,
Similarly,
Thus,
Hence,
Since (8pn2 − 1)2 − 1 is not a perfect square, we have y2 − 2(8pn2 − 1)yw + w2 < 0 and x2 − 2(8pn2 − 1)xz + z2 < 0. Hence D(x,z) < 0 and H(y,w) < D(y,w) < 0. □
From (1):
Fix x, z and consider the projective curve Fx,z(Y,W,d) = 0, where
Then, Fx,z(y,w,1) = Fx,z(0,1,0) = 0. So, Fx,z(Y,W,d) = 0 is isomorphic to the elliptic curve
via the rational maps ϕ: Fx,z → Cx,z,
and \(\psi \colon C_{x,z}\rightarrow F_{x,z}\),
Let D = D(x,z), H = H(x,z). Let
Lemma 2
If q is an odd prime, then
Proof
Let \(d=\gcd (x,z)\), x = dx1, y = dy1, where \(x_{1},z_{1}\in \mathbb {Z}^{+}\) with \(\gcd (x_{1},z_{1})=1\), \(u_{1}=\frac {u}{d^{4}}\) and \(\omega _{1}=\frac {\omega }{d^{6}}\). Then
From (3), we also have
Therefore, it is enough to prove Lemma 2 in the case \(\gcd (x,z)=1\).
Let u = qru0, where r = vq(u). We consider the following cases:
Case 1: r < 0. From (3), we have
Thus
Therefore, 2|r. Now
Taking reduction (mod p) shows u0 is a square (mod q). Thus \(u_{0} \in \mathbb {Z}_{q}^{2}\). Because r is even, we have \(u=q^{r}u_{0}\in \mathbb {Q}_{q}^{2}\). Hence (D,u)q = 1.
Case 2: r = 0. Let D = qkD1, where k = vq(D). Because \(D\in \mathbb {Z}\), we have k ≥ 0. Suppose 2|k. Because u and D1 are units in \(\mathbb {Z}_{q}\), we have (u,D1)q = 1. Thus
We consider the case \(2\nmid k\). Then,
Hence,
We have
-
(i)
Suppose \(q\nmid u+\frac {A}{2}\). Then \(u^{2}+Au+B\in \mathbb {Z}_{q}^{2}\). Because ω2 = u(u2 + Au + B), we have \(u\in \mathbb {Z}_{q}^{2}\). Thus (u,D)q = 1.
-
(ii)
Suppose \(q | u+\frac {A}{2}\). Thus \(u\equiv -\frac {A}{2}~ (\text {mod} q)\). Therefore, \(q\nmid A\). Because q|D, we have
$$ A=pxz(2xz-D)\equiv 2px^{2}z^{2}\pmod q. $$Because \(q\nmid u\) and \(q\nmid A\), we have \(q\nmid 2px^{2}z^{2}\). Now \(q\nmid 2pxz\), so \(\gcd (D,H)=1\). Let \(S=u+\frac {A}{2}\) and \(T=\frac {HD}{4}\). Because \(\gcd (H,D)=1\) and q|D, we have vq(T) = vq(D) = k. Let S = qlS1, T = qkT1, where l = vq(S). From ω2 = u(u2 + Au + B) and \(q\nmid u\), we have
$$ v_{q}(u^{2}+Au+B)=2v_{q}(\omega). $$Thus 2|vq(u2 + Au + B). On the other hand,
$$ v_{q}(u^{2}+Au+B)=v_{q}(S^{2}+T)=v_{q}(q^{2l}{S_{1}^{2}}+q^{k}T_{1}). $$Since \(2\nmid k\), we must have 2l < k. Thus,
$$ u^{2}+Au+B=q^{2l}({S_{1}^{2}}+q^{k-2l}T_{1})\in \mathbb{Q}_{q}^{2}. $$Hence, \(u=\frac {\omega ^{2}}{u^{2}+Au+B}\in \mathbb {Q}_{q}^{2}\). So (u,D)q = 1.
Case 3: r > 0.
-
(a)
Suppose \(q\nmid pxz\). Since (u2 + Au + B)α2 + Dβ2 = γ2 has a solution (1,0,px2z2) (mod q), it has a nontrivial solution in \(\mathbb {Q}_{q}\). Therefore,
$$ (u^{2}+Au+B,D)_{q}=1. $$Because u(u2 + Au + B) = ω2≠ 0, we have (u,D)q = 1.
-
(b)
Suppose q|xz. Then q|x or q|z. If q|x, then
$$ D=x^{2}+z^{2}-2p(8n^{2}-1)xz\equiv z^{2}\pmod q. $$Note that \(\gcd (x,z)=1\), thus \(D\in \mathbb {Z}_{q}^{2}\). Therefore, (u,D)q = 1. Similarly, we also have (u,D)q = 1 if q|z.
-
(c)
Suppose \(q\nmid xz\) and q = p. Then u = pru0. So
$$ \omega^{2}=p^{r}u_{0}(p^{2r}{u_{0}^{2}}+Ap^{r}u_{0}+p^{2}x^{4}z^{4}). $$We have two subcases:
-
(i)
r ≥ 2. Then 2vp(ω) = r + 2. Thus 2|r. We now have
$$ (\omega p^{-r/2})^{2}=u_{0}(p^{2r-2}{u_{0}^{2}}+Ap^{r-2}u_{0}+x^{4}z^{4}). $$Because p|A, a reduction (mod p) gives u0x4z4 is a square (mod p). Therefore, \(u_{0}\in \mathbb {Z}_{q}^{2}\). Thus,
$$ (u,D)_{p}=(2^{s}u_{0},D)_{p}=1. $$ -
(ii)
r = 1. Then
$$ \begin{array}{@{}rcl@{}} \omega^{2}&=&pu_{0}(p^{2}{u_{0}^{2}}+pAu_{0}+p^{2}x^{4}z^{4})\\ &=&p^{3}u_{0}({u_{0}^{2}}+xz(16pn^{2}xz-x^{2}-z^{2})u_{0}+x^{4}z^{4}). \end{array} $$Thus p divides
$$ {u_{0}^{2}}+xz(-x^{2}-z^{2})u_{0}+x^{4}z^{4}=(u_{0}-x^{3}z)(u_{0}-xz^{3}). $$Therefore,
$$ u_{0}\equiv x^{3}z \pmod p\qquad \text{ or }\qquad u_{0}\equiv xz^{3} \pmod p. $$If u0 ≡ x3z (modp), then
$$ \begin{array}{@{}rcl@{}} (pu_{0},p)_{p}&=&(-1)^{(p-1)/2}\left( \frac{u_{0}}{p}\right)=\left( \frac{x^{3}z}{p}\right)\\ &=&\left( \frac{-x^{4}}{p}\right)=\left( \frac{-1}{p}\right)\\ &=&(-1)^{\frac{p-1}{2}}\\ &=&1. \end{array} $$Similarly, if xz3 ≡ 0 (modp), then (pu0,p)p = 1. So it is always true that
$$ (pu_{0},p)_{p}=1. $$(4)Now
$$ D=(x+z)^{2}-16pn^{2}xz\equiv (x+z)^{2}\pmod p. $$Suppose \(p\nmid x+z\). Then \(D\in \mathbb {Z}_{p}^{2}\). Hence (u,D)p = 1. We consider the case p|x + z. Let x + z = psf, where s = vp(x + y) > 0. Then
$$ D=p(p^{2s-1}f^{2}-16n^{2}xz). $$-
Suppose that \(p\nmid n \), then
$$ p^{2s-1}f^{2}-16n^{2}xz \equiv (4nx)^{2} \pmod p. $$Hence, \(p^{2s-1}f^{2}-16n^{2}xz \in \mathbb {Z}_{p}^{2}\). Let \(D=p{D_{1}^{2}}\), where \(D_{1}\in \mathbb {Z}_{p}\). Then from (4),
$$ (u,D)_{p}=(pu_{0},p{D_{1}^{2}})_{p}=(pu_{0},p)_{p}=1. $$ -
Suppose that p|n. Let n = ptn1, where t = vp(n) > 0. Then
$$ D=p^{2s}f^{2}-16p^{2t+1}xz. $$If s ≤ t, then
$$ D=p^{2s}(f^{2}-16p^{2t+1-2s}{n_{1}^{2}}xz). $$Thus \(D\in \mathbb {Z}_{p}^{2}\). Hence (u,D)p = 1. We consider the case s > t. Then
$$ D=p^{2t+1}(p^{2s-2t-1}f^{2}-16{n_{1}^{2}}xz). $$Because
$$ p^{2s-2t-1}f^{2}-16{n_{1}^{2}}xz\equiv 16{n_{1}^{2}}x^{2}\pmod p, $$we have \(D=p^{2s+1}{D_{2}^{2}}\), where \(D_{2}\in \mathbb {Z}_{p}\). From (4), we have
$$ (u,D)_{p}=(pu_{0},p^{2r+1}{D_{2}^{2}})_{p}=(pu_{0},p)_{p}=1. $$
-
-
(i)
□
Lemma 3
If \(4\nmid x+z\), then
Proof
Let \(d=\gcd (x,z)\), let x = dx1, y = dy1, where \(x_{1},z_{1}\in \mathbb {Z}^{+}\) with \(\gcd (x_{1},z_{1})=1\), let \(u_{1}=\frac {u}{d^{4}}\) and \(\omega _{1}=\frac {\omega }{d^{6}}\). Then
From (3), we also have
Of course, \(4\nmid x_{1}+z_{1}\) if \(4\nmid x+z\). Therefore, it is enough to prove Lemma 3 in the case \(\gcd (x,z)=1\).
If \(2\nmid x+z\), then
So \(D\in \mathbb {Z}_{2}^{2}\), hence (D,u)2 = 1. Let us consider the case 2|x + z. Because \(4\nmid x+z\), we can write x + z = 2h with \(2\nmid h\). Then
We consider two cases:
-
(a)
2|n. Then h2 − 4pn2xz ≡ 1 (mod8). Thus \(D\in \mathbb {Z}_{2}^{2}\). Hence (D,u)2 = 1.
-
(b)
\(2\nmid n\). Then pn2xz ≡ 1 (mod4), and so h2 − 4pn2xz ≡ 5 (mod8). Thus D = 4D1, where D1 ≡ 5 (mod8).
Let u = 2ru1, where r = v2(u). Then
$$\omega^{2}=2^{r}u_{1}(2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B).$$-
(i)
Suppose r ≥ 3. Then r = 2v2(ω). We have
$$ (2^{-r/2}\omega)^{2}=u_{1}(2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B). $$Because
$$ \begin{array}{@{}rcl@{}} 2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B&\equiv& B \pmod 8\\ &\equiv& p^{2}x^{4}z^{4} \pmod 8\\ &\equiv& 1 \pmod 8, \end{array} $$we have u1 ≡ 1 (mod8). Thus \(u_{1} \in \mathbb {Z}_{2}^{2}\), so \(u=2^{r}u_{1}\in \mathbb {Z}_{2}^{2}\). Hence (u,D)2 = 1.
-
(ii)
Suppose r = 2. Then
$$ \left( \frac{\omega}{2}\right)^{2}=u_{1}(2^{4}{u_{1}^{2}}+2^{2}Au_{1}+B). $$Taking a reduction (mod 8) gives u1 ≡ 1 (mod8). Therefore, \(u=2^{2}u_{1}\in \mathbb {Z}_{2}^{2}\). Hence (u,D)2 = 1.
-
(iii)
Suppose r = 1. Then
$$ \omega^{2}=2u_{1}(4{u_{1}^{2}}+2Au_{1}+B), $$what is impossible (mod 2).
-
(iv)
Suppose r = 0. Then u = u1 and D = 22D1, where D1 ≡ 5 (mod8). Therefore,
$$ \begin{array}{@{}rcl@{}} (u,D)_{2}&=&(u_{1},2^{2}D_{1})_{2}\\ &=&(u_{1},D_{1})_{2}\\ &=&(-1)^{(u_{1}-1)(D_{1}-1)/4}\\ &=&1. \end{array} $$ -
(v)
Suppose r < 0. Then
$$ \omega^{2}=2^{3r}u_{1}\left( {u_{1}^{2}}+2^{-r}Au_{1}+2^{-2r}B\right). $$Therefore, 3r = 2v2(ω). Thus r ≤− 2. Then
$$ \left( 2^{-3r/2}\omega\right)^{2}=u_{1}\left( {u_{1}^{2}}+2^{-r}Au_{1}+2^{-2r}B\right). $$Note that 2|A, so taking a reduction (mod 8) gives u1 ≡ 1 (mod8). Thus \(u_{1}\in \mathbb {Z}_{2}^{2}\), so \(u\in \mathbb {Z}_{2}^{2}\). Hence (u,D)2 = 1.
-
(i)
□
Lemma 4
If \(4\nmid x+z\), then
Proof
Since (D,u)q = 1 for all prime q, and
we have
□
Lemma 5
If q is an odd prime, then
Proof
Because A2 − 4B = p2x2z2DH, we have
So
where \(\alpha =u+\frac {A}{2}\) and \(\beta =\frac {pxz}{2}\). Thus
On the other hand, (u,−u)q = 1 and (u,D)q = 1; therefore,
□
Lemma 6
If \(4\nmid x-z\), then
Proof
Similar to the proof of Lemma 3, it is enough to consider the case \(\gcd (x,z)=1\). Suppose \(2\nmid x-z\), then
Thus \(H\in \mathbb {Z}_{2}^{2}\), and hence (u,H)2 = 1. We consider the case 2|x − z. Because \(4\nmid x-z\), let x − z = 2k, where \(2\nmid k\). Then
We consider two cases:
-
(a)
2|n. Then k2 − 4pn2xz ≡ 1 (mod8). Thus \(H\in \mathbb {Z}_{2}^{2}\) and (u,H)2 = 1.
-
(b)
\(2\nmid n\). Then 4pn2xz ≡ 4 (mod8). Thus k2 − 4pn2xz ≡ 5 (mod8), so H = 4H1, where H1 ≡ 5 (mod8). Let u = 2ru1, where r = v2(u). Then
$$ \omega^{2}=2^{r}u_{1}(2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B). $$-
(i)
Suppose r ≥ 3. Then r = 2v2(ω). Thus 2|r. We have
$$ (2^{-r/2}\omega)^{2}=u_{1}(2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B). $$Taking reduction (mod 8) gives \(2^{2r}{u_{1}^{2}}+2^{r}Au_{1}+B\equiv 1~(\text {mod} 8)\). Hence \(u_{1} \in \mathbb {Z}_{2}^{2}\), thus \(u=2^{r}u_{1}\in \mathbb {Z}_{2}^{2}\). So (u,H)2 = 1.
-
(ii)
Suppose r = 2. Then
$$ \left( \frac{\omega}{2}\right)^{2}=u_{1}(2^{4}{u_{1}^{2}}+2^{2}Au_{1}+B). $$Taking reduction (mod 8) gives u1 ≡ 1 (mod8). Therefore, \(u\in \mathbb {Z}_{2}^{2}\). Hence (u,H)2 = 1.
-
(iii)
Suppose r = 1. Then
$$ \omega^{2}=2u_{1}(4{u_{1}^{2}}+2Au_{1}+B), $$what is impossible (mod 2).
-
(iv)
Suppose r = 0. Then u = u1 and H = 22H1, where H1 ≡ 5 (mod8). Therefore,
$$ \begin{array}{@{}rcl@{}} (u,H)_{2}&=&(u_{1},2^{2}H_{1})_{2}\\ &=&(u_{1},H_{1})_{2}\\ &=&(-1)^{(u_{1}-1)(H_{1}-1)/4}\\ &=&1. \end{array} $$ -
(v)
Suppose r < 0. Then
$$ \omega^{2}=\frac{u_{1}({u_{1}^{2}}+2^{-r}Au_{1}+2^{-2r}B)}{2^{-3r}}. $$Therefore, 2|r. Thus r ≤− 2. Now
$$ (2^{3r/2}\omega)^{2}=u_{1}({u_{1}^{2}}+2^{-r}Au_{1}+2^{-2r}B). $$Note that 2|A, so taking (mod 8) gives u1 ≡ 1 (mod8). Therefore, \(u_{1}\in \mathbb {Z}_{2}^{2}\), so \(u\in \mathbb {Z}_{2}^{2}\). Thus (u,H)2 = 1.
-
(i)
□
Lemma 7
If \(4\nmid x-z\), then
Proof
Since (u,H)q = 1 for all primes q and
we have
□
We summarize Lemmas 2, 3, 4, 5, 6, and 7 into the following proposition:
Proposition 1
-
(D(x,z),u)q = (H(x,z),u)q = 1 if q is an odd prime or \(q=\infty \).
-
\((D(x,z),u)_{2}=(D(x,z),u)_{\infty }=1\) if \(4\nmid x+z\).
-
\((H(x,z),u)_{2}=(H(x,z),u)_{\infty }=1\) if \(4\nmid x-z\).
In order for (2) to have a positive integer solutions, we seek for points (u,ω) on Cx,z such that ψ(u,ω) = (Y : W : d) satisfies d≠ 0, \(\frac {Y}{d}>0\) and \(\frac {W}{d}>0\). If u = 0, then ω = 0. Because ψ(0,0) = (1 : 0 : 0), we have u≠ 0. Therefore,
Multiplying two inequalities gives u < 0. Let
If ω≠ 0, then we consider the following cases:
-
\(4\nmid x+z\). From Proposition 1, we have \((D(x,z),u)_{\infty }=1\). Because D(x,z) < 0, by Lemma 1 we have u > 0, contradicting u < 0.
-
\(4\nmid x-z\). From Proposition 1, we have \((H(x,z),u)_{\infty }=1\). Because H(x,z) < 0, by Lemma 1 we have u > 0, contradicting u0 < 0.
-
4|x + z and 4|x − z. Let x = 2x1 and z = 2z1 with \(x_{1},z_{1}\in \mathbb {Z}\) and \(2\nmid x_{1},z_{1}\). Then \(4\nmid x_{1}+z_{1}\) or \(4\nmid x_{1}-z_{1}\). From ω2 = u(u2 + Au + B), we have
$$ \left( \frac{\omega}{2^{6}}\right)^{2}=\frac{u}{2^{4}}\left( \left( \frac{u}{2^{4}}\right)^{2}+A_{1}\left( \frac{u}{2^{4}}\right)+B_{1}\right), $$where \(A_{1}=px_{1}z_{1}(16pn^{2}x_{1}z_{1}-{x_{1}^{2}}-{z_{1}^{2}})\) and \(B_{1}=p^{2}{x_{1}^{4}}{z_{1}^{4}}\). Now \(4\nmid x_{1}-z_{1}\) or \(4\nmid x_{1}+z_{1}\), so we have \(\big (D(x_{1},z_{1}),\frac {u}{2^{4}}\big )_{2}=1\) or \(\big (H(x_{1},z_{1}),\frac {u}{2^{4}}\big )_{2}=1\). In addition,
$$ (D(x,z),u)_{2}=\left( 2^{2}D(x_{1},z_{1}),2^{4}\frac{u}{2^{4}}\right)_{2}=\left( D(x_{1},z_{1}),\frac{u}{2^{4}}\right)_{2}. $$Similarly
$$ (H(x,z),u)_{2}=\left( H(x_{1},z_{1}),\frac{u}{2^{4}}\right)_{2}. $$So (D(x,z),u)2 = 1 or (H(x,z),u)2 = 1. Hence u > 0, contradicting u < 0.
Therefore, ω = 0. From (5), we have
$$ 4nxz-xy-zw=0. $$(6)Thus
$$ \frac{y}{z}+\frac{w}{x}=4n. $$Hence
$$ \frac{x}{y}+\frac{z}{w}=4np. $$(7)Now fix y, w and consider the equation Fy,w(X,Z,d) = 0, where
$$ F_{y,w}(X,Z,d)=X^{2}yZ+py^{2}Zwd^{2}+Z^{2}wX+pw^{2}Xyd^{2}-8npXZdyw. $$Then Fy,w(0,1,0) = Fy,w(x,z,1) = 0. So Fy,w(X,Z,d) = 0 is isomorphic to the elliptic curve
$$ C_{y,w}\colon \omega^{\prime2}=u^{\prime}\left( u^{\prime2}+pyw\left( 16n^{2}pyw-y^{2}-w^{2}\right)u^{\prime}+p^{2}y^{4}w^{4}\right), $$via the rational maps \(\alpha \colon F_{y,w}\rightarrow C_{y,w}\),
$$ \alpha(X:Z:d)=\left( \frac{-w^{2}pZy^{2}}{X},\frac{-py^{2}w^{2}Z(Xy+Zw-4npywd)}{Xd}\right), $$and \(\beta \colon E_{y,w}\rightarrow F_{y,w}\),
$$ \beta(u^{\prime},\omega^{\prime})=\left( pw^{2}(4npywu^{\prime}+\omega^{\prime}):-u^{\prime}(4npywu^{\prime}+\omega^{\prime}):wu^{\prime}(u^{\prime}-py^{3}w)\right). $$
We have the following result:
Proposition 2
-
\((D(y,w),u^{\prime })_{q}=(H(y,w),u^{\prime })_{q}=1\) if q is an odd prime.
-
\((D(y,w),u^{\prime })_{2}=(D(y,w),u^{\prime })_{\infty }=1\) if \(4\nmid y+w\).
-
\((H(y,w),u^{\prime })_{2}=(H(y,w),u^{\prime })_{\infty }=1\) if \(4\nmid y-w\).
Proof
The same as for Proposition 1. □
In order for (2) to have positive integer solutions, we seek for points \((u^{\prime },\omega ^{\prime })\) on Cy,w such that \(\beta (u^{\prime },\omega ^{\prime })=(X:Z:d)\) satisfies d≠ 0, \(\frac {X}{d}>0\) and \(\frac {Z}{d}>0\). If u = 0, then ω = 0. Because β(0,0) = (1 : 0 : 0). We must have u≠ 0. So
Multiplying together the two inequalities gives \(u^{\prime }<0\). Assume
If \(\omega ^{\prime }\neq 0\), we then consider the following cases:
-
\(4\nmid y+w\). From Proposition 2, we have \((D(y,w),u^{\prime })_{\infty }=1\), thus \(u^{\prime }>0\) because D(y,w) < 0 by Lemma 1. This contradicts \(u^{\prime }<0\).
-
\(4\nmid y-w\). From Proposition 2, we have \((H(y,w),u^{\prime })_{\infty }=1\). Because H(y,w) < 0, we have \(u^{\prime }>0\), contradicting \(u^{\prime }<0\).
-
4|y + w and 4|y − w. Then y = 2y1 and w = 2w1, where \(2\nmid y_{1},w_{1}\). Then \(4\nmid y_{1}+w_{1}\) or \(4\nmid y_{1}-w_{1}\). Then similar to the case \(4\nmid x+z\) and \(4\nmid x-z\), we have \((D(y,w),u^{\prime })_{\infty }=1\) or \((H(y,w),u^{\prime })_{\infty }=1\); the either case implies \(u^{\prime }>0\), which contradicts \(u^{\prime }<0\).
Therefore, \(\omega ^{\prime }=0\). From (8), we have
$$ xy+zw-4npyw=0. $$(9)$$ 4nxz=4npyw. $$Thus,
$$ \frac{x}{y}\frac{z}{w}=p. $$(10)$$ (4np)^{2}-4p=\left( \frac{x}{y}-\frac{z}{w}\right)^{2}. $$Thus \(4n^{2}p^{2}-p\in \mathbb {Q}^{2}\), hence \(4n^{2}p^{2}-p \in \mathbb {Z}^{2}\), impossible because \(p^{2}\nmid 4n^{2}p^{2}-p\). Therefore, there are no positive integer solutions to (1).
References
Bondarenko, A.V.: Investigation of one class of Diophantine equations. Ukr. Math. J. 52, 953–959 (2000)
Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system i: The user language. J. Symb. Comput. 24, 235–265 (1997)
Bremner, A., Guy, R.K.: Two more representation problems. Proc. Edinb. Math. Soc. 40, 1–17 (1997)
Bremner, A., Tho, N.X.: The equation (w + x + y + z)(1/w + 1/x + 1/y + 1/z) = n. Int. J. Number Theory 14, 1229–1246 (2018)
Cassels, J.W.S.: On a diophantine equation. Acta Arith. 6, 47–52 (1960)
Sierpinski, W.: 250 Problems in Elementary Number Theory. Elsevier, New York (1970)
Serre, J.-P.: A Course in Arithmetic. Graduate Texts in Mathematics, vol. 7. Springer, New York (1973)
Stoll, M.: Answer to MathOverflow Question: Estimating the size of size of solutions of a diophantine equation. https://mathoverflow.net/questions/227713/estimating-the-size-of-solutions-of-a-diophantine-equationhttps://mathoverflow.net/questions/227713/estimating-the-size-of-solutions-of-a-diophantine-equation
Acknowledgements
The author would like to thank Professor Andrew Bremner for suggesting this problem and to thank Professor Nguyen Duy Tan for many valuable conversations. This work is partially supported by Vietnam National Foundation for Science and Technology Development (NAFOSTED) [grant number 101.04-2019.314].
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Tho, N.X. On a Diophantine Equation. Vietnam J. Math. 50, 183–194 (2022). https://doi.org/10.1007/s10013-021-00503-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10013-021-00503-w