Project Euler > Problem 187 > Semiprimes (Java Solution)

Problem:

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 [<] 108, have precisely two, not necessarily distinct, prime factors?

Solution:

748317

Code:
The solution may include methods that will be found here: Library.java .

public interface EulerSolution{

public String run();

}

We don't have code for that problem yet! If you solved that out using Java, feel free to contribute it to our website, using our "Upload" form.