Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-290-digital-signature.md
Oliver Eyton-Williams ee1e8abd87 feat(curriculum): restore seed + solution to Chinese (#40683)
* feat(tools): add seed/solution restore script

* chore(curriculum): remove empty sections' markers

* chore(curriculum): add seed + solution to Chinese

* chore: remove old formatter

* fix: update getChallenges

parse translated challenges separately, without reference to the source

* chore(curriculum): add dashedName to English

* chore(curriculum): add dashedName to Chinese

* refactor: remove unused challenge property 'name'

* fix: relax dashedName requirement

* fix: stray tag

Remove stray `pre` tag from challenge file.

Signed-off-by: nhcarrigan <nhcarrigan@gmail.com>

Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
2021-01-12 19:31:00 -07:00

566 B

id, title, challengeType, forumTopicId, dashedName
id title challengeType forumTopicId dashedName
5900f48f1000cf542c50ffa1 Problem 290: Digital Signature 5 301942 problem-290-digital-signature

--description--

How many integers 0 ≤ n < 1018 have the property that the sum of the digits of n equals the sum of digits of 137n?

--hints--

euler290() should return 20444710234716470.

assert.strictEqual(euler290(), 20444710234716470);

--seed--

--seed-contents--

function euler290() {

  return true;
}

euler290();

--solutions--

// solution required