哥德巴赫猜想是数论中的一个著名未解决问题,最早由德国数学家克里斯蒂安·哥德巴赫在1742年提出。猜想的内容是:每个大于2的偶数都可以表示为两个素数之和。以下程序仅为输出猜想的结果,并不是证明。
package com.ai157.aigc.controller.test; public class Test1 { // 判断一个数是否为素数 public static boolean isPrime(int number) { if (number <= 1) { return false; } for (int i = 2; i <= Math.sqrt(number); i++) { if (number % i == 0) { return false; } } return true; } public static void check(int start, int end) { for (int num = start; num <= end; num += 2) { for (int i = 2; i <= num / 2; i++) { if (isPrime(i) && isPrime(num - i)) { System.out.println(num + " = " + i + " + " + (num - i)); break; } } } } public static void main(String[] args) { //从2到200//只写偶数哦 check(2, 200); //验证某个数 check(5000,5000); } }
输出结果是:
4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7
12 = 5 + 7
14 = 3 + 11
16 = 3 + 13
18 = 5 + 13
20 = 3 + 17
22 = 3 + 19
24 = 5 + 19
26 = 3 + 23
28 = 5 + 23
30 = 7 + 23
32 = 3 + 29
34 = 3 + 31
36 = 5 + 31
38 = 7 + 31
40 = 3 + 37
42 = 5 + 37
44 = 3 + 41
46 = 3 + 43
48 = 5 + 43
50 = 3 + 47
52 = 5 + 47
54 = 7 + 47
56 = 3 + 53
58 = 5 + 53
60 = 7 + 53
62 = 3 + 59
64 = 3 + 61
66 = 5 + 61
68 = 7 + 61
70 = 3 + 67
72 = 5 + 67
74 = 3 + 71
76 = 3 + 73
78 = 5 + 73
80 = 7 + 73
82 = 3 + 79
84 = 5 + 79
86 = 3 + 83
88 = 5 + 83
90 = 7 + 83
92 = 3 + 89
94 = 5 + 89
96 = 7 + 89
98 = 19 + 79
100 = 3 + 97
102 = 5 + 97
104 = 3 + 101
106 = 3 + 103
108 = 5 + 103
110 = 3 + 107
112 = 3 + 109
114 = 5 + 109
116 = 3 + 113
118 = 5 + 113
120 = 7 + 113
122 = 13 + 109
124 = 11 + 113
126 = 13 + 113
128 = 19 + 109
130 = 3 + 127
132 = 5 + 127
134 = 3 + 131
136 = 5 + 131
138 = 7 + 131
140 = 3 + 137
142 = 3 + 139
144 = 5 + 139
146 = 7 + 139
148 = 11 + 137
150 = 11 + 139
152 = 3 + 149
154 = 3 + 151
156 = 5 + 151
158 = 7 + 151
160 = 3 + 157
162 = 5 + 157
164 = 7 + 157
166 = 3 + 163
168 = 5 + 163
170 = 3 + 167
172 = 5 + 167
174 = 7 + 167
176 = 3 + 173
178 = 5 + 173
180 = 7 + 173
182 = 3 + 179
184 = 3 + 181
186 = 5 + 181
188 = 7 + 181
190 = 11 + 179
192 = 11 + 181
194 = 3 + 191
196 = 3 + 193
198 = 5 + 193
200 = 3 + 197
5000 = 7 + 4993