freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-187-semiprimes.md

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f4291000cf542c50ff3a	Problem 187: Semiprimes	5	301823	problem-187-semiprimes

--description--

A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.

There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.

How many composite integers, n < {10}^8, have precisely two, not necessarily distinct, prime factors?

--hints--

semiPrimes() should return 17427258.

assert.strictEqual(euler187(), 17427258);

--seed--

--seed-contents--

function semiPrimes() {

  return true;
}

semiPrimes();

--solutions--

// solution required