freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-383-divisibility-co...

26 lines
518 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters!

This file contains ambiguous Unicode characters that may be confused with others in your current locale. If your use case is intentional and legitimate, you can safely ignore this warning. Use the Escape button to highlight these characters.

---
id: 5900f4ed1000cf542c50ffff
title: 问题383阶乘之间的可比性比较
challengeType: 5
videoUrl: ''
---
# --description--
设f5n是最大整数x其中5x除以n。例如f5625000= 7。
令T5n为满足f52·i-1<2·f5i且1≤i≤n的整数i。可以证实T5103= 68并且T5109= 2408210。
找到T51018
# --hints--
`euler383()`应该返回22173624649806。
```js
assert.strictEqual(euler383(), 22173624649806);
```
# --solutions--