freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-330-eulers-number.md

40 lines
720 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f4b71000cf542c50ffc9
title: 问题330欧拉数
challengeType: 5
videoUrl: ''
---
# --description--
为所有整数n定义了无限的实数序列an如下所示
例如a0= 11 + 12 + 13 + ... = e - 1 a1= e - 11 + 12 + 13 + ... = 2e - 3 a2= 2e - 31 + e - 12 + 13 + ... = 72 e - 6
e = 2.7182818 ......是欧拉常数。
可以证明an是形式
```
A(n) e + B(n)n! for integers A(n) and B(n).
```
例如a10=
```
328161643 e 65269448610! .
```
求A109+ B109并给出答案mod 77 777 777。
# --hints--
`euler330()`应该返回15955822。
```js
assert.strictEqual(euler330(), 15955822);
```
# --solutions--