题解：Summation of Four Primes（整数分解四个素数和）

最新推荐文章于 2022-05-03 18:01:42 发布

嘘......

最新推荐文章于 2022-05-03 18:01:42 发布

阅读量360

点赞数

分类专栏：杂七杂八

本文链接：https://blog.youkuaiyun.com/weixin_43540515/article/details/99680306

版权

该博客探讨了Euler关于无穷素数定理，并提出一个问题：每个大于4的整数是否能表示为四个正素数的和。博主希望找到一种高效的方法来解决这个问题，因为其使用的计算设备性能有限。输入包含一个不超过10000000的整数N，输出应为满足条件的四个素数。若无法找到这样的组合，则输出'Impossible.'。示例给出了几个整数及其可能的素数和解决方案。

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

每个大于4的整数可以以转换为两个素数和
在这里插入图片描述
Euler proved in one of his classic theorems that prime numbers are inﬁnite in number. But can every number be expressed as a summation of four positive primes? I don’t know the answer. May be you can help!!! I want your solution to be very eﬃcient as I have a 386 machine at home. But the time limit speciﬁed above is for a Pentium III 800 machine. The deﬁnition of prime number for this problem is “A prime number is a positive number which has exactly two distinct integer factors”. As for example 37 is prime as it has exactly two distinct integer factors 37 and 1.
Input The input contains one integer number N (N ≤ 10000000) in every line. This is the number you will have to express as a summation of four primes. Input is terminated by end of ﬁle.
Output
For each line of input there is one line of output, which contains four prime n