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

---
id: 5900f4291000cf542c50ff3a
title: 'Problem 187: Semiprimes'
challengeType: 5
forumTopicId: 301823
---

# --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 &lt; 108, have precisely two, not necessarily distinct, prime factors?

# --hints--

`euler187()` should return 17427258.

```js
assert.strictEqual(euler187(), 17427258);
```

# --seed--

## --seed-contents--

```js
function euler187() {

  return true;
}

euler187();
```

# --solutions--

```js
// solution required
```
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
+								---
 								id: 5900f4291000cf542c50ff3a
 								title: 'Problem 187: Semiprimes'
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								challengeType: 5
-												fix(curriculum): Added forumTopicId to remaining 1200 challeng… (#36558)


											
										
										
											2019-08-05 16:17:33 +00:00
+								forumTopicId: 301823
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
+								---
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								# --description--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								A composite is a number containing at least two prime factors. For example, 15 = 3 × 5; 9 = 3 × 3; 12 = 2 × 2 × 3.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								How many composite integers, n &lt; 108, have precisely two, not necessarily distinct, prime factors?
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								# --hints--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								`euler187()` should return 17427258.
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								```js
 								assert.strictEqual(euler187(), 17427258);
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
+								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								# --seed--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								## --seed-contents--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
 								```js
 								function euler187() {
-												fix: remove Good luck! comment from challenge seed code (#39575)


											
										
										
											2020-09-15 16:57:40 +00:00
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
+								  return true;
 								}
 								euler187();
 								```
-												Feat: add new Markdown parser (#39800)

and change all the challenges to new `md` format.
											
										
										
											2020-11-27 18:02:05 +00:00
+								# --solutions--
-												feat(challenge-md): Add initial markdown challenge files

											
										
										
											2018-09-30 22:01:58 +00:00
 								```js
 								// solution required
 								```