∎
11institutetext: Mehdi Baghalaghdam 22institutetext: Department of Mathematics
Faculty of Science
Azarbaijan Shahid Madani University
Tabriz 53751-71379, Iran
22email: [email protected]
33institutetext: Farzali Izadi 44institutetext: Department of Mathematics
Faculty of Science
Urmia University
Urmia 165-57153, Iran
44email: [email protected]
A note on the high power Diophantine equations
Mehdi Baghalaghdam
Farzali Izadi
(Received: date / Accepted: date)
Abstract
In this paper, we solve the simultaneous Diophantine equations (SDE) x1μ+x2μ+⋯+xnμ=k⋅(y1μ+y2μ+⋯+yknμ), μ=1,3, where n≥3, and k=n, is a divisor of n (kn≥2), and obtain nontrivial parametric solution for them. Furthermore we present a method for producing another solution for the above Diophantine equation (DE) for the case μ=3, when a solution is given. We work out some examples and find nontrivial parametric solutions for each case in nonzero integers.
Also we prove that the other DE ∑i=1npi⋅xiai=∑j=1mqj⋅yjbj, has parametric solution and infinitely many solutions in nonzero integers with the condition that: there is a i such that pi=1, and
(ai,a1⋅a2⋯ai−1⋅ai+1⋯an⋅b1⋅b2⋯bm)=1, or there is a j such that
qj=1, and (bj,a1⋯an⋅b1⋯bj−1⋅bj+1⋯bm)=1.
Finally we study the DE xa+yb=zc.
Keywords:
Simultaneous Diophantine equations, Equal sums of the cubes, High power Diophantine equations.
MSC:
Primary11D45, Secondary11D72, 11D25.
1 Introduction
The cubic Diophantine equations has been studied by some mathematicians.
Gerardin gave partial solutions of the SDE
[TABLE]
in 1915-16 (as quoted by Dickson, pp. 565, 713 of 5 (5))
and additional partial solutions were given by Bremner 1 (1). Subsequently, complete solutions were given
in terms of cubic polynomials in four variables by Bremner and Brudno 2 (2),
as well as by Labarthe 7 (7).
In 4 (4) Choudhry presented a complete four-parameter solution of (1)
in terms of quadratic polynomials in which each parameter occurs only in the first degree.
In this paper we are interested in the study of the SDE
[TABLE]
where n≥3, and k=n, is a divisor of n (kn≥2).
Also we study the other DE
[TABLE]
where m,n,ai,bi∈N and pi,qi∈Z.
This is a generalization of the Fermat’s equation.
A common generalization of Fermat’s equation is Axa+Byb+Czc=0, where a, b, c ∈N≥2 and A,B,C∈Z are given integers with ABC=0 and x,y,z∈Z are variables.
In 1995, Darmond and Granville (See 6 (6)) proved:
If A,B,C∈Z , ABC=0 and a,b,c∈N≥2 be such that a1+b1+c1<1, then the equation Axa+Byb+Czc=0 has only finitely many
solutions x,y,z∈Z with (x,y,z)=1.
The following theorem is due to Beukers (See 3 (3)):
Let A,B,C∈Z , ABC=0 and a,b,c∈N≥2 such that a1+b1+c1>1. Then the equation Axa+Byb+Czc=0 has either zero or infinitely many solutions x,y,z∈Z with (x,y,z)=1.
To the best of our knowledge the SDE (2) and the DE (3) has not already been considered by any
other authors.
We prove the following main theorems:
Main Theorem 1
Let n≥3, and k=n, be a divisor of n (kn≥2).
Then the SDE (2)
have infinitely many nontrivial parametric solutions in nonzero integers.
Main Theorem 2
Let m,n,ai,bi∈N and pi,qi∈Z. Suppose that there is a i such that pi=1, and
(ai,a1⋅a2⋯ai−1⋅ai+1⋯an⋅b1⋅b2⋯bm)=1
or there is a j such that
qj=1, and (bj,a1⋯an⋅b1⋯bj−1⋅bj+1⋯bm)=1.
Then the DE (3)
has parametric solution and infinitely many solutions in nonzero integers. This solves the DE xa+yb=zc in the special cases of (a,b,c)=1, or (a,b,c)=2.
2 The SDE i=1∑nxiμ=k⋅j=1∑knyjμ; μ=1,3
In this section, we proof the first main theorem.
Proof
:
Firstly, it is clear that if
X=(x1,⋯,xn,y1,⋯,ykn), and
Y=(X1,⋯,Xn,Y1,⋯,Ykn),
be two solutions for the SDE (2), then for any arbitrary rational number t, X+tY is also a solution for μ=1, i.e.,
(x1+tX1)+(x2+tX2)+⋯+(xn+tXn)=k⋅[(y1+tY1)+(y2+tY2)+⋯+(ykn+tYkn)].
We say that X is a trivial parametric solution of the SDE (2), if it is nonzero and satisfies the system trivially.
Let X, and Y be two proper trivial parametric solutions of the SDE (2), (we will introduce them later).
We suppose that X+tY, is also a solution for the case μ=3, where t is a parameter, we wish to find t.
By plugging
X+tY=(x1+tX1,x2+tX2,⋯,xn+tXn,y1+tY1,y2+tY2,⋯,ykn+tYkn),
into the SDE (2), we get:
(x1+tX1)3+(x2+tX2)3+⋯+(xn+tXn)3=k⋅[(y1+tY1)3+(y2+tY2)3+⋯+(ykn+tYkn)3].
Since X and Y are solutions for the SDE (2), after some simplifications, we obtain:
3t2(x1X12+x2X22+⋯+xnXn2−ky1Y12−ky2Y22−⋯−kyknYkn2)+
3t(x12X1+x22X2+⋯+xn2Xn−ky12Y1−ky22Y2−⋯−kykn2Ykn)=0.
Therefore t=0 or
[TABLE]
By substituting t in the above expressions, and clearing the denominator B3, we get an integer solution for the SDE (2) as follows:
(x1′,x2′,⋯,xn′,y1′,y2′,⋯,ykn′)=
(x1B+AX1,x2B+AX2,⋯,xnB+AXn,y1B+AY1,y2B+AY2,⋯,yknB+AYkn).
If we pick up trivial parametric solutions X and Y properly, we will get a nontrivial parametric solution for the SDE (2).
We should mention that not every trivial parametric solutions of X and Y necessarily give rise to a nontrivial parametric solution for the SDE (2). So the trivial parametric solutions must be chosen properly.
Now we introduce the proper trivial parametric solutions.
For the sake of simplicity, we only write down the trivial parametric solutions for the left hand side of the SDE (2). It is clear that the trivial parametric solutions for the right hand side of the SDE (2) can be similarly found by the given trivial parametric solutions of the left hand side of the SDE (2).
Let pi, qi, si, r_{i}$$\in\mathbb{Z}.
A) The case n≥3 and kn≥3:
There are 4 different possible cases for n:
1. n=2α+1, α is even.
Xleft=(x1,x2,⋯,xn)=(p1,−p1,p2,−p2,⋯,pα,−pα,0), and
Yleft=(X1,X2,⋯,Xn)=
(r1,r2,−r1,−r2,r3,r4,−r3,−r4,⋯,rα−1,rα,−rα−1,0,−rα).
2. n=2α+1, α is odd.
Xleft=(p1,−p1,p2,−p2,⋯,pα,−pα,0), and
Yleft=(r1,r2,−r1,−r2,⋯,−rα−2,−rα−1,rα,0,−rα).
3. n=2α, α is even.
Xleft=(p1,−p1,p2,−p2,⋯,pα,−pα), and
Yleft=(r1,r2,−r1,−r2,⋯,rα−1,rα,−rα−1,−rα).
4. n=2α, α is odd.
Xleft=(p1,−p1,p2,−p2,⋯,pα,−pα), and
Yleft=(r1,r2,−r1,−r2,⋯,rα−2,rα−1,−rα−2,rα,−rα−1,−rα).
B) The case n≥3 and kn=2:
5. n=2k≥3 and kn=2.
X=(p1,−p1,p2,−p2,⋯,pk,−pk,q1,−q1),
Y=(r1,r2,r1,r2,⋯,r1,r2).
(In the final case we present the trivial parametric solutions X, and Y, completely.)
Finally, it can be easily shown that for every i=j, we have:
xiB+AXi =± (xjB+AXj), yiB+AYi =± (yjB+AYj) and
x_{i}B+AX_{i}$$\neq\pm (yjB+AYj),
i.e., it is really a nontrivial parametric solution in terms of the parameters pi, qi, ri and si.
It is clear that by fixing all of the parameters pi, qi, ri and si, but one parameter, we can obtain a nontrivial one parameter parametric solution for the SDE (2) and by changing properly the fixed values, finally get infinitely many nontrivial one parameter parametric solutions for the SDE (2).
Now, the proof of the first main theorem is completed. ♠
Now, we work out some examples.
Example 1
aμ+bμ+cμ+dμ+eμ+fμ=3⋅(gμ+hμ)*; μ=1,3.
Trivial parametric solutions (case 5):
X=(x1,x2,x3,x4,x5,x6,x7,x8)=(p1,−p1,p2,−p2,p3,−p3,q1,−q1),
Y=(y1,y2,y3,y4,y5,y6,y7,y8)=(r1,r2,r1,r2,r1,r2,r1,r2),
A=x12y1+x22y2+x32y3+x42y4+x52y5+x62y6−3x72y7−3x82y8,
B=−x1y12−x2y22−x3y32−x4y42−x5y52−x6y62+3x7y72+3x8y82,
nontrivial parametric solution:
a=x1B+Ay1=p1B+r1A,
b=x2B+Ay2=−p1B+r2A,
c=x3B+Ay3=p2B+r1A,
d=x4B+Ay4=−p2B+r2A,
e=x5B+Ay5=p3B+r1A,
f=x6B+Ay6=−p3B+r2A,
g=x7B+Ay7=q1B+r1A,
h=x8B+Ay8=−q1B+r2A.
Example 1:
p1=2, p2=3, p3=4, q1=5, r1=1, r2=6,
Solution:
371μ+756μ+476μ+651μ+581μ+546μ=3⋅(686μ+441μ); μ=1,3..
Example 2:
p1=7, p2=9, p3=5, q1=2, r1=4, r2=1,
Solution:
257μ+458μ+167μ+548μ+347μ+368μ=3⋅(482μ+233μ); μ=1,3.
Example 2
aμ+bμ+cμ+dμ+eμ+fμ+gμ+hμ=2⋅(iμ+jμ+kμ+lμ)*; μ=1,3.
Trivial parametric solutions (case 3):
X=(x1,x2,⋯,x12)=*
(p1,−p1,p2,−p2,p3,−p3,p4,−p4,q1,−q1,q2,−q2),*
Y=(y1,y2,⋯,y12)=*
(r1,r2,−r1,−r2,r3,r4,−r3,−r4,s1,s2,−s1,−s2),
*
Example:
p1=2, p2=5, p3=7, p4=6, q1=5, q2=3, r1=7, r2=8,
r3=9, r4=9, s1=10, s2=6, A=−593, B=1129,
Solution:
(−1893)μ+(−7002)μ+9796μ+(−901)μ+2566μ+(−13240)μ+12111μ+(−1437)μ=2⋅[(−285)μ+(−9203)μ+9317μ+171μ]; μ=1,3
Example 3
aμ+bμ+cμ+⋯+mμ+nμ+oμ=5⋅(pμ+qμ+rμ)*; μ=1,3.
Trivial parametric solutions (case 2):
X=(x1,x2,⋯,x18)=**
(p1,−p1,p2,−p2,p3,−p3,p4,−p4,p5,−p5,p6,−p6,p7,−p7,0,q1,−q1,0),
Y=(y1,y2,⋯,y18)=
(r1,r2,−r1,−r2,r3,r4,−r3,−r4,r5,r6,−r5,−r6,r7,0,−r7,s1,0,−s1),
Example:
p1=1, p2=3, p3=5, p4=4, p5=1, p6=2, p7=3, q1=2, r1=2, r2=3, r3=5, r4=1, r5=6, r6=6,
, r7=7, s1=3,
A=−19, B=−253,
Solution:
(−291)μ+196μ+(−721)μ+816μ+(−1360)μ+1246μ+(−917)μ+1031μ+(−367)μ+139μ+(−392)μ+620μ+(−892)μ+759μ+133μ=5⋅[(−563)μ+506μ+57μ]; μ=1,3
Example 4
aμ+bμ+cμ+dμ=2⋅(eμ+fμ)*; μ=1,3.
Trivial parametric solutions(case 5):
X=(u,u,v,v,u,v),
Y=(−v,1,−1,v,−u,u),
nontrivial parametric solution:
a=−u2−uv+uv3+2u4−vu2+v3−v4,
b=−u2v2−uv−uv3+2u4+2u3v−u2v−v2+v3+2u3−2uv2,
c=−v4+2u2v2−v3−2u3−u2−uv−uv3+2u3v+u2v+2uv2,
d=u2v2−3uv3+4u3v−uv−v2+vu2−v3,
e=u2v2−u2−u3−uv−2uv3+3u3v+uv2,
f=−uv−v2−v4+u3v+u3−uv2+2u4.
Example:
u=2, v=1, or u=10, v=7, or u=100, v=11, or u=100, v=1,
Solutions:
1μ+4μ+5μ+8μ=2⋅(2μ+7μ); μ=1,3.
201μ+257μ+168μ+224μ=2⋅(180μ+245μ); μ=1,3.
900895μ+1002355μ+100874μ+202334μ=2⋅(148400μ+954829μ); μ=1,3.
1μ+201μ+10000μ+10200μ=2⋅(100μ+10101μ); μ=1,3.
Example 5
aμ+bμ+cμ+dμ+eμ+fμ=2⋅(gμ+hμ+iμ)*; μ=1,3.
Trivial parametric solutions (case: 4, 1):
X=(1,v,u,v,−u,−1,v,u,−u)
Y=(v,v,u,1,−1,−u,−u,v,u),
nontrivial parametric solution:
a=−3u3+v4−v+u+u2+vu2−uv+2v2u−u3v+2v3u−2v2u2,
b=−4u3v+4v3u,
c=−4u3+4v2u2,
d=−v4+v−u3−u2−u+uv−3u3v+2u2v2+2v3u−u2v+2v2u,
e=3u4−v−v3−v2+u+uv−2v2u2+v2u+v3u−2vu3−2v2u+2u2v,
f=4u3+u4+v−u+v2+v3−3v2u−2vu2−uv−uv3−2u2v2+2u3v,
g=u4+u3+u2−v3−v4−v2−u3v+v3u+u2v−uv2,
h=−3u4+u2+u3+v2+v3+v4−2uv+u3v+v3u−v2u−u2v,
i=2u4−2u3−2u2+2uv+2v3u+2v2u−4vu3.
Example:
u=2, v=1, or u=2, v=10, or u=7, v=100,
Solutions:
(−8)μ+(−8)μ+(−16)μ+(−8)μ+11μ+13μ=2⋅[7μ+(−11)μ+(−4)μ]*; μ=1,3.
*
563μ+320μ+64μ+(−211)μ+(−5)μ+(−91)μ=2⋅[(−388)μ+536μ+172μ];* μ=1,3.
*
173777μ+42800μ+2996μ+(−130549)μ+7510μ+(−10934)μ=2⋅[(−144557)μ+165839μ+21518μ]; μ=1,3.
Example 6
aμ+bμ+cμ=dμ+eμ+fμ*; μ=1,3.
Trivial parametric solutions (case 2):
X=(u,v,1,u,v,1),
Y=(v,−1,−u,−1,−u,v),
nontrivial parametric solution:
a=−u3−v3+vu3−v3u−2uv+v2u−vu2+u2−v2,
b=−uv3−vu2+uv+v2u2+v3−u2v+u+u2+v2u+v,
c=−uv2−v+u+vu2+v2−u3v+v2u+u3+v2u2+uv,
d=−u2v2−uv−u3+u2+vu3+2uv2−u2v+v2+u+u2+v,
e=−uv3−v2−vu2+2uv+2u2v2+v3−u3v+uv2+u2+u3,
f=−uv2−v−u2+u+u2v2−v3−uv−v3u.
Example:
u=10, v=3,
Solution:
762μ+145μ+251μ=195μ+377μ+586μ; μ=1,3.
Example 7
aμ+bμ+cμ+dμ+eμ+fμ+gμ+hμ+iμ=3⋅(jμ+kμ+lμ)*; μ=1,3.
Trivial parametric solutions (case: 1, 2):
X=(x1,x2,⋯,x12)=*
(u,v,−u,t,−s,−t,0,s,−v,t,0,−t),*
Y=(y1,y2,⋯,y12)=*
(v,t,−s,u,−t,s,−v,−u,0,0,t,−t),*
Example 1:
u=1, v=2, s=3, t=10,
Solution:
1168μ+7346μ+(−2003)μ+(−4185)μ+(−6844)μ+7525μ+(−1670)μ+(−2341)μ+1004μ=3⋅[(−5020)μ+8350μ+(−3330)μ]*; μ=1,3.
*
Example 2:
u=1, v=10, s=20, t=30,
Solution:
83515μ+208720μ+(−173005)μ+(−170301)μ+(−148970)μ+358230μ+(−89490)μ+(−128449)μ+59750μ=3⋅[(−179250)μ+268470μ+(−89220)μ]; μ=1,3.
3 Producing another solution of the DE i=1∑nxi3=k⋅j=1∑knyj3, when a solution is given.
Let X=(x1,x2,⋯,xn,y1,y2,⋯,ykn) be a primitive solution for the DE
[TABLE]
under conditions that :
x1+x2+⋯+xn−ky1−ky2−⋯−kykn=0, and
−2x12−2x22−⋯−2xn2+2ky12+2ky22+⋯+2kykn2=0.
(These conditions will be necessary because we wish the other solution not to be trivial.)
We try to find another solution by using the first solution.
Define two variables function:
F(x,y):=(2x1x+y)3+(2x2x+y)3+⋯+(2xnx+y)3
−k(2y1x+y)3−k(2y2x+y)3−⋯−k(2yknx+y)3.
(Also, we may define: F(x,y):=(tx1x+y)3+(tx2x+y)3+⋯+(txnx+y)3
−k(ty1x+y)3−k(ty2x+y)3−⋯−k(tyknx+y)3, where t is an arbitrary integer.)
It is clear that if F(x,y)=0, then
(2x1x+y,2x2x+y,⋯,2xnx+y,2y1x+y,2y2x+y,⋯,2yknx+y),
is another solution for the DE (4).
We have
F(x,y)=6xy[(2x12+2x22+⋯+2xn2−2ky12−⋯−2kykn2)x+(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)y].
Therefore if we define
x:=x1+x2+⋯+xn−ky1−ky2−⋯−kykn=0,
and
y:=−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2=0,
then we get F(x,y)=0, which gives rise to another solution for the DE (4):
x1′=2x1x+y=2x1(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2),
x2′=2x2x+y=2x2(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2),
⋮
xn′=2xnx+y=2x2(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2),
y1′=2y1x+y=2y1(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2),
y2′=2y2x+y=2y2(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2),
⋮
ykn′=2yknx+y=2y2(x1+x2+⋯+xn−ky1−ky2−⋯−kykn)+
(−2x12−2x22−⋯−2xn2+2ky12+⋯+2kykn2).
By continuing this method for the new obtained solution, we get infinitely many solutions for the DE (4). This means that we may get infinitely many nontrivial solutions for the DE (4) by using a given solution.
If the primitive solution X be a parametric solution, we get another parametric solution for the DE (4).
Example 8
a3+b3+c3=A3+B3+C3
Let (a,b,c,A,B,C) be a solution for the above DE.
We find another solution by using the first solution.
Example 1: (a,b,c,A,B,C)=(1,155,209,−41,227,107),
Another solution:
1253+1693+2503=623+2773+973*.
*
*Example 2: *(a,b,c,A,B,C)=(−62,169,250,−125,277,97),
Another solution:
813+125553+169293=(−3321)3+183873+86673.
4 The DE i=1∑npi⋅xiai=j=1∑mqj⋅yjbj;
In this section, we prove the second main theorem. Let the above DE be in the form:
x1a1+p2x2a2+p3x3a3+⋯+pnxnan=q1y1b1+⋯+qmymbm,
where (a1,a2⋯an⋅b1⋯bm)=1.
Then we have:
[TABLE]
Define:
m:=q1s1b1+⋯+qmsmbm−p2t2a2−p3t3a3−⋯−pntnan,
where ti and si are arbitrary integers. Now we introduce the our parametric solution:
y1=s1⋅mb1k,
y2=s2⋅mb2k,
⋮
ym=sm⋅mbmk,
x1=ma1k+1,
x2=t1⋅ma2k,
⋮
xn=tn⋅mank,
where k is a natural number such that
k≡0(modb1),
k≡0(modb2),
⋮
k≡0(modbm),
k≡0(moda2),
⋮
k≡0(modan),
k≡−1(moda1).
From the Chinese remainder theorem, we know that there exists a solution for k, since (a1,a2⋯an⋅b1⋯bm)=1, that is, the all exponents used in xi and yj
are natural numbers.
We claim that this is a parametric solution for the DE (5):
q1y1b1+⋯+qmymbm−p2x2a2−p3x3a3−⋯−pnxnan=
q1⋅(s1mb1k)b1+q2⋅(s2mb2k)b2+⋯+qm⋅(smmbmk)bm−p2(t2⋅ma2k)a2−
⋯−pn(tn⋅mank)an=
q1⋅s1b1⋅mk+q2⋅s2b2⋅mk+⋯+qm⋅smbm⋅mk−p2⋅t2a2⋅mk−⋯−pn⋅tnan⋅mk=
mk(q1⋅s1b1+q2⋅s2b2+⋯+qm⋅smbm−p2⋅t2a2−⋯−pn⋅tnan)=mk⋅m=
mk+1=(mak+1)a=x1a.
Now the proof of the second main theorem is completed. Since si, and ti were arbitrary, we also obtain infinitely many solutions for the above DE.
Example 9
*The DE x15+x26=y17+y28+y39, has infinitely many solutions in integers.
Since we have: x15=y17+y28+y39−x26 and (5,6⋅7⋅8⋅9)=1, then by using the previous theorem, we conclude that the aforementioned DE has infinitely many solutions in integers.
Put: m:=r7+s8+t9−w6, where r, s, t and w are arbitrary integers. As an example, if we let: (r,s,t,w)=(3,2,1,3) and k=504, then we get:
m=1715,
y1=r⋅m7k=3⋅171572,
y2=s⋅m8k=2⋅171563,
y3=t⋅m9k=171556,
x1=m5k+1=1715101,
x2=w⋅m6k=3⋅171584.
Namely, we have:
(1715101)5+(3⋅171584)6=(3⋅171572)7+(2⋅171563)8+(171556)9.*
*
By letting (r,s,t,w)=(3,2,2,2) and k=504, we get:
(2891101)5+(2⋅289184)6=(3⋅289172)7+(2⋅289163)8+(2⋅289156)9.
By changing (r,s,t,w), we obtain infinitely many solutions.
Example 10
*The DE x5=6(y17+y27+y37) has infinitely many solutions in integers. If we put: m:=6r7+6s7+6t7, where (r,s,t)= (1,1,1) and k=14, we get:
m=18,
y1=r⋅m7k=182,
y2=s⋅m7k=182,
y3=t⋅m7k=182,
x=m5k+1=183.
*Namely, we have: (183)5=6((182)7+(182)7+(182)7).
*
By letting: (r,s,t)=(3,2,5) and k=14, we obtain:
(4826403)5=6((3⋅4826402)7+(2⋅4826402)7+(5⋅4826402)7).
Example 11
*The DE x7=13y111+11y213
has infinitely many solutions in integers. If we put: m:=13r11+11s13, where (r,s,t)=(1,1,1) and k=286, we get:
m=24,
y1=r⋅m11k=2426,
y2=s⋅m13k=2422,
x=m7k+1=2441.
Namely, we have: (2441)7=13⋅(2426)11+11⋅(2422)13.
Example 12
Is the DE x15+x25=y16+y26
solvable? Yes. To do this, let y1=y2. Then we have: x15+x25=2y16. We may let x1=2u, x2=2v. So we get: y16=24(u5+v5), that is solvable.
5 The DE xa+yb=zc
In this part, we solve the above DE, where a, b, c are fixed natural numbers and x, y, z are variables. We have three cases: (a,b,c)=1 , (a,b,c)≥3 or (a,b,c)=2.
If (a,b,c)=1, by using the second main theorem, we proved that the DE has infinitely many solutions in integers.
If (a,b,c)≥3, the Fermat last theorem says that the DE dose not have any solutions in integers. Then it suffices to study the case (a,b,c)=2. However, we know that the Diophantine equations x4+y4=z2 and x4−y4=z2 have not any solutions in integers. So it suffices only to study the case where at most one of a, b, c is divisible by 4. In the sequel, we study this case by proving several theorems.
Theorem 5.1
The DE x2+y2B=z2C, where B and C are both odd and (B,C)=1, has infinitely many solutions in integers.
Proof
: we have x2+(yB)2=(zC)2, then we get:
x=m2−n2,
yB=2mn,
zC=m2+n2.
We may suppose that m=2B−1⋅t1B, n=t2B. By plugging these into the equations, we get :
y=2t1t2,
x=22(B−1)⋅t12B−t22B,
zC=22(B−1)⋅t12B+t22B.
Since (C,2B)=1, the DE zC=22(B−1)⋅t12B+t22B is solvable for z, t1, t2 from the second main theorem. Also x and y are computed from
y=2t1t2,
x=22(B−1)⋅t12B−t22B, as well.
The proof is completed.
Theorem 5.2
The DE x2A+y2B=z2C, where A, B, C are all odd and (A,C)=1 and (AC,B)=1 has infinitely many solutions in integers.
We note that in this case (a,b,c)=(2A,2B,2C)=2 and none of a=2A, b=2B and c=2C is divisible by 4. We wish to solve xa+yb=zc in the case of (a,b,c)=2 and at most one of a, b, c is divisible by 4, this theorem is one of the desired cases where (a,b,c)=2 and none of a, b and c is divisable by 4.
Proof
: We know that the DE XA+YB=ZC with the condition (AC,B)=1 is solvable and its solution is:
m:=rC−sA,
Z=mCk⋅r,
X=mAk⋅s,
Y=mBk+1,
and
k≡0(modAC),
k≡−1(modB),
where r and s are arbitrary integers.
Now, if we obtain a solution for the DE XA+YB=ZC from the solution just introduced, where X, Y and Z are squares, then we get a solution for the DE x2A+y2B=z2C by putting X=x2, Y=y2 and Z=z2.
From the above solution for X, Y and Z , we see that if m, r and s be squares, then X, Y and Z will be squares, as well.
Then since m, r and s are related together with m:=rC−sA, we see that it suffices to solve the DE M2=R2C−S2A, where we set:
m=M2,
r=R2,
s=S2.
(we wanted m, r and s to be squares).
Fortunately the DE M2=R2C−S2A is solvable from the previous theorem due to (A,C)=1. Then we obtain m, r, s, and in the end we get x, y, z, and the proof is completed.
Theorem 5.3
The DE x4A+y2B=z2C, where B and C are both odd and (A,C)=1 and (AC,B)=1 has infinitely many solutions in integers.
Proof
: We know that the DE X2A+YB=ZC with the condition (2AC,B)=1 is solvable and its solution is:
m:=rC−s2A,
Z=mCk⋅r,
X=m2Ak⋅s,
Y=mBk+1,
and
k≡0(modC),
k≡0(mod2A),
k≡−1(modB),
where r and s are arbitrary integers.
Now, if we obtain a solution for the DE X2A+YB=ZC from the solution just introduced, where X, Y and Z are squares, next we get a solution for the DE x4A+y2B=z2C by putting x=X2, y=Y2 and z=Z2.
From the above solution for X, Y, and Z, we see that if m, r and s be squares, then X, Y, and Z will be squares, as well.
Then since m, r and s are related together with m:=rC−s2A, we see that it suffices to solve the DE M2=R2C−S4A, where we set:
m=M2,
r=R2,
s=S2.
(We wanted m, r and s to be squares).
Fortunately the DE M2=R2C−S4A is solvable from the previous theorems:
we have M2+(S2A)2=(RC)2, and then we get:
M=t12−t22,
S2A=2t1t2,
RC=t12+t22.
We may suppose that t1=22A−1⋅p2A, t2=q2A. By substituting these in the above equations, we get :
S=2pq,
M=22(2A−1)⋅p4A−q4A,
RC=22(2A−1)⋅p4A+q4A.
Since (C,4A)=1, the DE RC=22(2A−1)⋅p4A+q4A is solvable for R, p and q, from the second main theorem. And M, and S are computed from
S=2pq,
M=22(2A−1)⋅p4A−q4A, as well,
the proof is completed.
We note that the previous theorem is the case that in the DE xa+yb=zc, exactly one of a or b is divisible by 4, and (a,b,c)=2.
Example 13
*We wish to solve the DE x6+y10=z14.
We know that the DE x3+y5=z7 is solvable and its solution is:
m:=r7−s3,
z=m7k⋅r,
x=m3k⋅s,
y=m5k+1,
and
k≡0(mod21),
k≡−1(mod5),
where r, and s are arbitrary integers.
Now, if we obtain a solution for the DE x3+y5=z7 from the solution just introduced, where x, y and z are squares, then we get a solution for the DE x6+y10=z14.
From the above solution for x, y and z, we see that if m, r and s be squares, then x, y and z will be squares, as well.
Since m:=r7−s3, we see that it suffices to solve the DE M2=R14−S6, where:
m=M2,
r=R2,
s=S2.
Fortunately the DE M2=R14−S6 is solvable from the previous theorems:
we have M2+S6=R14, and then we get:
M=t12−t22,
S3=2t1t2,
R7=t12+t22.
We may suppose that t1=4p3,t2=q3. By substituting these in the above equations, we get :
S=2pq,
M=16p6−q6,
R7=16p6+q6.
Since (7,6)=1, the DE R7=16p6+q6 is solvable for R, p and q from the previous theorems:
M′:=16u6+v6,
p=M′6k⋅u,
q=M′6k⋅v,
R=M′7k+1,
and
K≡0(mod6) ,
k≡−1(mod7).
By putting u=v=1, k=6, we get:
(1528⋅17170⋅2)6+(1517⋅17102)10=(1512⋅1773)14.
Theorem 5.4
The DE x2+y2=z2n⋅c, where c is odd and n≥2, is solvable.
Proof
: We try to solve the DE by using induction. If n=2, we have
x2+y2=z4c,
then
x=m2−n2,
y=2mn,
z2c=m2+n2.
Again we put:
n=2t1t2,
m=2t12−t22,
zc=t12+t22.
Since (2,c)=1, the DE zc=t12+t22 is solvable, then the main DE is solvable as well, and the proof for n=2 is complete.
Next, suppose the above DE is solvable for n, then we solve it for n+1. We have:
x2+y2=z2n+1⋅c,
then
x=m2−n2,
y=2mn,
z2n⋅c=m2+n2.
Since the DE z2n⋅c=m2+n2, is solvable for m, n, and z by our assumption, then the DE x2+y2=z2n+1⋅c, is solvable as well, and the proof is completed.
Remark 1
*If in the previous theorem, we take c=1, we can solve it by another beautiful method. We start from the identity
(m2−n2)2+(2mn)2=(m2+n2)2.
We see that: if in the above identity m2+n2, to be square, then we get a solution for the DE x2+y2=z4. As an example, we can get m and n from the Pythagorean triples. For m=4, n=3, we obtain:
72+242=(52)2=(32+42)2=54.
By letting n=7, m=24, we obtain:
5722+3362=(72+242)2=(54)2=58.
By continuing
in this way, if we put m=572, n=336, we get a solution for the DE x2+y2=z16.
If we change m, n, we obtain another identity. If m=120, n=119, we have :
2392+285602=138.
It is clear that by using this method we can find infinitely many solutions for the DE
x2+y2=z2n⋅c with (x,y,z)=1, as mentioned in the Beukers theorem (see 3 (3)**) in the introduction.
In the end, it is clear that at some variables parametric solutions obtained for the Diophantine equations, we may get one variable parametric solutions for each case of the above Diophantine equations by fixing the other variables.
Acknowledgements
The authors would like to express their hearty thanks to the
anonymous referee for a careful reading of the paper and for many
careful comments and remarks which improved its quality.