* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
840 B
840 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f49d1000cf542c50ffaf | 问题304:Primonacci | 5 | problem-304-primonacci |
--description--
对于任何正整数n,函数next_prime(n)返回最小质数p,使得p> n。
序列a(n)定义为: 对于n> 1,a(1)= next_prime(1014)和a(n)= next_prime(a(n-1))。
斐波那契数列f(n)定义为: 对于n> 1,f(0)= 0,f(1)= 1和f(n)= f(n-1)+ f(n-2)。
序列b(n)定义为f(a(n))。
求出∑b(n)为1≤n≤100000。 给出答案mod 1234567891011。
--hints--
euler304()
应该返回283988410192。
assert.strictEqual(euler304(), 283988410192);
--seed--
--seed-contents--
function euler304() {
return true;
}
euler304();
--solutions--
// solution required