47fc3c6761
* fix: clean-up Project Euler 281-300 * fix: missing image extension * fix: missing power Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> * fix: missing subscript Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
39 lines
611 B
Markdown
39 lines
611 B
Markdown
---
|
|
id: 5900f48f1000cf542c50ffa1
|
|
title: 'Problem 290: Digital Signature'
|
|
challengeType: 5
|
|
forumTopicId: 301942
|
|
dashedName: problem-290-digital-signature
|
|
---
|
|
|
|
# --description--
|
|
|
|
How many integers $0 ≤ n < {10}^{18}$ have the property that the sum of the digits of $n$ equals the sum of digits of $137n$?
|
|
|
|
# --hints--
|
|
|
|
`digitalSignature()` should return `20444710234716470`.
|
|
|
|
```js
|
|
assert.strictEqual(digitalSignature(), 20444710234716470);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function digitalSignature() {
|
|
|
|
return true;
|
|
}
|
|
|
|
digitalSignature();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|