Ultra fast finding all the prime numbers: formula

Автор: Shcherban Viktor

Журнал: Бюллетень науки и практики @bulletennauki

Рубрика: Физико-математические науки

Статья в выпуске: 9 (22), 2017 года.

Бесплатный доступ

Finding very large prime numbers is still considered a hard work. Existing algorithms already employ splitting numbers into simple multipliers, which exceed 10110. This well takes 24 hours of the world’s most powerful ECM. Now we shall prove the opposite: no algorithms of random number primality are needed. Not a continuous work of a medium-power computer and the result is ready. The large prime numbers make the basis for protection of electronic commerce and electronic post. As some of intruders gradually manage to compute them, knowing cryptologists keep renewing inventory of the large prime numbers, which is a practice, while a mere curiosity and a scientific prestige will stimulate hunters for the large prime numbers, which is a theory.

Еще

Prime numbers, fibonacci sequence, arithmetic number table

Короткий адрес: https://sciup.org/14111752

IDR: 14111752   |   DOI: 10.5281/zenodo.891161

Статья научная