freeCodeCamp/curriculum/challenges/russian/08-coding-interview-prep/project-euler/problem-381-prime-k-factorial.russian.md

id, challengeType, title, forumTopicId, localeTitle

id	challengeType	title	forumTopicId	localeTitle
5900f4ea1000cf542c50fffc	5	Problem 381: (prime-k) factorial	302045	Problem 381: (prime-k) factorial

Description

Для простого p пусть S (p) = (Σ (pk)!) Mod (p) для 1 ≤ k ≤ 5.

Например, если 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.

Можно проверить, что ΣS (p) = 480 для 5 ≤ p <100.

Найти ΣS (p) для 5 ≤ p <108.

Instructions

Tests

tests:
  - text: <code>euler381()</code> should return 139602943319822.
    testString: assert.strictEqual(euler381(), 139602943319822);

Challenge Seed

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

euler381();

Solution

// solution required