freeCodeCamp

1.1 KiB

Raw Blame History

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

Description

Para una cebada p, deje que S (p) = (∑ (pk)!) Mod (p) para 1 ≤ k ≤ 5.

Por ejemplo, si p = 7, (7-1)! + (7-2)! + (7-3)! + (7-4)! + (7-5)! = 6! + 5! + 4! + 3! + 2! = 720 + 120 + 24 + 6 + 2 = 872. Como 872 mod (7) = 4, S (7) = 4.

Se puede verificar que ∑S (p) = 480 para 5 ≤ p <100.

Encuentre ∑S (p) para 5 ≤ p <108.

Instructions

Tests

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

Challenge Seed

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

euler381();

Solution

// solution required

1.1 KiB Raw Blame History