A semiprime number—or a 2-almost prime—is the product of two prime numbers. The numbers
and
are semiprimes, but
and
are not. The semiprimes appear in three of Ramon Villamangca’s “Easy Sequences”: Cody Problems 52859, 52990, and 53740.
Write a function to list the semiprime numbers less than or equal to the input number.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers17
Suggested Problems
-
118414 Solvers
-
297 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1407 Solvers
-
1480 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2244 Solvers
More from this Author329
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!