Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.md

24 lines
474 B
Markdown
Raw Blame History

This file contains ambiguous Unicode characters
This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.
---
id: 5900f4791000cf542c50ff8b
title: 问题268计算至少有四个不同素因子小于100的数字
challengeType: 5
videoUrl: ''
---
# --description--
可以证实有23个小于1000的正整数可被至少四个小于100的不同质数整除。
找出少于1016的正整数可被至少四个小于100的不同质数整除。
# --hints--
`euler268()`应该返回785478606870985。
```js
assert.strictEqual(euler268(), 785478606870985);
```
# --solutions--