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 Solvers16
Suggested Problems
-
3410 Solvers
-
Number of 1s in the Binary Representation of a Number
484 Solvers
-
Permute diagonal and antidiagonal
514 Solvers
-
Converting numbers back from extended form
130 Solvers
-
422 Solvers
More from this Author327
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!