freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-248-numbers-for-which-eulers-totient-function-equals-13.md

id	challengeType	videoUrl	localeTitle
5900f4651000cf542c50ff77	5		问题248：Euler的totient函数等于13的数字！

Description

φ（n）= 13的第一个数字n！是6227180929.找到第150,000个这样的数字。

Instructions

Tests

tests:
  - text: <code>euler248()</code>应返回23507044290。
    testString: assert.strictEqual(euler248(), 23507044290);

Challenge Seed

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

euler248();

Solution

// solution required

/section>