We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. Thi...We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.展开更多
We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Dio...We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Diophantine remainders of (a, b, c), an asymptotic approach based on Balzano Weierstrass Analysis Theorem as tools. We construct convergent infinite sequences and establish asymptotic results including the following surprising one. If z y = 1 then there exists a tight bound N such that, for all prime exponents p > N , we have xp yp zp.展开更多
In the present paper two contents are enclosed .First ,the Fourier analysis approach of the dispersion relation and group velocity effect of finite difference schemes is discussed.the defects of the approach is pointe...In the present paper two contents are enclosed .First ,the Fourier analysis approach of the dispersion relation and group velocity effect of finite difference schemes is discussed.the defects of the approach is pointed out and the correction is made;Second,a new systematic analysis method -remaider -effect analysis (abbr.REAM)is proposed by means of the modified partial differential equations (abbr MPDE)of finite difference schemes.The analysis is based on the synthetical study of the rational dispersion-and dissipation relations of finite difference schemes.And the method clearly possesses constructivity展开更多
Aerospace relay is one kind of electronic components which is used widely in national defense system and aerospace system. The existence of remainder particles induces the reliability declining, which has become a sev...Aerospace relay is one kind of electronic components which is used widely in national defense system and aerospace system. The existence of remainder particles induces the reliability declining, which has become a severe problem in the development of aerospace relay. Traditional particle impact noise detection (PIND) method for remainder detection is ineffective for small particles, due to its low precision and involvement of subjective factors. An auto-detection method for PIND output signals is proposed in this paper, which is based on direct wavelet de-noising (DWD), cross-correlation analysis (CCA) and homo-filtering (HF), the method enhances the affectivity of PIND test about the small particles. In the end, some practical PIND output signals are analysed, and the validity of this new method is proved.展开更多
Mersenne primes are a special kind of primes, which are an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. Searching for Mersenne primes is very chal...Mersenne primes are a special kind of primes, which are an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. Searching for Mersenne primes is very challenging in scientific researches. In this paper, the numbers of thousand place of Mersenne primes are studied, and the conclusion is presented by using the Chinese remainder theorem.展开更多
<正> This paper focuses on studying the relation between a velocity-dependent symmetry and a generalizedLutzky conserved quantity for a holonomic system with remainder coordinates subjected to unilateral constra...<正> This paper focuses on studying the relation between a velocity-dependent symmetry and a generalizedLutzky conserved quantity for a holonomic system with remainder coordinates subjected to unilateral constraints.Thedifferential equations of motion of the system are established,and the definition of Lie symmetry for the system is given.The conditions under which a Lie symmetry can directly lead up to a generalized Lutzky conserved quantity and theform of the new conserved quantity are obtained,and an example is given to illustrate the application of the results.展开更多
A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technol...A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.展开更多
Asian carp are expanding their range throughout the Mississippi River; however, abundance is thought to be highest in reaches within close proximity to the Illinois River. In the Mississippi River, Lock and Dam 19(L&a...Asian carp are expanding their range throughout the Mississippi River; however, abundance is thought to be highest in reaches within close proximity to the Illinois River. In the Mississippi River, Lock and Dam 19(L&D 19) at Keokuk, Iowa is the primary barrier to slow the expansion upstream. As Asian carp abundance increases below L&D 19, it is important to investigate potential means of control(i.e., reduction through harvest and barriers) that will prevent complete invasion of the Mississippi River above L&D 19. Silver Carp and Bighead Carp were collected below L&D 19, a subsample were implanted with ultrasonic transmitters to evaluate passage through the lock chamber and the remainder were used to determine population dynamics at the leading edge of invasion. Although the dam portion of the structure poses a complete barrier to upstream expansion, we documented lock chamber passage demonstrating the lock chamber has the capability to provide passage upstream. Based on the results of the population assessment, in order to induce recruitment overfishing at this leading edge of invasion, Asian carp will need to be intensively harvested at 300 mm and larger. The combination of commercial fishing efforts and research investigating ways to prevent passage upstream must be employed.展开更多
In this paper,the forecasting equations of a 2nd-order space-time differential remainder are deduced from the Navier-Stokes primitive equations and Eulerian operator by Taylor-series expansion.Here we introduce a cubi...In this paper,the forecasting equations of a 2nd-order space-time differential remainder are deduced from the Navier-Stokes primitive equations and Eulerian operator by Taylor-series expansion.Here we introduce a cubic spline numerical model(Spline Model for short),which is with a quasi-Lagrangian time-split integration scheme of fitting cubic spline/bicubic surface to all physical variable fields in the atmospheric equations on spherical discrete latitude-longitude mesh.A new algorithm of"fitting cubic spline—time step integration—fitting cubic spline—……"is developed to determine their first-and2nd-order derivatives and their upstream points for time discrete integral to the governing equations in Spline Model.And the cubic spline function and its mathematical polarities are also discussed to understand the Spline Model’s mathematical foundation of numerical analysis.It is pointed out that the Spline Model has mathematical laws of"convergence"of the cubic spline functions contracting to the original functions as well as its 1st-order and 2nd-order derivatives.The"optimality"of the 2nd-order derivative of the cubic spline functions is optimal approximation to that of the original functions.In addition,a Hermite bicubic patch is equivalent to operate on a grid for a 2nd-order derivative variable field.Besides,the slopes and curvatures of a central difference are identified respectively,with a smoothing coefficient of 1/3,three-point smoothing of that of a cubic spline.Then the slopes and curvatures of a central difference are calculated from the smoothing coefficient 1/3 and three-point smoothing of that of a cubic spline,respectively.Furthermore,a global simulation case of adiabatic,non-frictional and"incompressible"model atmosphere is shown with the quasi-Lagrangian time integration by using a global Spline Model,whose initial condition comes from the NCEP reanalysis data,along with quasi-uniform latitude-longitude grids and the so-called"shallow atmosphere"Navier-Stokes primitive equations in the spherical coordinates.The Spline Model,which adopted the Navier-Stokes primitive equations and quasi-Lagrangian time-split integration scheme,provides an initial ideal case of global atmospheric circulation.In addition,considering the essentially non-linear atmospheric motions,the Spline Model could judge reasonably well simple points of any smoothed variable field according to its fitting spline curvatures that must conform to its physical interpretation.展开更多
This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chi...This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chinese remainder theorem(CFRCRT)is presented to estimate the direction of arrival(DOA)from their wrapped phase with permissible errors.The proposed algorithm has significantly less computational complexity than the searching method while maintaining similar estimation precision.Furthermore,we combine all phase discrete Fourier transfer(APDFT)and the CFRCRT algorithm to achieve a considerably high DOA estimation precision.Both the theoretical analysis and simulation results demonstrate that the proposed algorithm has a higher estimation precision as well as lower computation complexity.展开更多
A novel quantum group signature scheme is proposed based on Chinese Remainder Theorem (CRT), in order to improve the security of quantum signature. The generation and verification of the signature can be successfully ...A novel quantum group signature scheme is proposed based on Chinese Remainder Theorem (CRT), in order to improve the security of quantum signature. The generation and verification of the signature can be successfully conducted only if all the participants cooperate with each other and with the message owner's and the arbitrator's help. The quantum parallel algorithm is applied to efficiently compare the restored quantum message to the original quantum message. All the operations in signing and verifying phase can be executed in quantum circuits. It has a wide application to E-payment system, Online contract, Online notarization and etc.展开更多
We know matrices and their transposes and we also know flip matrices. In my previous paper <i>Matrices-One Review</i>, I introduced transprocal matrix. Flip matrices are transpose of transprocal matrices. ...We know matrices and their transposes and we also know flip matrices. In my previous paper <i>Matrices-One Review</i>, I introduced transprocal matrix. Flip matrices are transpose of transprocal matrices. Now I would like to introduce water image of four matrices said above and properties of such matrices. Also we know, determinant of sum of matrices is not equal to sum of determinant of matrices. Why can’t we get equal value on addition side and additive side of determinant of matrix addition and subtraction? This question triggered me to find the reason. The basic algebra of mensuration gave ideas to retreat determinant of matrix addition and subtraction. I extent that ideas for matrices sum. Further, in 1812, French mathematician <b>Jacques Philippe Marie Binet</b> described how to multiply matrices. Matrices are defined on addition, subtraction and multiplication but not in division. By the inspiration of Binet, I would like to describe how to do divisions on matrices. This idea is derived from division of fractions. In division of fraction, reciprocal of divisor fraction multiplies with dividend fraction. I do the same in division on matrices with some modifications. By this way, we could find quotient matrix and remainder matrix which satisfy division algorithm. So we could say, determinant of division of dividend matrix and divisor matrix is equal to division of determinant of dividend matrix and determinant of divisor matrix.展开更多
Vedic mathematics is the system of mathematics followed in ancient Indian and it is applied in various mathematical branches. The word “Vedic” represents the storehouse of all knowledge. Because using Vedic Mathemat...Vedic mathematics is the system of mathematics followed in ancient Indian and it is applied in various mathematical branches. The word “Vedic” represents the storehouse of all knowledge. Because using Vedic Mathematics, the arithmetical problems are solved easily. The mathematical algorithms are formed from 16 sutras and 13 up-sutras. But there are some limitations in each sutra. Here, two sutras Nikhilam sutra and Karatsuba algorithm are considered. In this research paper, a novel algorithm for binary multiplication based on Vedic mathematics is designed using bit reduction technique. Though Nikhilam sutra is used for multiplication, it is not used in all applications. Because it is special in multiplication. The remainder is derived from this sutra by reducing the remainder bit size to N-2 bit. Here, the number of bits of the remainder is constantly maintained as N-2 bits. By using Karatsuba algorithm, the overall structure of the multiplier is designed. Unlike the conventional Karatsuba algorithm, the proposed algorithm requires only one multiplier with N-2 bits only. The speed of the proposed algorithm is improved with balancing the area and the power. Even though there is a deviation in lower order bits, this method shows larger difference in higher bit lengths.展开更多
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. .展开更多
文摘We propose an unbounded fully homomorphic encryption scheme, i.e. a scheme that allows one to compute on encrypted data for any desired functions without needing to decrypt the data or knowing the decryption keys. This is a rational solution to an old problem proposed by Rivest, Adleman, and Dertouzos [1] in 1978, and to some new problems that appeared in Peikert [2] as open questions 10 and open questions 11 a few years ago. Our scheme is completely different from the breakthrough work [3] of Gentry in 2009. Gentry’s bootstrapping technique constructs a fully homomorphic encryption (FHE) scheme from a somewhat homomorphic one that is powerful enough to evaluate its own decryption function. To date, it remains the only known way of obtaining unbounded FHE. Our construction of an unbounded FHE scheme is straightforward and can handle unbounded homomorphic computation on any refreshed ciphertexts without bootstrapping transformation technique.
文摘We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Diophantine remainders of (a, b, c), an asymptotic approach based on Balzano Weierstrass Analysis Theorem as tools. We construct convergent infinite sequences and establish asymptotic results including the following surprising one. If z y = 1 then there exists a tight bound N such that, for all prime exponents p > N , we have xp yp zp.
文摘In the present paper two contents are enclosed .First ,the Fourier analysis approach of the dispersion relation and group velocity effect of finite difference schemes is discussed.the defects of the approach is pointed out and the correction is made;Second,a new systematic analysis method -remaider -effect analysis (abbr.REAM)is proposed by means of the modified partial differential equations (abbr MPDE)of finite difference schemes.The analysis is based on the synthetical study of the rational dispersion-and dissipation relations of finite difference schemes.And the method clearly possesses constructivity
基金Chinese Science Technology and Industry Foundation for National Defense(FEBG27100001)
文摘Aerospace relay is one kind of electronic components which is used widely in national defense system and aerospace system. The existence of remainder particles induces the reliability declining, which has become a severe problem in the development of aerospace relay. Traditional particle impact noise detection (PIND) method for remainder detection is ineffective for small particles, due to its low precision and involvement of subjective factors. An auto-detection method for PIND output signals is proposed in this paper, which is based on direct wavelet de-noising (DWD), cross-correlation analysis (CCA) and homo-filtering (HF), the method enhances the affectivity of PIND test about the small particles. In the end, some practical PIND output signals are analysed, and the validity of this new method is proved.
文摘Mersenne primes are a special kind of primes, which are an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. Searching for Mersenne primes is very challenging in scientific researches. In this paper, the numbers of thousand place of Mersenne primes are studied, and the conclusion is presented by using the Chinese remainder theorem.
基金Supported by the National Natural Science Foundation of China under Grant No.60902044Ph.D.Programs Foundation of Ministry of Education of China under Grant No.20090162120070+2 种基金Postdoctoral Science Foundation of China under Grant No.200801341State Key Laboratory of Advanced Optical Communication Systems and Networks under Grant No.2008SH01in part by the Second stage of Brain Korea 21 programs,Chonbuk National University,Korea
基金The project supported by National Natural Science Foundation of China under Grant No. 10272021 and the Natural Science Foundation of High Education Department of Jiangsu Province under Grant No. 04KJA130135
文摘<正> This paper focuses on studying the relation between a velocity-dependent symmetry and a generalizedLutzky conserved quantity for a holonomic system with remainder coordinates subjected to unilateral constraints.Thedifferential equations of motion of the system are established,and the definition of Lie symmetry for the system is given.The conditions under which a Lie symmetry can directly lead up to a generalized Lutzky conserved quantity and theform of the new conserved quantity are obtained,and an example is given to illustrate the application of the results.
文摘A new method of embedding and detecting a joint watermarking is proposed. Itapplies the asmuth-bloom secret sharing scheme, which is based on CRT (Chinese remainder theorem)theorem, to the digital watermarking technology. On the base of describing the watermarkingembedding proceeding and analyzing the watermarking detection proceeding, a series of experiments isdone. The experiments emphasize on the method's robust proving and security analysis. And theexperiments show that the method can resistthe attacks of JPEG compress, geometry, noise and grayadjusting. The results of the experiments show that the method has a nice recognition of copyrightfor joint ownership.
文摘Asian carp are expanding their range throughout the Mississippi River; however, abundance is thought to be highest in reaches within close proximity to the Illinois River. In the Mississippi River, Lock and Dam 19(L&D 19) at Keokuk, Iowa is the primary barrier to slow the expansion upstream. As Asian carp abundance increases below L&D 19, it is important to investigate potential means of control(i.e., reduction through harvest and barriers) that will prevent complete invasion of the Mississippi River above L&D 19. Silver Carp and Bighead Carp were collected below L&D 19, a subsample were implanted with ultrasonic transmitters to evaluate passage through the lock chamber and the remainder were used to determine population dynamics at the leading edge of invasion. Although the dam portion of the structure poses a complete barrier to upstream expansion, we documented lock chamber passage demonstrating the lock chamber has the capability to provide passage upstream. Based on the results of the population assessment, in order to induce recruitment overfishing at this leading edge of invasion, Asian carp will need to be intensively harvested at 300 mm and larger. The combination of commercial fishing efforts and research investigating ways to prevent passage upstream must be employed.
文摘In this paper,the forecasting equations of a 2nd-order space-time differential remainder are deduced from the Navier-Stokes primitive equations and Eulerian operator by Taylor-series expansion.Here we introduce a cubic spline numerical model(Spline Model for short),which is with a quasi-Lagrangian time-split integration scheme of fitting cubic spline/bicubic surface to all physical variable fields in the atmospheric equations on spherical discrete latitude-longitude mesh.A new algorithm of"fitting cubic spline—time step integration—fitting cubic spline—……"is developed to determine their first-and2nd-order derivatives and their upstream points for time discrete integral to the governing equations in Spline Model.And the cubic spline function and its mathematical polarities are also discussed to understand the Spline Model’s mathematical foundation of numerical analysis.It is pointed out that the Spline Model has mathematical laws of"convergence"of the cubic spline functions contracting to the original functions as well as its 1st-order and 2nd-order derivatives.The"optimality"of the 2nd-order derivative of the cubic spline functions is optimal approximation to that of the original functions.In addition,a Hermite bicubic patch is equivalent to operate on a grid for a 2nd-order derivative variable field.Besides,the slopes and curvatures of a central difference are identified respectively,with a smoothing coefficient of 1/3,three-point smoothing of that of a cubic spline.Then the slopes and curvatures of a central difference are calculated from the smoothing coefficient 1/3 and three-point smoothing of that of a cubic spline,respectively.Furthermore,a global simulation case of adiabatic,non-frictional and"incompressible"model atmosphere is shown with the quasi-Lagrangian time integration by using a global Spline Model,whose initial condition comes from the NCEP reanalysis data,along with quasi-uniform latitude-longitude grids and the so-called"shallow atmosphere"Navier-Stokes primitive equations in the spherical coordinates.The Spline Model,which adopted the Navier-Stokes primitive equations and quasi-Lagrangian time-split integration scheme,provides an initial ideal case of global atmospheric circulation.In addition,considering the essentially non-linear atmospheric motions,the Spline Model could judge reasonably well simple points of any smoothed variable field according to its fitting spline curvatures that must conform to its physical interpretation.
基金supported by the Fund for Foreign Scholars in University Research and Teaching Programs(the 111 Project)(B18039)
文摘This paper takes further insight into the sparse geometry which offers a larger array aperture than uniform linear array(ULA)with the same number of physical sensors.An efficient method based on closed-form robust Chinese remainder theorem(CFRCRT)is presented to estimate the direction of arrival(DOA)from their wrapped phase with permissible errors.The proposed algorithm has significantly less computational complexity than the searching method while maintaining similar estimation precision.Furthermore,we combine all phase discrete Fourier transfer(APDFT)and the CFRCRT algorithm to achieve a considerably high DOA estimation precision.Both the theoretical analysis and simulation results demonstrate that the proposed algorithm has a higher estimation precision as well as lower computation complexity.
文摘A novel quantum group signature scheme is proposed based on Chinese Remainder Theorem (CRT), in order to improve the security of quantum signature. The generation and verification of the signature can be successfully conducted only if all the participants cooperate with each other and with the message owner's and the arbitrator's help. The quantum parallel algorithm is applied to efficiently compare the restored quantum message to the original quantum message. All the operations in signing and verifying phase can be executed in quantum circuits. It has a wide application to E-payment system, Online contract, Online notarization and etc.
文摘We know matrices and their transposes and we also know flip matrices. In my previous paper <i>Matrices-One Review</i>, I introduced transprocal matrix. Flip matrices are transpose of transprocal matrices. Now I would like to introduce water image of four matrices said above and properties of such matrices. Also we know, determinant of sum of matrices is not equal to sum of determinant of matrices. Why can’t we get equal value on addition side and additive side of determinant of matrix addition and subtraction? This question triggered me to find the reason. The basic algebra of mensuration gave ideas to retreat determinant of matrix addition and subtraction. I extent that ideas for matrices sum. Further, in 1812, French mathematician <b>Jacques Philippe Marie Binet</b> described how to multiply matrices. Matrices are defined on addition, subtraction and multiplication but not in division. By the inspiration of Binet, I would like to describe how to do divisions on matrices. This idea is derived from division of fractions. In division of fraction, reciprocal of divisor fraction multiplies with dividend fraction. I do the same in division on matrices with some modifications. By this way, we could find quotient matrix and remainder matrix which satisfy division algorithm. So we could say, determinant of division of dividend matrix and divisor matrix is equal to division of determinant of dividend matrix and determinant of divisor matrix.
文摘Vedic mathematics is the system of mathematics followed in ancient Indian and it is applied in various mathematical branches. The word “Vedic” represents the storehouse of all knowledge. Because using Vedic Mathematics, the arithmetical problems are solved easily. The mathematical algorithms are formed from 16 sutras and 13 up-sutras. But there are some limitations in each sutra. Here, two sutras Nikhilam sutra and Karatsuba algorithm are considered. In this research paper, a novel algorithm for binary multiplication based on Vedic mathematics is designed using bit reduction technique. Though Nikhilam sutra is used for multiplication, it is not used in all applications. Because it is special in multiplication. The remainder is derived from this sutra by reducing the remainder bit size to N-2 bit. Here, the number of bits of the remainder is constantly maintained as N-2 bits. By using Karatsuba algorithm, the overall structure of the multiplier is designed. Unlike the conventional Karatsuba algorithm, the proposed algorithm requires only one multiplier with N-2 bits only. The speed of the proposed algorithm is improved with balancing the area and the power. Even though there is a deviation in lower order bits, this method shows larger difference in higher bit lengths.
文摘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. .