1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f4ea1000cf542c50fffc | 5 | Problem 381: (prime-k) factorial | 问题381:(prime-k)阶乘 |
Description
例如,如果p = 7,(7-1)! +(7-2)! +(7-3)! +(7-4)! +(7-5)! = 6! + 5! + 4! + 3! + 2! = 720 + 120 + 24 + 6 + 2 = 872.当872 mod(7)= 4时,S(7)= 4。
对于5≤p<100,可以证实ΣS(p)= 480。
求ΣS(p)为5≤p<108。
Instructions
Tests
tests:
- text: <code>euler381()</code>应该返回139602943319822。
testString: 'assert.strictEqual(euler381(), 139602943319822, "<code>euler381()</code> should return 139602943319822.");'
Challenge Seed
function euler381() {
// Good luck!
return true;
}
euler381();
Solution
// solution required