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

24 lines
488 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
---
id: 5900f4531000cf542c50ff66
title: 问题231二项式系数的素因子化
challengeType: 5
videoUrl: ''
---
# --description--
二项式系数10C3 = 120. 120 = 23×3×5 = 2×2×2×3×5并且2 + 2 + 2 + 3 + 5 = 14.因此素数因子分解中的项的总和为10C3是14岁。
找出素数因子分解中的术语总和为20000000C15000000。
# --hints--
`euler231()`应该返回7526965179680。
```js
assert.strictEqual(euler231(), 7526965179680);
```
# --solutions--