Shulou(Shulou.com)06/01 Report--

This article mainly introduces java how to find circumferential primes, has a certain reference value, interested friends can refer to, I hope you can learn a lot after reading this article, the following let the editor take you to understand it.

197 is called a circumferential prime, because the number obtained by rotating it bit by bit: 197 prime 971 and 719 are primes.

There are thirteen primes with circles less than 100: 2, 3, 5, 7, 11, 13, 17, 31, 37, 71, 73, 79 and 97.

How many prime numbers of circles are less than 1 million?

System.out.println (digitFactorials ())

Analysis:

One by one to determine whether to meet the conditions, meet the conditions to add, where I is less than 10000000 because the largest number less than the sum of his factorials is 1999999, so 10000000 is enough. Of course, you can change 10000000 into 1999999.

Thank you for reading this article carefully. I hope the article "how to calculate circumferential primes in java" shared by the editor will be helpful to everyone. At the same time, I also hope that you will support us and pay attention to the industry information channel. More related knowledge is waiting for you to learn!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.