Take any number m (let's say 3).
Write all the numbers starting from 1 in one line.
Eliminate numbers at the index k (k≡0(modm))
Now write for each index, partial sum of the numbers till that index.
Eliminate numbers at the index k (k≡m−1(modm)).
Now write for each index, partial sum of the numbers till that index.
⋮
2m-1. Eliminate numbers at the index k (k≡2(modm)).
2m. Now write for each index, partial sum of the numbers till that index.
For example, for m=3,
1111122334477855126771919278827910103737641111481213136161125
We get a sequence of nm!
Prove that this happens for any number of numbers and for any natural number m.
PS - This is not a challenge. This is seeking help.
#Combinatorics
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
(1) I have fixed your LaTeX. The correct code here is "\begin{array}".
(2) This result is known as Moessner's Theorem.
Log in to reply
Oh I see. Thanks! I will look into the references. BTW, can you give a simplified proof?
Log in to reply
@Jon Haussmann
I'm afraid I don't know the proof. I think it's a hard result.
Log in to reply
@Mark Hennings @Pi Han Goh @Ishan Singh Please also fix the latex!
This is seriously magic. Another math-e-magical thing with which you can fascinate a primary school student and can "irritate" a mathematician.
(Another such thing is the Goldbach's Theorem).