freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-422-sequence-of-poi...

47 lines
1.1 KiB
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: 5900f5131000cf542c510025
title: 问题422双曲线上的点序列
challengeType: 5
videoUrl: ''
dashedName: problem-422-sequence-of-points-on-a-hyperbola
---
# --description--
假设H是由等式12x2 + 7xy-12y2 = 625定义的双曲线。
接下来将X定义为点71。 可以看出X在H中。
现在我们将H中的点序列{Pii≥1}定义为: P1 =1361/4。 P2 =-43/6-4。 对于i> 2Pi是H中与Pi-1不同的唯一点因此线PiPi-1与线Pi-2X平行。 可以证明Pi是定义明确的并且其坐标始终是有理的。 您得到P3 =-19/2-229/24P4 =1267/144-37/12和P7 =17194218091/143327232274748766781/1719926784
用以下格式找到n = 1114的Pn如果Pn =a / bc / d其中分数是最低项而分母是正数则答案是a + b + c + dmod 1 000 007。
对于n = 7答案应该是806236837。
# --hints--
`euler422()`应该返回92060460。
```js
assert.strictEqual(euler422(), 92060460);
```
# --seed--
## --seed-contents--
```js
function euler422() {
return true;
}
euler422();
```
# --solutions--
```js
// solution required
```