Problem 7

iteye_12241

于 2011-06-13 20:37:24 发布

阅读量139

点赞数

CC 4.0 BY-SA版权

分类专栏：算法

本文链接：https://blog.youkuaiyun.com/iteye_12241/article/details/82074693

算法专栏收录该内容

53 篇文章

订阅专栏

本文探讨如何通过编程实现找到第10001个素数的方法，涉及算法优化和数学原理的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题描述：
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.

What is the 10001st prime number?

public static boolean IsPrime(long number) {
		int begin = 2;
		int end = (int) Math.sqrt(number) + 1;
		for (int i = begin; i < end; i++) {
			if (number % i == 0)
				return false;
		}
		return true;
	}

	public static long count(int number){
		long result = 1;
		int n = 0;
		long cur = 2;
		while(n<number){
			if(IsPrime(cur)){
				result = cur;
				n++;
			}
			cur++;
		}

		return result;
	}