freeCodeCamp/problem-182-rsa-encryption.spanish.md at 6ef8173f1b80e490ea076395d1293ca1791edad4

Files

Beau Carnes e3f9dc4b86 feat: add Spanish and language parser

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

2.5 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f4231000cf542c50ff35	5	Problem 182: RSA encryption		Problema 182: cifrado RSA

Description

El cifrado RSA se basa en el siguiente procedimiento: Genere dos primos distintos p y q. Compute n = pq y φ = (p-1) (q-1). Encuentra un entero e, 1

Instrucciones

Pruebas

 tests: - text: <code>euler182()</code> should return 399788195976. testString: 'assert.strictEqual(euler182(), 399788195976, "<code>euler182()</code> should return 399788195976.");'

Semilla de desafío

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

Solución

 // solution required

Instructions

Tests

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

Challenge Seed

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

euler182();

Solution

// solution required

2.5 KiB Raw Blame History