In this paper,we have proved that if one of the following conditions is satisfed,then the equations in title has no positive integer solution:①D=∏si=1P i or D=2∏si=1P i and \{ P i≡3 (mod 4)\} (1≤i≤s) or P i≡5 (...In this paper,we have proved that if one of the following conditions is satisfed,then the equations in title has no positive integer solution:①D=∏si=1P i or D=2∏si=1P i and \{ P i≡3 (mod 4)\} (1≤i≤s) or P i≡5 (mod 8) (i≤i≤s); ② D=∏si=1P i-1 (mod 12), 1≤s≤7 and \{D≠3·5·7·11·17·577,7·19·29·41·59·577;\} ③ D=2∏si=1P i,1≤s≤6 and \{D ≠2·17,2·3·5·7·11·17,2·17·113·239·337·577·665857;\} ④ D=∏si=1P i≡-1 (mod 12), 1≤s≤3 and D≠ 5·7,29·41·239.展开更多
We obtain all positive integer solutions（m1,m2,a,b） with a ＆gt; b,gcd（a,b） = 1 to the system of Diophantine equations km21- lat1bt2a2r= C1,km22- lat1bt2b2r= C2,with C1,C2 ∈ {-1,1,-2,2,-4,4},and k,l,t1,t2,r ∈ Z ...We obtain all positive integer solutions（m1,m2,a,b） with a ＆gt; b,gcd（a,b） = 1 to the system of Diophantine equations km21- lat1bt2a2r= C1,km22- lat1bt2b2r= C2,with C1,C2 ∈ {-1,1,-2,2,-4,4},and k,l,t1,t2,r ∈ Z such that k ＆gt; 0,l ＆gt; 0,r ＆gt; 0,t1 ＆gt; 0,t2 0,gcd（k,l） = 1,and k is square-free.展开更多
Let a and b be positive integers, with a not perfect square and b > 1. Recently, He, Togband Walsh proved that the Diophantine equation x2-a((bk-1)/(b-1))2=1 has at most three solutions in positive integers. Moreov...Let a and b be positive integers, with a not perfect square and b > 1. Recently, He, Togband Walsh proved that the Diophantine equation x2-a((bk-1)/(b-1))2=1 has at most three solutions in positive integers. Moreover, they showed that if max{a,b} > 4.76·1051, then there are at most two positive integer solutions (x,k). In this paper, we sharpen their result by proving that this equation always has at most two solutions.展开更多
文摘In this paper,we have proved that if one of the following conditions is satisfed,then the equations in title has no positive integer solution:①D=∏si=1P i or D=2∏si=1P i and \{ P i≡3 (mod 4)\} (1≤i≤s) or P i≡5 (mod 8) (i≤i≤s); ② D=∏si=1P i-1 (mod 12), 1≤s≤7 and \{D≠3·5·7·11·17·577,7·19·29·41·59·577;\} ③ D=2∏si=1P i,1≤s≤6 and \{D ≠2·17,2·3·5·7·11·17,2·17·113·239·337·577·665857;\} ④ D=∏si=1P i≡-1 (mod 12), 1≤s≤3 and D≠ 5·7,29·41·239.
基金supported by the Guangdong Provincial Natural Science Foundation (Grant Nos.10152606101000000 and S2012040007653)National Natural Science Foundation of China (Grant No.11271142)
文摘We obtain all positive integer solutions（m1,m2,a,b） with a ＆gt; b,gcd（a,b） = 1 to the system of Diophantine equations km21- lat1bt2a2r= C1,km22- lat1bt2b2r= C2,with C1,C2 ∈ {-1,1,-2,2,-4,4},and k,l,t1,t2,r ∈ Z such that k ＆gt; 0,l ＆gt; 0,r ＆gt; 0,t1 ＆gt; 0,t2 0,gcd（k,l） = 1,and k is square-free.
基金the first two authors has been partially supported by a LEA Franco-Roumain Math-Mode projectPurdue University North Central for the support
文摘Let a and b be positive integers, with a not perfect square and b > 1. Recently, He, Togband Walsh proved that the Diophantine equation x2-a((bk-1)/(b-1))2=1 has at most three solutions in positive integers. Moreover, they showed that if max{a,b} > 4.76·1051, then there are at most two positive integer solutions (x,k). In this paper, we sharpen their result by proving that this equation always has at most two solutions.
