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.
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
-
Split a string into chunks of specified length
2157 Solvers
-
143 Solvers
-
Self-similarity 2 - Every third term
67 Solvers
-
61 Solvers
-
Where the Four Corners Am I? (Vectorized)
156 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!
