求初等欧拉公式 -39 ~ 40 范围内的素数

问题描述:

欧拉公式: a(n) = n^2 - n + 41,求n在 -39 ~ 40范围内的素数。

算法分析:

穷举法,穷举出-39~40范围内的a(n),再判断a(n)是否为素数;

代码如下:

ContractedBlock.gif ExpandedBlockStart.gif View Code
 1 #include <stdio.h>
2 #include <math.h>
3
4 int main(void)
5 {
6 int i, k;
7 for(i = -39; i <= 40; i++)
8 {
9 int p = i * i - i + 41;
10 int flag = 0; // 标记
11
12 for(k = 2; k <= sqrt(p)+1; k++)
13 {
14 if(p % k == 0) // 如果取余为0,就不是素数
15 {
16 flag = 1; // 标记改为1
17 break;
18 }
19
20 }
21
22 if(flag == 0) // 判断标记来判断是否是素数
23 {
24 printf("%d -> ", i);
25 printf("%d is prime.\n", p);
26 }
27
28 }
29 }



输出结果:

-39 -> 1601 is prime
-38 -> 1523 is prime
-37 -> 1447 is prime
-36 -> 1373 is prime
-35 -> 1301 is prime
-34 -> 1231 is prime
-33 -> 1163 is prime
-32 -> 1097 is prime
-31 -> 1033 is prime
-30 -> 971 is prime.
-29 -> 911 is prime.
-28 -> 853 is prime.
-27 -> 797 is prime.
-26 -> 743 is prime.
-25 -> 691 is prime.
-24 -> 641 is prime.
-23 -> 593 is prime.
-22 -> 547 is prime.
-21 -> 503 is prime.
-20 -> 461 is prime.
-19 -> 421 is prime.
-18 -> 383 is prime.
-17 -> 347 is prime.
-16 -> 313 is prime.
-15 -> 281 is prime.
-14 -> 251 is prime.
-13 -> 223 is prime.
-12 -> 197 is prime.
-11 -> 173 is prime.
-10 -> 151 is prime.
-9 -> 131 is prime.
-8 -> 113 is prime.
-7 -> 97 is prime.
-6 -> 83 is prime.
-5 -> 71 is prime.
-4 -> 61 is prime.
-3 -> 53 is prime.
-2 -> 47 is prime.
-1 -> 43 is prime.
0 -> 41 is prime.
1 -> 41 is prime.
2 -> 43 is prime.
3 -> 47 is prime.
4 -> 53 is prime.
5 -> 61 is prime.
6 -> 71 is prime.
7 -> 83 is prime.
8 -> 97 is prime.
9 -> 113 is prime.
10 -> 131 is prime.
11 -> 151 is prime.
12 -> 173 is prime.
13 -> 197 is prime.
14 -> 223 is prime.
15 -> 251 is prime.
16 -> 281 is prime.
17 -> 313 is prime.
18 -> 347 is prime.
19 -> 383 is prime.
20 -> 421 is prime.
21 -> 461 is prime.
22 -> 503 is prime.
23 -> 547 is prime.
24 -> 593 is prime.
25 -> 641 is prime.
26 -> 691 is prime.
27 -> 743 is prime.
28 -> 797 is prime.
29 -> 853 is prime.
30 -> 911 is prime.
31 -> 971 is prime.
32 -> 1033 is prime.
33 -> 1097 is prime.
34 -> 1163 is prime.
35 -> 1231 is prime.
36 -> 1301 is prime.
37 -> 1373 is prime.
38 -> 1447 is prime.
39 -> 1523 is prime.
40 -> 1601 is prime.

转载于:https://www.cnblogs.com/jeff_nie/archive/2011/10/13/2210045.html

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值