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
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
560 Solvers
-
465 Solvers
-
Lychrel Number Test (Inspired by Project Euler Problem 55)
118 Solvers
-
The number of trailing zero digit of a factorial
66 Solvers
-
Sums of Multiple Pairs of Triangular Numbers
249 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!
