freeCodeCamp/problem-193-squarefree-numbers.english.md at 1f310d8c5877a13cf67fbfaad323b4a558a0ac3c

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

901 B

Raw Blame History

id, challengeType, title

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

901 B Raw Blame History