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 Solvers16
Suggested Problems
-
3449 Solvers
-
Calculate the Levenshtein distance between two strings
1513 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
266 Solvers
-
6021 Solvers
-
Create the following sequence : 0 1 1 4 9 25 64 169 ...
206 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!