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.

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.

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）

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. .

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）.

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.

On the Diophantine Equation 1/x+1/y+1/z+1/w+1/(xyzw)=0

Mordell asked for the integer solutions of(1/x)+(1/y)+(1/z)+(1/w)+(1/xyxw)=0.(1)In this paper,we give some parametrio solutions of (1)and prove that thegeneral equationsum form i=1 to n(1/x)i)+multiply from i=1 to n=1(n>1)(2)

Fermat and Pythagoras Divisors for a New Explicit Proof of Fermat’s Theorem:a4 + b4 = c4. Part I

In this paper we prove in a new way, the well known result, that Fermat’s equation a4 + b4 = c4, is not solvable in ℕ , when abc≠0 . To show this result, it suffices to prove that: ( F 0 ): a 1 4 + ( 2 s b 1 ) 4 = c 1 4 , is not solvable in ℕ , (where a 1 , b 1 , c 1 ∈2ℕ+1 , pairwise primes, with necessarly 2≤s∈ℕ ). The key idea of our proof is to show that if (F0) holds, then there exist α 2 , β 2 , γ 2 ∈2ℕ+1 , such that ( F 1 ): α 2 4 + ( 2 s−1 β 2 ) 4 = γ 2 4 , holds too. From where, one conclude that it is not possible, because if we choose the quantity 2 ≤ s, as minimal in value among all the solutions of ( F 0 ) , then ( α 2 ,2 s−1 β 2 , γ 2 ) is also a solution of Fermat’s type, but with 2≤s−10) is solvable in ( a 1 ,2 s b 1 , c 1 ) , s ≥ 2 like above;afterwards, proceeding with “Pythagorician divisors”, we creat the notions of “Fermat’s b-absolute divisors”: ( d b , d ′ b ) which it uses hereafter. Then to conclude our proof, we establish the following main theorem: there is an equivalence between (i) and (ii): (i) (F0): a 1 4 + ( 2 s b 1 ) 4 = c 1 4 , is solvable in ℕ , with 2≤s∈ℕ , ( a 1 , b 1 , c 1 )∈ ( 2ℕ+1 ) 3 , coprime in pairs. (ii) ∃( a 1 , b 1 , c 1 )∈ ( 2ℕ+1 ) 3 , coprime in pairs, for wich: ∃( b ′ 2 , b 2 , b ″ 2 )∈ ( 2ℕ+1 ) 3 coprime in pairs, and 2≤s∈ℕ , checking b 1 = b ′ 2 b 2 b ″ 2 , and such that for notations: S=s−λ( s−1 ) , with λ∈{ 0,1 } defined by c 1 − a 1 2 ≡λ( mod2 ) , d b =gcd( 2 s b 1 , c 1 − a 1 )= 2 S b 2 and d ′ b = 2 s−S b ′ 2 = 2 s B 2 d b , where ( 2 s B 2 ) 2 =gcd( b 1 2 , c 1 2 − a 1 2 ) , the following system is checked: { c 1 − a 1 = d b 4 2 2+λ = 2 2−λ ( 2 S−1 b 2 ) 4 c 1 + a 1 = 2 1+λ d ′ b 4 = 2 1+λ ( 2 s−S b ′ 2 ) 4 c 1 2 + a 1 2 =2 b ″ 2 4;and this system implies: ( b 1−λ,2 4 ) 2 + ( 2 4s−3 b λ,2 4 ) 2 = ( b ″ 2 2 ) 2;where: ( b 1−λ,2 , b λ,2 , b ″ 2 )={ ( b ′ 2 , b 2 , b ″ 2 ) if λ=0 ( b 2 , b ′ 2 , b ″ 2 ) if λ=1;From where, it is quite easy to conclude, following the method explained above, and which thus closes, part I, of this article. .

Three- and Four-Dimensional Generalized Pythagorean Numbers

The Pythagorean triples (a, b | c) of planar geometry which satisfy the equation a2+b2=c2 with integers (a, b, c) are generalized to 3D-Pythagorean quadruples (a, b, c | d) of spatial geometry which satisfy the equation a2+b2+c2=d2 with integers (a, b, c, d). Rules for a parametrization of the numbers (a, b, c, d) are derived and a list of all possible nonequivalent cases without common divisors up to d2 is established. The 3D-Pythagorean quadruples are then generalized to 4D-Pythagorean quintuples (a, b, c, d | e) which satisfy the equation a2+b2+c2+d2=e2 and a parametrization is derived. Relations to the 4-square identity are discussed which leads also to the N-dimensional case. The initial 3D- and 4D-Pythagorean numbers are explicitly calculated up to d2, respectively, e2.

The Odd Solutions of Equations Involving Euler-Like Function

φe(n) is a function similar to Euler function φ(n). We discussed and obtained all the odd solutions of the equations φe(xy) = φe(x) + 2φe(y), φe(xy) = 2φe(x) + 3φe(y) and φe(xyz) = φe(x) + φe(y) + φe(z) by using the methods and techniques of elementary number theory.

Computational Resolution of a Boolean Equation of 21 Variables

The Alienor method has been elaborated at the beginning of the 1980s by Yves Cherruault and Arthur Guillez (1983). The following people have also greatly contributed to the improvement of this new optimization method: Blaise Somé, Gaspar Mora, Balira Konfé, Jean Claude Mazza and Esther Claudine Bityé Mvondo. The basic idea consists in using a reducing transformation allowing us to simplify a multivariable optimization problem to a new optimization problem according to a single variable. The rational gestion of enterprises leads generally to the use of Operational Research, often called management science. The term Operational Research means a scientific approach to decision making, that seeks optimization in a system. Consequently, it is better to take the right decisions. Otherwise, fatal consequences can occur instantaneously [1]. Generally, we have to maximize the global profit margin, taking into account some constraints. For instance, in an integer programming problem, some or all the variables are required to be nonnegative integers. In this paper, we present new reducing transformations for global optimization in integer, binary and mixed variables as well as the applications in Boolean algebra by solving a Boolean Equation of 21 variables. The applications in Operational Research are presented on various examples, resolved by using the tabulator Excel of Microsoft.

Type Synthesis of Walking Robot Legs

Walking robots use leg structures to overcome obstacles or move on complicated terrains. Most robots of current researches are equipped with legs of simple structure. The specific design method of walking robot legs is seldom studied. Based on the generalized-function(GF) set theory, a systematic type synthesis process of designing robot legs is introduced. The specific mobility of robot legs is analyzed to obtain two main leg types as the goal of design.Number synthesis problem is decomposed into two stages, actuation and constraint synthesis by name,corresponding to the combinatorics results of linear Diophantine equations. Additional restrictions are discussed to narrow the search range to propose practical limb expressions and kinematic-pair designs. Finally, all the fifty-one leg structures of four subtypes are carried out, some of which are chosen to make up robot prototypes, demonstrating the validity of the method. This paper proposed a novel type synthesis methodology, which could be used to systematically design various practical robot legs and the derived robots.