Comparing characterizations of Carmichael numbers for computation
This paper examines the properties of Carmichael numbers with the aim of constructing an algorithm for computation. This includes a recently published characterization, whose applications in computing are studied. The resulting algorithm is then described and a run time comparison with an older algorithm is presented.
