We consider the Pythagoras equation X<sup>2</sup> +Y<sup>2</sup> = Z<sup>2</sup>, and for any solution of the type (a,b = 2<sup>s</sup>b<sub>1 </sub>≠0,c) ...We consider the Pythagoras equation X<sup>2</sup> +Y<sup>2</sup> = Z<sup>2</sup>, and for any solution of the type (a,b = 2<sup>s</sup>b<sub>1 </sub>≠0,c) ∈ N<sup>*3</sup>, s ≥ 2, b<sub>1</sub>odd, (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,e<sup>n</sup>)) 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: a<sup>2</sup> + b<sup>2</sup> = c<sup>2</sup> 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: a<sup>4</sup> + b<sup>4 </sup>= c<sup>4</sup>, 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: a<sup>2p</sup> + b<sup>2p</sup> = c<sup>2p</sup> and a<sup>p</sup> + b<sup>p</sup> = c<sup>p</sup>. MSC2020-Mathematical Sciences Classification System: 11A05-11A51-11D25-11D41-11D72.展开更多
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)=...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.展开更多
In this paper, we study two Diophantine equations of the type p<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> , where p is a prime number. We find that the equation 2<sup>x</...In this paper, we study two Diophantine equations of the type p<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> , where p is a prime number. We find that the equation 2<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> has exactly two solutions (x, y, z) in non-negative integer i.e., {(3, 0, 3),(4, 1, 5)} but 5<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> has no non-negative integer solution.展开更多
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 (...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 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 Pyth...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. .展开更多
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...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.展开更多
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 nece...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.展开更多
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, an...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.展开更多
In this paper we prove in a new way, the well known result, that Fermat’s equation a<sup>4</sup> + b<sup>4</sup> = c<sup>4</sup>, is not solvable in ℕ , when abc≠0 . To show this ...In this paper we prove in a new way, the well known result, that Fermat’s equation a<sup>4</sup> + b<sup>4</sup> = c<sup>4</sup>, 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 (F<sub>0</sub>) 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−1<s , witch is absurd. To reach such a result, we suppose first that (F<sub>0</sub>) 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) (F<sub>0</sub>): 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. .展开更多
The Pythagorean triples (a, b | c) of planar geometry which satisfy the equation a<sup>2</sup>+b<sup>2</sup>=c<sup>2</sup> with integers (a, b, c) are generalized to 3D-Pythagorean ...The Pythagorean triples (a, b | c) of planar geometry which satisfy the equation a<sup>2</sup>+b<sup>2</sup>=c<sup>2</sup> with integers (a, b, c) are generalized to 3D-Pythagorean quadruples (a, b, c | d) of spatial geometry which satisfy the equation a<sup>2</sup>+b<sup>2</sup>+c<sup>2</sup>=d<sup>2</sup> 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 d<sup>2</sup> is established. The 3D-Pythagorean quadruples are then generalized to 4D-Pythagorean quintuples (a, b, c, d | e) which satisfy the equation a<sup>2</sup>+b<sup>2</sup>+c<sup>2</sup>+d<sup>2</sup>=e<sup>2</sup> 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 d<sup>2</sup>, respectively, e<sup>2</sup>.展开更多
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 primit...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.展开更多
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 pap...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).展开更多
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 ...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.展开更多
<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral p...<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>展开更多
For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all...For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all their Diophantine solutions. This provides two realizations (primary and secondary) of the Weyl group on the sets of Diophantine solutions of the equations of the ellipsoids. The primary realization of the Weyl group suggests an order on the Weyl group, which is stronger than the Chevalley-Bruhat ordering of the Weyl group, and which provides an algorithm for the Chevalley-Bruhat ordering. The secondary realization of the Weyl group provides an algorithm for constructing all reduced expressions for any of its elements, and thus provides another way for the Chevalley-Bruhat ordering of the Weyl group.展开更多
In quantitative decision analysis, an analyst applies mathematical models to make decisions. Frequently these models involve an optimization problem to determine the values of the decision variables, a system </spa...In quantitative decision analysis, an analyst applies mathematical models to make decisions. Frequently these models involve an optimization problem to determine the values of the decision variables, a system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> of possibly non</span></span><span style="font-family:Verdana;">- </span><span style="font-family:Verdana;">li</span><span style="font-family:Verdana;">near inequalities and equalities to restrict these variables, or both. In this</span><span style="font-family:""><span style="font-family:Verdana;"> note, </span><span style="font-family:Verdana;">we relate a general nonlinear programming problem to such a system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> in</span><span style="font-family:Verdana;"> such </span><span style="font-family:Verdana;">a way as to provide a solution of either by solving the other—with certain l</span><span style="font-family:Verdana;">imitations. We first start with </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> and generalize phase 1 of the two-phase simplex method to either solve </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> or establish that a solution does not exist. A conclusion is reached by trying to solve </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> by minimizing a sum of artificial variables subject to the system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> as constraints. Using examples, we illustrate </span><span style="font-family:Verdana;">how this approach can give the core of a cooperative game and an equili</span><span style="font-family:Verdana;">brium for a noncooperative game, as well as solve both linear and nonlinear goal programming problems. Similarly, we start with a general nonlinear programming problem and present an algorithm to solve it as a series of systems </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> by generalizing the </span></span><span style="font-family:Verdana;">“</span><span style="font-family:Verdana;">sliding objective</span><span style="font-family:Verdana;"> function </span><span style="font-family:Verdana;">method</span><span style="font-family:Verdana;">”</span><span style="font-family:Verdana;"> for</span><span style="font-family:Verdana;"> two-dimensional linear programming. An example is presented to illustrate the geometrical nature of this approach.展开更多
English mathematics Professor, Sir Andrew John Wiles of the University of Cambridge finally and conclusively proved in 1995 Fermat’s Last Theorem which had for 358 years notoriously resisted all gallant and spirited ...English mathematics Professor, Sir Andrew John Wiles of the University of Cambridge finally and conclusively proved in 1995 Fermat’s Last Theorem which had for 358 years notoriously resisted all gallant and spirited efforts to prove it even by three of the greatest mathematicians of all time—such as Euler, Laplace and Gauss. Sir Professor Andrew Wiles’s proof employed very advanced mathematical tools and methods that were not at all available in the known World during Fermat’s days. Given that Fermat claimed to have had the “truly marvellous” proof, this fact that the proof only came after 358 years of repeated failures by many notable mathematicians and that the proof came from mathematical tools and methods which are far ahead of Fermat’s time, has led many to doubt that Fermat actually did possess the “truly marvellous” proof which he claimed to have had. In this short reading, via elementary arithmetic methods, we demonstrate conclusively that Fermat’s Last Theorem actually yields to our efforts to prove it.展开更多
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:...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.展开更多
文摘We consider the Pythagoras equation X<sup>2</sup> +Y<sup>2</sup> = Z<sup>2</sup>, and for any solution of the type (a,b = 2<sup>s</sup>b<sub>1 </sub>≠0,c) ∈ N<sup>*3</sup>, s ≥ 2, b<sub>1</sub>odd, (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,e<sup>n</sup>)) 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: a<sup>2</sup> + b<sup>2</sup> = c<sup>2</sup> 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: a<sup>4</sup> + b<sup>4 </sup>= c<sup>4</sup>, 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: a<sup>2p</sup> + b<sup>2p</sup> = c<sup>2p</sup> and a<sup>p</sup> + b<sup>p</sup> = c<sup>p</sup>. MSC2020-Mathematical Sciences Classification System: 11A05-11A51-11D25-11D41-11D72.
文摘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.
文摘In this paper, we study two Diophantine equations of the type p<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> , where p is a prime number. We find that the equation 2<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> has exactly two solutions (x, y, z) in non-negative integer i.e., {(3, 0, 3),(4, 1, 5)} but 5<sup>x</sup> + 9<sup>y</sup> = z<sup>2</sup> has no non-negative integer solution.
文摘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 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. .
基金Supported by NNSF(No. 19931020, No. 10001006 and No. 60273015)of China
文摘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.
基金supported by the National Natural Science Foundation of China under Grant No.12001030the CAS Key Project QYZDJ-SSW-SYS022the National Key Research and Development Project2020YFA0712300。
文摘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.
基金Supported by National Natural Science Foundation of China (Grant Nos. 10771100, 10971250)
文摘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.
文摘In this paper we prove in a new way, the well known result, that Fermat’s equation a<sup>4</sup> + b<sup>4</sup> = c<sup>4</sup>, 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 (F<sub>0</sub>) 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−1<s , witch is absurd. To reach such a result, we suppose first that (F<sub>0</sub>) 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) (F<sub>0</sub>): 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. .
文摘The Pythagorean triples (a, b | c) of planar geometry which satisfy the equation a<sup>2</sup>+b<sup>2</sup>=c<sup>2</sup> with integers (a, b, c) are generalized to 3D-Pythagorean quadruples (a, b, c | d) of spatial geometry which satisfy the equation a<sup>2</sup>+b<sup>2</sup>+c<sup>2</sup>=d<sup>2</sup> 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 d<sup>2</sup> is established. The 3D-Pythagorean quadruples are then generalized to 4D-Pythagorean quintuples (a, b, c, d | e) which satisfy the equation a<sup>2</sup>+b<sup>2</sup>+c<sup>2</sup>+d<sup>2</sup>=e<sup>2</sup> 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 d<sup>2</sup>, respectively, e<sup>2</sup>.
文摘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.
基金The Natural Science Foundation of Chongqing University of Post and Telecommunications (No.A2008-40)
文摘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).
文摘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.
文摘<p align="justify"> <span style="font-family:Verdana;">In this paper, tiling a plane with equilateral semi-regular convex polygons is considered, and, that is, tiling with equilateral polygons of</span><span style="font-family:Verdana;"> the same type. Tiling a plane with semi-regular polygons depends not only on the type of a semi-regular polygon, but also on its interior angles that join at a node. In relation to the interior angles, semi-regular equilateral polygons with the same or different interior angles can be joined in the nodes. Here, we shall first consider tiling a plane with semi-regular equilateral polygons with 2m-sides. The analysis is performed by determining the set of all integer solutions of the corresponding Diophantine equation in the form of <img alt="" src="Edit_c185b1c4-6b78-4af5-b1c2-4932af77bf65.png" />, where<img alt="" src="Edit_2e6548d5-3254-4005-b19e-9d49cd5d6f81.png" />are the non-negative integers which are not equal to zero at the same time, and <img alt="" src="Edit_a6dbde8a-5f3a-43d4-bc89-27dcc3057d23.png" />are the interior angles of a semi-regular equilateral polygon from the characteristic angle. It is shown that of all semi-regular equilateral polygons with 2m-sides, a plane can be tiled only with the semi-regular equilateral quadrilaterals and semi-regular equilateral hexagons. Then, the problem of tiling a plane with semi-regular equilateral quadrilaterals is analyzed in detail, and then the one with semi-regular equilateral hexagons. For these semi-regular polygons, all possible solutions of the corresponding Diophantine equations were analyzed and all nodes were determined, and then the problem for different values of characteristic elements was observed. For some of the observed cases of tiling a plane with these semi-regular polygons, some graphical presentations of tiling constructions are also given.</span> </p>
文摘For any finite-dimensional complex semisimple Lie algebra, two ellipsoids (primary and secondary) are considered. The equations of these ellipsoids are Diophantine equations, and the Weyl group acts on the sets of all their Diophantine solutions. This provides two realizations (primary and secondary) of the Weyl group on the sets of Diophantine solutions of the equations of the ellipsoids. The primary realization of the Weyl group suggests an order on the Weyl group, which is stronger than the Chevalley-Bruhat ordering of the Weyl group, and which provides an algorithm for the Chevalley-Bruhat ordering. The secondary realization of the Weyl group provides an algorithm for constructing all reduced expressions for any of its elements, and thus provides another way for the Chevalley-Bruhat ordering of the Weyl group.
文摘In quantitative decision analysis, an analyst applies mathematical models to make decisions. Frequently these models involve an optimization problem to determine the values of the decision variables, a system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> of possibly non</span></span><span style="font-family:Verdana;">- </span><span style="font-family:Verdana;">li</span><span style="font-family:Verdana;">near inequalities and equalities to restrict these variables, or both. In this</span><span style="font-family:""><span style="font-family:Verdana;"> note, </span><span style="font-family:Verdana;">we relate a general nonlinear programming problem to such a system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> in</span><span style="font-family:Verdana;"> such </span><span style="font-family:Verdana;">a way as to provide a solution of either by solving the other—with certain l</span><span style="font-family:Verdana;">imitations. We first start with </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> and generalize phase 1 of the two-phase simplex method to either solve </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> or establish that a solution does not exist. A conclusion is reached by trying to solve </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> by minimizing a sum of artificial variables subject to the system </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> as constraints. Using examples, we illustrate </span><span style="font-family:Verdana;">how this approach can give the core of a cooperative game and an equili</span><span style="font-family:Verdana;">brium for a noncooperative game, as well as solve both linear and nonlinear goal programming problems. Similarly, we start with a general nonlinear programming problem and present an algorithm to solve it as a series of systems </span><i><span style="font-family:Verdana;">S</span></i><span style="font-family:Verdana;"> by generalizing the </span></span><span style="font-family:Verdana;">“</span><span style="font-family:Verdana;">sliding objective</span><span style="font-family:Verdana;"> function </span><span style="font-family:Verdana;">method</span><span style="font-family:Verdana;">”</span><span style="font-family:Verdana;"> for</span><span style="font-family:Verdana;"> two-dimensional linear programming. An example is presented to illustrate the geometrical nature of this approach.
文摘English mathematics Professor, Sir Andrew John Wiles of the University of Cambridge finally and conclusively proved in 1995 Fermat’s Last Theorem which had for 358 years notoriously resisted all gallant and spirited efforts to prove it even by three of the greatest mathematicians of all time—such as Euler, Laplace and Gauss. Sir Professor Andrew Wiles’s proof employed very advanced mathematical tools and methods that were not at all available in the known World during Fermat’s days. Given that Fermat claimed to have had the “truly marvellous” proof, this fact that the proof only came after 358 years of repeated failures by many notable mathematicians and that the proof came from mathematical tools and methods which are far ahead of Fermat’s time, has led many to doubt that Fermat actually did possess the “truly marvellous” proof which he claimed to have had. In this short reading, via elementary arithmetic methods, we demonstrate conclusively that Fermat’s Last Theorem actually yields to our efforts to prove it.
文摘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.