gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i8n,learn): processed translations

Browse Source
This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-304-primonacci.md
View File

@ -1,26 +1,26 @@
---
id: 5900f49d1000cf542c50ffaf
title: 问题304：Primonacci
title: 'Problem 304: Primonacci'
challengeType: 5
videoUrl: ''
forumTopicId: 301958
dashedName: problem-304-primonacci
---
# --description--
对于任何正整数n，函数next_prime（n）返回最小质数p，使得p> n。
For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
序列a（n）定义为： 对于n> 1，a（1）= next_prime（1014）和a（n）= next_prime（a（n-1））。
The sequence a(n) is defined by: a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
斐波那契数列f（n）定义为： 对于n> 1，f（0）= 0，f（1）= 1和f（n）= f（n-1）+ f（n-2）。
The fibonacci sequence f(n) is defined by: f(0)=0, f(1)=1 and f(n)=f(n-1)+f(n-2) for n>1.
序列b（n）定义为f（a（n））。
The sequence b(n) is defined as f(a(n)).
求出∑b（n）为1≤n≤100000。 给出答案mod 1234567891011。
Find ∑b(n) for 1≤n≤100 000. Give your answer mod 1234567891011.
# --hints--
`euler304()`应该返回283988410192。
`euler304()` should return 283988410192.
```js
assert.strictEqual(euler304(), 283988410192);