1.0 KiB
1.0 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4ed1000cf542c50ffff | 5 | Problem 383: Divisibility comparison between factorials | 问题383:阶乘之间的可比性比较 |
Description
令T5(n)为满足f5((2·i-1)!)<2·f5(i!)且1≤i≤n的整数i。可以证实T5(103)= 68并且T5(109)= 2408210。
找到T5(1018)。
Instructions
Tests
tests:
- text: <code>euler383()</code>应该返回22173624649806。
testString: 'assert.strictEqual(euler383(), 22173624649806, "<code>euler383()</code> should return 22173624649806.");'
Challenge Seed
function euler383() {
// Good luck!
return true;
}
euler383();
Solution
// solution required