freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-362-squarefree-factors.english.md

---
id: 5900f4d61000cf542c50ffe9
challengeType: 5
title: 'Problem 362: Squarefree factors'
---

## Description
<section id='description'>
Consider the number 54.
54 can be factored in 7 distinct ways into one or more factors larger than 1:
54, 2×27, 3×18, 6×9, 3×3×6, 2×3×9 and 2×3×3×3.
If we require that the factors are all squarefree only two ways remain: 3×3×6 and 2×3×3×3.


Let's call Fsf(n) the number of ways n can be factored into one or more squarefree factors larger than 1, so
Fsf(54)=2.


Let S(n) be ∑Fsf(k) for k=2 to n.


S(100)=193.


Find S(10 000 000 000).
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler362()</code> should return 457895958010.
    testString: assert.strictEqual(euler362(), 457895958010);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler362() {
  // Good luck!
  return true;
}

euler362();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>