--- id: 5900f4231000cf542c50ff35 challengeType: 5 title: 'Problem 182: RSA encryption' videoUrl: '' localeTitle: 问题182：RSA加密 --- ## Description

RSA加密基于以下过程：生成两个不同的素数p和q。计算n = pq和φ=（p-1）（q-1）。求整数e，1

说明

测试

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

挑战种子

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

解

 // solution required

## Instructions

## Tests

```yml tests: - text: euler182()应该返回399788195976。 testString: 'assert.strictEqual(euler182(), 399788195976, "euler182() should return 399788195976.");' ```

## Challenge Seed

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

## Solution

```js // solution required ```