Pythagorician Divisors and Applications to Some Diophantine Equations

We consider the Pythagoras equation X2 +Y2 = Z2, and for any solution of the type (a,b = 2sb1 ≠0,c) ∈ N*3, s ≥ 2, b1odd, (a,b,c) ≡ (±1,0,1)(mod 4), c > a , c > b, and gcd(a,b,c) = 1, we then prove the Pythagorician divisors Theorem, which results in the following: , where (d,d′′) (resp. (e,en)) are unique particular divisors of a and b, such that a = dd′′ (resp. b = ee′′ ), these divisors are called: Pythagorician divisors from a, (resp. from b). Let’s put λ ∈{0,1}, defined by: and S = s -λ (s -1). Then such that . Moreover the map is a bijection. We apply this new tool to obtain a new classification of the primitive, positive and non-trivial solutions of the Pythagoras equations: a2 + b2 = c2 via the Pythagorician parameters (d,e,S ). We obtain for (d, e) fixed, the equivalence class of any Pythagorician solution (a,b,c), checking , namely: . We also update the solutions of some Diophantine equations of degree 2, already known, but very important for the resolution of other equations. With this tool of Pythagorean divisors, we have obtained (in another paper) new recurrent methods to solve Fermat’s equation: a4 + b4 = c4, other than usual infinite descent method;and to solve congruent numbers problem. We believe that this tool can bring new arguments, for Diophantine resolution, of the general equations of Fermat: a2p + b2p = c2p and ap + bp = cp. MSC2020-Mathematical Sciences Classification System: 11A05-11A51-11D25-11D41-11D72.

A Note on Diophantine Equation Ax^4+ 1 = By^2 and Erds' Conjecture on Combinatorial Number

A necessary and suffcient condition is given for the equation Ax4+ 1 =By2 to have positive integer solution, and an effective method is derived for solving equation a2x4 + 1 = By2 in positive integers x, y for given ho and B completely. Also, using a recently result of Ribet, Darmon and Merel, we proved that Erdos’ conjecture on combinatorial number is right.

On Diophantine Equation X(X+1)(X+2)(X+3)=14Y(Y+1)(Y+2)(Y+3)

The Diophantine equation X（ X ＋ 1 ） （ X ＋ 2 ） （ X ＋ 3 ） = 14Y（ Y ＋ 1 ） （ Y ＋ 2 ） （ Y ＋ 3 ） still remains open. Using recurrence sequence, Maple software, Pell equation and quadraric residue, this paper proved it has only two positive integer solutions, i. e., （X,Y） = （5,2） ,（7,3）.

A Kind of Diophantine Equations in Finite Simple Groups

In this paper, we prove that if p, q are distinct primes, (p,q)≡(1,7) (mod 12) and Legendres symbol pq=1 , then the equation 1+p a=2 bq c+2 dp eq f has only solutions of the form (a,b,c,d,e,f)=(t,0,0,0,t,0), where t is a non negative integer. We also give all solutions of a kind of generalized Ramanujan Nagell equations by using the theories of imaginary quadratic field and Pells equation.

Complete solution of the diophantine equation A^2x^4-By^2=1 and some related problems

We prove that diophantine equation in title has at most one positive integer solution for any positive integers A>1, B>1. It follows that Lucas problem is very simple to solve and a recent result of Bennett is very simple to prove.

Heron Triangle and Diophantine Equation

In this paper, we study the quantic Diophantine equation （1） with elementary geometry method, therefore all positive integer solutions of the equation （1） are obtained, and existence of Heron triangle whose median lengths are all positive integer are discussed here.

A New Proof of Diophantine Equation ■

By using algebraic number theory and p-adic analysis method, we give a new and simple proof of Diophantine equation （^n2） = （^m4）

On the Diophantine Equation y^2= px（x^2＋ 2）

For any fixed odd prime p, let N（p） denote the number of positive integer solutions （x, y） of the equation y^2 = px（x^2 ＋ 2）. In this paper, using some properties of binary quartic Diophantine equations, we prove that ifp ≡ 5 or 7（mod 8）, then N（p） = 0; ifp ≡ 1（mod 8）, then N（p） 〈 1; if p〉 3 andp ≡ 3（rood 8）, then N（p） ≤ 2.

A Variant of Fermat’s Diophantine Equation

A variant of Fermat’s last Diophantine equation is proposed by adjusting the number of terms in accord with the power of terms and a theorem describing the solubility conditions is stated. Numerically obtained primitive solutions are presented for several cases with number of terms equal to or greater than powers. Further, geometric representations of solutions for the second and third power equations are devised by recasting the general equation in a form with rational solutions less than unity. Finally, it is suggested to consider negative and complex integers in seeking solutions to Diophantine forms in general.

Non-Negative Integer Solutions of Two Diophantine Equations 2x + 9y = z2 and 5x + 9y = z2

In this paper, we study two Diophantine equations of the type px + 9y = z2 , where p is a prime number. We find that the equation 2x + 9y = z2 has exactly two solutions (x, y, z) in non-negative integer i.e., {(3, 0, 3),(4, 1, 5)} but 5x + 9y = z2 has no non-negative integer solution.

