抄録
A-020
An algorithm to reduce primality testing cost
Kaede Sasaki(所属なし)
We examined a new method giving a reduced set including all prime numbers. Our new method shows superior property by combining with other algorithms comparing with the original algo- rithms. We calculated prime numbers in the formu- lar of the Pythagorean theorem. This equation ex- presses that the product of two numbers equidistant from one prime number equals the height squared. We can get prime numbers at a hypotenuse from the square root of the sum of the base squared and the height squared. The number that is odd and not multiple of three is chosen for the base in our method. Particularly we used a number one for the base. And, the height squared is always the prod- uct of a constant and an integer. All prime numbers and some series of composit numbers are calculated as integers. We exclude some composit numbers by combining with other algorithms.