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

---
id: 5900f42f1000cf542c50ff41
challengeType: 5
title: 'Problem 193: Squarefree Numbers'
---

## Description
<section id='description'>
A positive integer n is called squarefree, if no square of a prime divides n, thus 1, 2, 3, 5, 6, 7, 10, 11 are squarefree, but not 4, 8, 9, 12.

How many squarefree numbers are there below 250?
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

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

```

</section>

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

<div id='js-seed'>

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

euler193();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>