# Prime numbers

The product of four prime numbers $$a, b, c$$ and $$d$$ is the sum of 55 consecutive numbers. Find the smallest possible value of $$a+b+c+d$$.

Note by Avanthi Vasudevan
1 year, 2 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Note that the sum of 55 consecutive numbers will always be divisible by 55; (sum equals 55*n ; where n is the middle term)
Hence; 2 of the primes must be 5 and 11; then to minimise the sum; take the other 2 primes as 2 and 2 or if you want different primes; 2 and 3.
So; the sum will be 20 or 21 according to whether duplication of primes is allowed or not.

- 1 year, 2 months ago

Pls help.. urgent...

- 1 year, 2 months ago