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
-
3414 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2078 Solvers
-
Get the length of a given vector
13880 Solvers
-
756 Solvers
-
151 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!