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 Solvers14
Suggested Problems
-
3082 Solvers
-
Matrix indexing with two vectors of indices
775 Solvers
-
352 Solvers
-
Natural numbers in string form
1857 Solvers
-
Divide elements by sum of elements
139 Solvers
More from this Author322
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!