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
-
Project Euler: Problem 9, Pythagorean numbers
1400 Solvers
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1277 Solvers
-
278 Solvers
-
45 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!