N-level prime number periodic table theorem based system and method for constructing prime number periodic table in parallel

Abstract

The present invention discloses a system and method for constructing a large prime number periodic table by using an N-level prime number periodic table theorem. The method comprises: calculating n basic order prime numbers by using a prime number general formula; then calculating and generating an original order prime number column by means of a prime number column generation module and storing the original order prime number column into a prime number generation area; calculating and generating a composite number column by means of a continuous composite number area determination module; forming a continuous composite number area by using continuous combinations of generated infinite composite number columns, and storing the continuous combinations into the continuous composite number area; performing validation on the generated prime number column by means of a linear congruence equation calculation module; searching for prime factors of the composite numbers in all directions, performing screening to obtain prime factor composite numbers that are all greater than mn, and completely separating the composite numbers from the prime numbers to reduce a probability of erroneous determination; and the more and larger searched modulus prime factors become, the closer distribution density of sector prime factor composite numbers approaches to zero, so as to obtain a super large prime number table that approaches closer and closer to 100%, and implement the goal of acquiring infinite large prime numbers in all directions in a whole of natural numbers.

Description

technical field [0001] The invention relates to the field of number theory, in particular to a system and method for constructing a periodic table of large prime numbers using the N-level periodic table theory of prime numbers. Background technique [0002] A prime number, also known as a prime number, refers to a number greater than 1 that cannot be divisible by other natural numbers except 1 and the integer itself. Prime numbers play a very important role in number theory. The generation of large prime numbers is a hot issue in the field of cryptography. However, in the prior art, the generation of large prime numbers is hindered by two aspects. One is the probability problem, that is, the generated large prime numbers are wrong. What is the probability of judgment? At present, it is believed that the Miller-Rabin algorithm is the best method with the smallest probability of misjudgment; the second is the speed problem. The algorithm process requires multiple primality jud...

AI Technical Summary

Problems solved by technology

Prime numbers play a very important role in number theory. The generation of large prime numbers is a hot issue in the field of cryptography. However, in the prior art, the generation of large prime numbers is hindered in two aspects. One is the probability problem, that is, the generated large prime numbers are wrong. What is the probability of judging? At present, it is believed that the Miller-Rabin algorithm is the best method with the smallest probability of misjudgment; the second is the speed problem. The algorithm process requires multiple primality judgments, which takes a long time and is largely limited The performance of most products

[0003] People have rich "conjectures" about prime numbers and put forward countless interesting mathematical problems, but it is difficult to get a real theorem about the law of prime numbers

Images