How to realize the Sum of Primes by java

This article will explain in detail how to achieve the sum of primes in java. The editor thinks it is very practical, so I share it for you as a reference. I hope you can get something after reading this article.

The sum of all primes less than 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all primes less than 2 million.

System.out.println (Pythagorean (1000))

Analysis:

To satisfy the Pythagorean theorem, you can think of it as the three sides of a right triangle. An is a small right-angled edge, b is a large right-angled edge, and c is a bevel. If b is equal to a, then c is an irrational number, and the sum cannot be equal to 1000, so b cannot be equal to a. The following loop satisfies several conditions of a right triangle: 1: the right side is smaller than the oblique edge, 2: the sum of the two sides is greater than the third side, and 3: the difference between the two sides is less than the third side. If you find it, go straight back.

This is the end of the article on "how to realize the sum of prime numbers in java". I hope the above content can be of some help to you, so that you can learn more knowledge. if you think the article is good, please share it out for more people to see.