Problem 55275. List the semiprimes
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 commentsGroup

Prime Numbers III
- 19 Problems
- 4 Finishers
- List the Moran numbers
- List the cuban primes
- Compute the largest number whose prime factors sum to n
- List the Beatriz numbers
- List the Euclid numbers
- List odd twin composites
- List the semiprimes
- Solve an equation involving primes and fractions
- List the two-bit primes
- List numbers such that every sum of consecutive positive integers ending in those numbers is composite
- Identify de Polignac numbers
- List the Fermi-Dirac primes
- Factor a number into Fermi-Dirac primes
- Compute the Sisyphus sequence
- Compute the bubble popper fidget spinner sequence
- Determine whether a number is a Zeisel number
- Express numbers as the sum of a prime, a square, and a cube
- Determine whether a number is a Gaussian prime
- List primes of the form xy+z
Problem Recent Solvers13
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!