Prime Time 素数筛选+玄学1e-8

最新推荐文章于 2021-02-02 14:27:11 发布

Big_Rui

最新推荐文章于 2021-02-02 14:27:11 发布

阅读量761

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/Big_Rui/article/details/76652190

版权

一道简单的数学题目，要求计算0到10000区间内，形如n*n+n+41的数中素数的比例。解决方案包括素数打表预计算，以及在结果中加上1e-8以避免double类型精度损失导致的答案错误。

摘要由CSDN通过智能技术生成

Euler is a well-known matematician, and, among many other things, he discovered that the formula
n
2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ 41.
Even though this formula doesn’t always produce a prime, it still produces a lot of primes. It’s known
that for n ≤ 10000000, there are 47,5% of primes produced by the formula!
So, you’ll write a program that will output how many primes does the formula output for a certain
interval.
Input
Each line of input will be given two positive integer a and b such that 0 ≤ a ≤ b ≤ 10000. You must
read until the end of the file.
Output
For each pair a, b read, you must output the percentage of prime numbers produced by the formula in
this interval (a ≤ n ≤ b) rounded to two decimal digits.
Sample Input
0 39
0 40
39 40
Sample Output
100.00