Problem 55275. List the semiprimes

• Created by ChrisR

×

Like (0)

Difficulty:

(338)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

35.56% Correct | 64.44% Incorrect

• 45 Solutions
• 13 Solvers

Last Solution submitted on Dec 18, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers13

Suggested Problems

• How to find the position of an element in a vector without using the find function

  2752 Solvers

• Sorted highest to lowest?

  1570 Solvers

• First N Perfect Squares

  878 Solvers

• Can we make a triangle?

  2087 Solvers

• Pi Digit Probability

  676 Solvers

More from this Author298

• Compute expulsions from the Kimberling shuffle

  9 Solvers

• List unitary divisors of a number

  12 Solvers

• Generate a list of composite numbers

  51 Solvers

• Count block fountains

  6 Solvers

• List numbers such that every sum of consecutive positive integers ending in those numbers is composite

  7 Solvers