Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Do you have proofs without word?

Your proofs are not necessary has zero word, you may add a bit explanations.

As an example, I has a "Speechless proof" for $$\frac{1}{4}+\frac{1}{4^2}+\frac{1}{4^3}+...=\frac{1}{3}$$ enter image description here

I welcome all aspects of mathematical proofs. Thank you.

share|cite|improve this question
These are usually called proofs without words. MathOverflow has a nice list of them. – Rahul Nov 5 '12 at 9:05
Please feel please to post your proof even it's similar to those in MathsOverFlow, because we are here in MathStackExchange. – ᴊ ᴀ s ᴏ ɴ Nov 5 '12 at 9:58
(-1) There is already some many lists of proof without words... It is not a very imaginative question. At least it, should be community wiki. – Lierre Nov 5 '12 at 10:19
For this question, what's really important are imaginative answers. – ᴊ ᴀ s ᴏ ɴ Nov 5 '12 at 10:27
In fact, this particular example is not obvious without some words (at least to me)! – NoChance Nov 5 '12 at 10:40
up vote 0 down vote accepted

Part of the proof in my blog post is done with my own ad-hoc diagrams..

grid with tour

The question is: How many "tours" (paths that visit every single square exactly once) are there in a 4x10^12 grid under the condition the tour must start in the top left square and finish in the bottom left square. (Credit to the guys at for thinking up another great problem)

If we let T(n) be the formula for the number of tours in a 4xn grid, we need to find T(10^12). One approach is to find a recurrence relation. A trick is to realize there are only two possible ending columns. Try follow my working if you can, sorry It's messy :)


share|cite|improve this answer

The best one I have ever seen is to prove $$1 + 2 + 3 + \cdots + n = \dfrac{n(n+1)}2$$

enter image description here

share|cite|improve this answer
Should we just copy the MO answers here - or link to them from here? – Old John Nov 5 '12 at 9:50
Could somebody give me the "with words" version of this proof? – littleO Nov 5 '12 at 10:05
@littleO There's a bijection in there. Look carefully. Perhaps it would be more helpful if we wrote $\frac{n(n+1)}{2}$ as $\binom{n+1}{2}$ – EuYu Nov 5 '12 at 10:09
Ohh, I see, crazy. Thanks for the hint. – littleO Nov 5 '12 at 12:00
@OldJohn I don't know. I anyway made my post CW when I posted it. – user17762 Nov 5 '12 at 21:48

Found this great one surfing the web recently. $$ \displaystyle 1/2+1/4+1/8+1/16+\ldots =1 $$ Classic geometric sum

share|cite|improve this answer

Convergence of reciprocal of squares

Reciprocals of squares converge.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.