freeCodeCamp/problem-365-a-huge-binomial-coefficient.spanish.md at 5207a8f52a80f726fa360ae2a64ad7ea81ef55aa

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

2018-10-11 02:15:05 +05:30

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4da1000cf542c50ffec	5	Problem 365: A huge binomial coefficient		Problema 365: Un enorme coeficiente binomial

Description

El coeficiente binomial C (1018,109) es un número con más de 9 mil millones (9 × 109) dígitos.

Sea M (n, k, m) el coeficiente binomial C (n, k) módulo m.

Calcule ∑M (1018,109, p q r) para 1000 <p <q <r <5000 yp, q, r prime.

Instructions

Tests

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

Challenge Seed

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

euler365();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape