ProjectEuler Mathematica 答案

胖子爱水饺

于 2020-04-21 22:22:24 发布

阅读量176

点赞数

文章标签：算法恰饭其他

本文链接：https://blog.csdn.net/Tangszelation/article/details/105669242

版权

50

f[1] = Prime[1];
f[n_] := f[n] = f[n - 1] + Prime[n];
i = 1;
While[f[i] < 1000000, i++];
maxIter = i - 1;
primeList = Table[Prime[i], {i, maxIter}]; i = 1; While[
 Not[Or @@ 
   PrimeQ[MovingAverage[primeList, maxIter - i]*(maxIter - i)]], 
 i = i + 1];
SelectFirst[
 Reverse[MovingAverage[primeList, maxIter - i]*(maxIter - i)], PrimeQ]
#结果
997651