Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
This commit is contained in:
Oliver Eyton-Williams
2020-11-27 19:02:05 +01:00
committed by GitHub
parent a07f84c8ec
commit 0bd52f8bd1
2580 changed files with 113436 additions and 111979 deletions

View File

@ -1,51 +1,33 @@
---
id: 5900f49d1000cf542c50ffaf
challengeType: 5
title: 'Problem 304: Primonacci'
challengeType: 5
forumTopicId: 301958
---
## Description
<section id='description'>
For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
# --description--
For any positive integer n the function next_prime(n) returns the smallest prime p such that p>n.
The sequence a(n) is defined by:
a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
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.
The sequence a(n) is defined by: a(1)=next_prime(1014) and a(n)=next_prime(a(n-1)) for n>1.
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.
The sequence b(n) is defined as f(a(n)).
Find ∑b(n) for 1≤n≤100 000. Give your answer mod 1234567891011.
Find ∑b(n) for 1≤n≤100 000.
Give your answer mod 1234567891011.
</section>
# --hints--
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler304()</code> should return 283988410192.
testString: assert.strictEqual(euler304(), 283988410192);
`euler304()` should return 283988410192.
```js
assert.strictEqual(euler304(), 283988410192);
```
</section>
# --seed--
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
## --seed-contents--
```js
function euler304() {
@ -56,17 +38,8 @@ function euler304() {
euler304();
```
</div>
</section>
## Solution
<section id='solution'>
# --solutions--
```js
// solution required
```
</section>