freeCodeCamp/problem-182-rsa-encryption.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.9 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4231000cf542c50ff35	5	false	Problem 182: RSA encryption	301818

Description

The RSA encryption is based on the following procedure: Generate two distinct primes p and q.Compute n=pq and φ=(p-1)(q-1). Find an integer e, 1

Instructions

Tests

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

Challenge Seed

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

euler182();

Solution

// solution required

1.9 KiB Raw Blame History