Problem 10 of Find the sum of all the primes below two million.

最新推荐文章于 2022-08-18 10:57:29 发布

comkingfly

最新推荐文章于 2022-08-18 10:57:29 发布

阅读量974

点赞数

分类专栏：欧拉项目文章标签： string class

本文链接：https://blog.csdn.net/comkingfly/article/details/7348102

版权

欧拉项目专栏收录该内容

17 篇文章 0 订阅

订阅专栏

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.

Find the sum of all the primes below two million.

public class BigPrime {
	public static void main(String args[]){
		long j=0;
		for(long i=2;i<2000000;i++){
			if(isPrime(i)){
				j+=i;
			}
		}
		System.out.println(j);
	}
	
	public static boolean isPrime(long n){
	    for(int i = 2; i * i <= n; i++){
	  if(n % i == 0)
	   return false;
	  }
	    return true;
	}
}

Answer:

142913828922