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
-
Find the longest sequence of 1's in a binary sequence.
6863 Solvers
-
2611 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
170 Solvers
-
Combined Ages 1 - Symmetric, n = 3
335 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!