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 Solvers14
Suggested Problems
-
3483 Solvers
-
Sum all integers from 1 to 2^n
17413 Solvers
-
97 Solvers
-
Chebyshev polynomials of the 1st Kind
80 Solvers
-
60 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
