freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-193-squarefree-numb...

686 B

id title challengeType forumTopicId dashedName
5900f42f1000cf542c50ff41 Problem 193: Squarefree Numbers 5 301831 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 2^{50}?

--hints--

squarefreeNumbers() should return 684465067343069.

assert.strictEqual(squarefreeNumbers(), 684465067343069);

--seed--

--seed-contents--

function squarefreeNumbers() {

  return true;
}

squarefreeNumbers();

--solutions--

// solution required