Image taken from MathWorld.
Let \( \Sigma (m) \) be the sum of the first \( m \) prime numbers.
Level 1 - Evaluate .
Level 2 - Evaluate .
Level 3 - Evaluate the next pair of integers such that the equation holds.
Level 4 - Find a closed-form formula or a quick recurrence for that works perfectly for
Level 5 - Are there infinitely many pairs of integers such that the equation holds? Prove or disprove this conjecture.
Computer Science answers are strongly recommended after Level 3. Manual solutions, however, will be accepted and rewarded with a million Zimbabwean dollars.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Level 1's answer is 1 and Level 2's answer is 2. How trivial.