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 Solvers15
Suggested Problems
-
The Goldbach Conjecture, Part 2
2416 Solvers
-
Back to basics 21 - Matrix replicating
1807 Solvers
-
Moving average (variable kernel length)
137 Solvers
-
Create the following sequence : 0 1 1 4 9 25 64 169 ...
204 Solvers
-
Label primes with the Erdos-Selfridge classification
14 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!