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

id	challengeType	title
5900f42f1000cf542c50ff41	5	Problem 193: Squarefree Numbers

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?

Instructions

Tests

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

Challenge Seed

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

euler193();

Solution

// solution required