freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-182-rsa-encryption.md

id	challengeType	videoUrl	localeTitle
5900f4231000cf542c50ff35	5		问题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

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

Challenge Seed

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

euler182();

Solution

// solution required

/section>