Verifying Sierpiński and Riesel Numbers in ACL2 英文论文文献.docVIP

Verifying Sierpin′ski and Riesel Numbers in ACL2 John R. Cowles Ruben Gamboa Department of Computer Science University of Wyoming Laramie, Wyoming, USA cowles@ ruben@ A Sierpi′nski number [4, page 420] and [1], is an odd positive integer, k, such that no positive integer in this in?nite list is prime: k21+1,k22+1,k23+1,...,k2n+1, (1) A Riesel number [1] is similar to a Sierpi′nski number, with?1 replacing+1 in the above in?nite list. Such a number is an odd positive integer, k, so that no positive integer in this in?nite list is prime: k21?1,k22?1,k23?1,...,k2n?1, A cover, for such a k, is a