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 Solvers15
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
255 Solvers
-
Numbers with prime factors 2, 3 and 5.
683 Solvers
-
357 Solvers
-
Converting numbers back from extended form
129 Solvers
-
68 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!