freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-231-the-prime-factorisation-of-binomial-coefficients.md

id	challengeType	videoUrl	localeTitle
5900f4531000cf542c50ff66	5		问题231：二项式系数的素因子化

Description

二项式系数10C3 = 120. 120 = 23×3×5 = 2×2×2×3×5，并且2 + 2 + 2 + 3 + 5 = 14.因此，素数因子分解中的项的总和为10C3是14岁。

找出素数因子分解中的术语总和为20000000C15000000。

Instructions

Tests

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

Challenge Seed

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

euler231();

Solution

// solution required

/section>