freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-235-an-arithmetic-geometric-sequence.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f4571000cf542c50ff6a	5	Problem 235: An Arithmetic Geometric sequence		问题235：算术几何序列

Description

给定是算术几何序列u（k）=（900-3k）rk-1。设s（n）=Σk= 1 ... nu（k）。

找到r的值，其中s（5000）= - 600,000,000,000。

将您的答案四舍五入到小数点后面的12位。

Instructions

Tests

tests:
  - text: <code>euler235()</code>应该返回1.002322108633。
    testString: 'assert.strictEqual(euler235(), 1.002322108633, "<code>euler235()</code> should return 1.002322108633.");'

Challenge Seed

function euler235() {
  // Good luck!
  return true;
}

euler235();

Solution

// solution required