朱文余和孙琦(见《数学进展》,2004,33(4):505-507)提出了关于3阶Carmichael数的三个问题,我们(见《四川大学学报(自然科学版)》,2006,43(6):1197-1201)肯定地回答了问题1.本文模仿Howe的寻找严格2阶Carmichael数(见Mathematics of Comp...朱文余和孙琦(见《数学进展》,2004,33(4):505-507)提出了关于3阶Carmichael数的三个问题,我们(见《四川大学学报(自然科学版)》,2006,43(6):1197-1201)肯定地回答了问题1.本文模仿Howe的寻找严格2阶Carmichael数(见Mathematics of Computation,2000,69(232):1711-1719)的方法,提出寻找满足某种条件的3阶Carmichael数的方法,并用这种方法确实找到了几百个这样的数,因而完全肯定地回答了问题2.展开更多
Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design st...Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers;and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.展开更多
We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in...We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in using the idea of colorings applied to regular polygons to establish a number-theoretic result. A lemma traditionally, if ambiguously, attributed to Burnside provides a critical enumeration step.展开更多
基金NSFC(No.10071001)SF of Anhui Province Grant(No.01046103)the SF of the Education Department of Anhui Province Grant(No.2002KJ131).
文摘朱文余和孙琦(见《数学进展》,2004,33(4):505-507)提出了关于3阶Carmichael数的三个问题,我们(见《四川大学学报(自然科学版)》,2006,43(6):1197-1201)肯定地回答了问题1.本文模仿Howe的寻找严格2阶Carmichael数(见Mathematics of Computation,2000,69(232):1711-1719)的方法,提出寻找满足某种条件的3阶Carmichael数的方法,并用这种方法确实找到了几百个这样的数,因而完全肯定地回答了问题2.
文摘Prime integers and their generalizations play important roles in protocols for secure transmission of information via open channels of telecommunication networks. Generation of multidigit large primes in the design stage of a cryptographic system is a formidable task. Fermat primality checking is one of the simplest of all tests. Unfortunately, there are composite integers (called Carmichael numbers) that are not detectable by the Fermat test. In this paper we consider modular arithmetic based on complex integers;and provide several tests that verify the primality of real integers. Although the new tests detect most Carmichael numbers, there are a small percentage of them that escape these tests.
文摘We present an intuitively satisfying geometric proof of Fermat's result for positive integers that for prime moduli p, provided p does not divide a. This is known as Fermat’s Little Theorem. The proof is novel in using the idea of colorings applied to regular polygons to establish a number-theoretic result. A lemma traditionally, if ambiguously, attributed to Burnside provides a critical enumeration step.
