gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
ef79ddd0de35a4e10b8b4588e67938f86d2bae10
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-290-digital-signature.english.md
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

806 B
Raw Blame History

id, challengeType, isHidden, title, forumTopicId
id challengeType isHidden title forumTopicId
5900f48f1000cf542c50ffa1 5 false Problem 290: Digital Signature 301942

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?

Instructions

Tests

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

Challenge Seed

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

euler290();

Solution

// solution required