Notes on Prime Numbers, Their Numerical Statistics & Patterns I: Modular Arithmetic and the Eight Fold Period 24 Model
SSRN Electronic Journal(2014)
摘要
We have not yet obtained a simple, complete and accurate method for determining if an integer number specifically an odd number that does not digitally sum to 3,6,9, whether it is prime, and that does not involve trial & error and/or as by a sieving method or factoring. This after thousand(s) of years of searching for such. Alternatively great strides are made towards understanding the behavior of numbers, fields of numbers obtained by some method or another, statistics probabilities & entropies of such numbers, & so forth, & it seems that it is assumed that a better method (but not 'full') for determining primality will appear as an afterthought or byproduct. In this letter we wish to revitalize the interest of the intrepid professional & amateur mathematician & scientist towards seeking the 'full' or 'complete' method of determining primality, or rather towards obtaining the method by which a prime odd integer can be determined completely, simply and efficiently & with applicability to small to very large numbers with a minimum of effort eschewing supercomputing & other recent methods however by utilizing methods resembling pencil & paper approaches.
更多查看译文
关键词
prime numbers,modular arithmetic,patterns,numerical statistics,fold period
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要