freeCodeCamp/problem-10-summation-of-primes.spanish.md at 6ef8173f1b80e490ea076395d1293ca1791edad4

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

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

1.5 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3761000cf542c50fe89	5	Problem 10: Summation of primes		Problema 10: Suma de números primos

Description

La suma de los números primos debajo de 10 es 2 + 3 + 5 + 7 = 17. Encuentra la suma de todos los números primos debajo de n.

Instructions

Tests

tests:
  - text: <code>primeSummation(17)</code> debe devolver 41.
    testString: 'assert.strictEqual(primeSummation(17), 41, "<code>primeSummation(17)</code> should return 41.");'
  - text: <code>primeSummation(2001)</code> debe devolver 277050.
    testString: 'assert.strictEqual(primeSummation(2001), 277050, "<code>primeSummation(2001)</code> should return 277050.");'
  - text: <code>primeSummation(140759)</code> debe devolver 873608362.
    testString: 'assert.strictEqual(primeSummation(140759), 873608362, "<code>primeSummation(140759)</code> should return 873608362.");'
  - text: <code>primeSummation(2000000)</code> debe devolver 142913828922.
    testString: 'assert.strictEqual(primeSummation(2000000), 142913828922, "<code>primeSummation(2000000)</code> should return 142913828922.");'

Challenge Seed

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

primeSummation(2000000);

Solution

// solution required

1.5 KiB Raw Blame History