397a9f0c3e
* fix: clean-up Project Euler 462-480 * fix: missing image extension * fix: corrections from review Co-authored-by: Tom <20648924+moT01@users.noreply.github.com> Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
45 lines
919 B
Markdown
45 lines
919 B
Markdown
---
|
|
id: 5900f5471000cf542c510059
|
|
title: 'Problem 474: Last digits of divisors'
|
|
challengeType: 5
|
|
forumTopicId: 302151
|
|
dashedName: problem-474-last-digits-of-divisors
|
|
---
|
|
|
|
# --description--
|
|
|
|
For a positive integer $n$ and digits $d$, we define $F(n, d)$ as the number of the divisors of $n$ whose last digits equal $d$.
|
|
|
|
For example, $F(84, 4) = 3$. Among the divisors of 84 (1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84), three of them (4, 14, 84) have the last digit 4.
|
|
|
|
We can also verify that $F(12!, 12) = 11$ and $F(50!, 123) = 17\\,888$.
|
|
|
|
Find $F({10}^6!, 65\\,432) \text{ modulo } ({10}^{16} + 61)$.
|
|
|
|
# --hints--
|
|
|
|
`lastDigitsOfDivisors()` should return `9690646731515010`.
|
|
|
|
```js
|
|
assert.strictEqual(lastDigitsOfDivisors(), 9690646731515010);
|
|
```
|
|
|
|
# --seed--
|
|
|
|
## --seed-contents--
|
|
|
|
```js
|
|
function lastDigitsOfDivisors() {
|
|
|
|
return true;
|
|
}
|
|
|
|
lastDigitsOfDivisors();
|
|
```
|
|
|
|
# --solutions--
|
|
|
|
```js
|
|
// solution required
|
|
```
|