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 Solvers16
Suggested Problems
-
Remove the two elements next to NaN value
710 Solvers
-
Check if a matrix is a palindrome in all directions
135 Solvers
-
482 Solvers
-
Compute the nth Pythagorean prime
100 Solvers
-
Label primes with the Erdos-Selfridge classification
16 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!
