freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-268-counting-numbers-with-at-least-four-distinct-prime-factors-less-than-100.english.md

id, challengeType, title

id	challengeType	title
5900f4791000cf542c50ff8b	5	Problem 268: Counting numbers with at least four distinct prime factors less than 100

Description

It can be verified that there are 23 positive integers less than 1000 that are divisible by at least four distinct primes less than 100.

Find how many positive integers less than 1016 are divisible by at least four distinct primes less than 100.

Instructions

Tests

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

Challenge Seed

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

euler268();

Solution

// solution required