--- id: 5900f4231000cf542c50ff35 challengeType: 5 title: 'Problem 182: RSA encryption' videoUrl: '' localeTitle: '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

```yml tests: - text: euler182() debe devolver 399788195976. testString: 'assert.strictEqual(euler182(), 399788195976, "euler182() should return 399788195976.");' ```

## Challenge Seed

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

## Solution

```js // solution required ```