判定一般素数的新方法

A NEW METHOD for CHACKING a PRIME

摘要:

本文提供了一种判定任意数是素数还是合数的新方法,以该方法为数字模型编制的程序可以对单个自然数作出判断,也可以在一个区段内定出全部素数与合数,程序中断后重新启动也不必重复已做过的工作,这些方面都比筛法好。对该方法进行了理论证明,程序运行后取得了很好的成绩。

Abstract:

Until now, sieve of eratosthenes' is still the only method for deciding a natural number to be a prime. Unfortulatly, the checking procedure is too complicate for large numbers. This paper establishes a new method based on a theory discussed here shows th