Diophantine Equations and the Freeness of Mobius Groups

Let p and q be two fixed non zero integers verifying the condition gcd(p,q) = 1. We check solutions in non zero integers a1,b1,a2,b2 and a3 for the following Diophantine equations: (B1) (B2) . The equations (B1) and (B2) were considered by R.C. Lyndon and J.L. Ullman in [1] and A.F. Beardon in [2] in connection with the freeness of the M?bius group generated by two matrices of namely and where .?They proved that if one of the equations (B1) or (B2) has solutions in non zero integers then the group is not free. We give algorithms to decide if these equations admit solutions. We obtain an arithmetical criteria on p and q for which (B1) admits solutions. We show that for all p and q the equations (B1) and (B2) have only a finite number of solutions.

Diophantine Quotients and Remainders with Applications to Fermat and Pythagorean Equations

Diophantine equations have always fascinated mathematicians about existence, finitude, and the calculation of possible solutions. Among these equations, one of them will be the object of our research. This is the Pythagoras’- Fermat’s equation defined as follows. (1) when , it is well known that this equation has an infinity of solutions but has none (non-trivial) when . We also know that the last result, named Fermat-Wiles theorem (or FLT) was obtained at great expense and its understanding remains out of reach even for a good fringe of professional mathematicians. The aim of this research is to set up new simple but effective tools in the treatment of Diophantine equations and that of Pythagoras-Fermat. The tools put forward in this research are the properties of the quotients and the Diophantine remainders which we define as follows. Let a non-trivial triplet () solution of Equation (1) such that . and are called the Diophantine quotients and remainders of solution . We compute the remainder and the quotient of b and c by a using the division algorithm. Hence, we have: and et with . We prove the following important results. if and only if and if and only if . Also, we deduce that or for any hypothetical solution . We illustrate these results by effectively computing the Diophantine quotients and remainders in the case of Pythagorean triplets using a Python program. In the end, we apply the previous properties to directly prove a partial result of FLT. .

On the Exponential Diophantine Equation x^2 + (3a^2 -1)~m = (4a^2 -1)~n

We apply a new, deep theorem of Bilu, Hanrot ＆ Voutier and some fine results on the representation of the solutions of quadratic Diophantine equations to solve completely the exponential Diophantine equation x^2＋（3a^2-1）^m = （4a^2-1）^n when 3a^2-1 is a prime or a prime power.

A Conjecture Concerning the Pure Exponential Diophantine Equation a^x+b^y=c^z

Let a, b, c, r be fixed positive integers such that a^2 ＋ b^2 = c^r, min（a, b, c, r） 〉 1 and 2 r. In this paper we prove that if a ≡ 2 （mod 4）, b ≡ 3 （mod 4）, c 〉 3.10^37 and r 〉 7200, then the equation a^x ＋ b^y = c^z only has the solution （x, y, z） = （2, 2, r）.

On the solutions of a system of two Diophantine equations

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.

On the Diophantine Equation x^2-kxy+y^2+lx=0

Let l be a given nonzero integer. The authors give an explicit characterization of the positive integer k that makes the Diophantine equation x2 - kxy ＋ y2 ＋ 1x = 0 have infinitely many positive integer solutions （x, y）.

Solving Multivariate Polynomial Matrix Diophantine Equations with Gr?bner Basis Method

Different from previous viewpoints,multivariate polynomial matrix Diophantine equations are studied from the perspective of modules in this paper,that is,regarding the columns of matrices as elements in modules.A necessary and sufficient condition of the existence for the solution of equations is derived.Using powerful features and theoretical foundation of Gr?bner bases for modules,the problem for determining and computing the solution of matrix Diophantine equations can be solved.Meanwhile,the authors make use of the extension on modules for the GVW algorithm that is a signature-based Gr?bner basis algorithm as a powerful tool for the computation of Gr?bner basis for module and the representation coefficients problem directly related to the particular solution of equations.As a consequence,a complete algorithm for solving multivariate polynomial matrix Diophantine equations by the Gr?bner basis method is presented and has been implemented on the computer algebra system Maple.

The Relationship between the Nonexistence of Generalized Bent Functions and Diophantine Equations

Two new results on the nonexistence of generalized bent functions are presented by using properties of the decomposition law of primes in cyclotomic fields and properties of solutions of some Diophantine equations, and examples satisfying our results are given.

Inductive Rings and Systems of Diophantine Equations

In this paper, by using model-theoretic methods, it is shown that some systems of unsolved cubic diophantine equations in number theory can have solutions in certain inductive extension rings of the ring I of rational integers. These inductive rings are not fields, and every element of them is a sum of 4 cubes and a sum of 3 squares. Also some of them satisfy the Goldbach conjecture and some others don＇t.

The Diophantine equation x^3±(3~K)~3=Dy^2

Ljunggren proved that the equations x^3+1=Dy^2, D】2, d|D, 3D, d is not a square (1) and x^3-1=Dy^2, d is not prime of the form 6l+1 (1)′have one positive integral solution at most. Ko Chao and Sun Chi proved that eqs.(1) and(1)′both have no nontrivial integral solution. In this letter, we prove the following theorems.