Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

63 lines
870 B
Markdown

---
id: 5900f40d1000cf542c50ff1f
challengeType: 5
title: 'Problem 160: Factorial trailing digits'
forumTopicId: 301794
---
## Description
<section id='description'>
For any N, let f(N) be the last five digits before the trailing zeroes in N!.
For example,
9! = 362880 so f(9)=36288
10! = 3628800 so f(10)=36288
20! = 2432902008176640000 so f(20)=17664
Find f(1,000,000,000,000)
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler160()</code> should return 16576.
testString: assert.strictEqual(euler160(), 16576);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler160() {
// Good luck!
return true;
}
euler160();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>