Project Euler > Problem 193 > Squarefree Numbers (Java Solution)

Problem:

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 250?

Solution:

16695334890

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.