f1c9b08cf3
This includes certificates (where it does nothing), but does not include any translations.
66 lines
1.0 KiB
Markdown
66 lines
1.0 KiB
Markdown
---
|
|
id: 5900f5471000cf542c510059
|
|
challengeType: 5
|
|
isHidden: false
|
|
title: 'Problem 474: Last digits of divisors'
|
|
forumTopicId: 302151
|
|
---
|
|
|
|
## Description
|
|
<section id='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) = 17888.
|
|
|
|
|
|
Find F(106!, 65432) modulo (1016 + 61).
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler474()</code> should return 9690646731515010.
|
|
testString: assert.strictEqual(euler474(), 9690646731515010);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler474() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler474();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|