Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is...Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is designed by the authors, which can not only seek directly the multiplicative inverse and the greatest common divisor, but also solve directly a simple congruence for general solutions. This paper presents the definition and the two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, induces the recursive formula for solving simple congruences, and describes formally and implements in C language the recursive algorithm. At last, the paper compares REESSE with the extended Euclidean algorithm in thought, applicability and time complexity.展开更多
We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient p...We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2021), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsänkyla residues to residues of some full convolutions of the same kind. We also establish some congruences concerning other related weighted sums of powers of integers when these sums are weighted by some analogs of the Teichmüller characters.展开更多
基金Supported by the National Key Promotion Plan for Science and Technology Results (2003EC000001)
文摘Different from the extended Euclidean algorithm which can compute directly only the multiplicative inverse of an element in Zm^＊ and the greatest common divisor of two integers, a recursive algorithm called REESSE is designed by the authors, which can not only seek directly the multiplicative inverse and the greatest common divisor, but also solve directly a simple congruence for general solutions. This paper presents the definition and the two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, induces the recursive formula for solving simple congruences, and describes formally and implements in C language the recursive algorithm. At last, the paper compares REESSE with the extended Euclidean algorithm in thought, applicability and time complexity.
文摘We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2021), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsänkyla residues to residues of some full convolutions of the same kind. We also establish some congruences concerning other related weighted sums of powers of integers when these sums are weighted by some analogs of the Teichmüller characters.
