Semiprimes

Problem Statement

A composite is a number containing at least two prime factors. For example, $15 = 3 \times 5$; $9 = 3 \times 3$; $12 = 2 \times 2 \times 3$.

There are ten composites below thirty containing precisely two, not necessarily distinct, prime factors: $4, 6, 9, 10, 14, 15, 21, 22, 25, 26$.

How many composite integers, $n \lt 3 \times 2^N$, have precisely two, not necessarily distinct, prime factors?

Submit Answers

You need to submit in the format: "N:problem(N)", possibly with multiple values at once, separated by commas, with $N$ between $1$ and $100$.

Top Users

🥇 shs10978
54.84 (56)
🥈 icy
54.84 (55)
🥉 mmtg
26.16 (29)
4 jonnytang
25.84 (26)
5 Nondegon
25.84 (26)
6 CandynightJ
2.96 (3)

Data

Stats

Your submissions will appear here

Recent Submissions

1
shs10978
$g(56)$, $17$ digits 5 hours, 17 minutes ago
2
shs10978
$g(55)$, $17$ digits 6 hours, 26 minutes ago
3
shs10978
$g(54)$, $16$ digits 7 hours, 11 minutes ago
4
shs10978
$g(53)$, $16$ digits 7 hours, 11 minutes ago
5
shs10978
$g(52)$, $16$ digits 7 hours, 11 minutes ago