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 Solvers17
Suggested Problems
-
Return the 3n+1 sequence for n
8540 Solvers
-
Find state names that start with the letter N
1512 Solvers
-
given 3 sides, find area of this triangle
823 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
432 Solvers
-
200 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!