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
-
Return the 3n+1 sequence for n
8511 Solvers
-
Implement a bubble sort technique and output the number of swaps required
396 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
650 Solvers
-
calculate PI without using pi function
108 Solvers
-
674 Solvers
More from this Author325
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
