I came up with them all when I was in a daze during classes in school.
This post is a practice translation for helping myself get familiar to English math terms. So if I made any mistakes, it will be grateful if you could correct them in the comments. Original post (Chinese) is here: https://www.luogu.com.cn/blog/andycode3759/math-proofs
Proposition 1
Proposition: Convex n-polygon $$$(n \geq 4)$$$ has $$${{n(n-3)} \over 2}$$$ diagonals.
Proof: Draw a convex n-polygon in a plane randomly and we can get its $$$n$$$ vertices, among which we can connect any two of them to get $$$C_{n}^{2}$$$ line segments in total, in which $$$n$$$ of them are the edges of the polygon, and the rest $$$C_{n}^{2}-n={{n(n-3)} \over 2}$$$ of them are the diagonals. Proved in only one sentence!
Proposition 2
Proposition: There are two independent (thanks nor for correcting it) finite discrete random variables $$$X$$$ and $$$Y$$$ whose expectations are $$$E(X)$$$ and $$$E(Y)$$$ and variances are $$$D(X)$$$ and $$$D(Y)$$$. Then $$$E(X+Y)=E(X)+E(Y), D(X+Y)=D(X)+D(Y)$$$.
Proof:
(i) Assume the distributions of $$$X$$$ and $$$Y$$$ are $$$P(X=x_i)=p_i(1 \leq i \leq n),P(Y=y_i)=q_i(1 \leq i \leq m)$$$, then
Obviously we have
So
(ii) For convenience, take $$$dx_i$$$ as $$$x_i-E(X)$$$ and $$$dy_i$$$ as $$$y_i-E(Y)$$$. First we need a lemma:
(Also apply to $$$Y$$$.) The proof is simple:
Since we have
Then
Q.E.D.
Proposition 3
Proposition: $$$\forall n \in \mathbb{N}^{+}, 1^2+2^2+3^2+ \dots +n^2 = \sum_{k=1}^{n}k^2 = {1 \over 6}n(n+1)(2n+1)$$$ (The sum of squares of the first $$$n$$$ positive integers).
Proof: It is noticed that:
We can write $$$n$$$ equations like these and add them up, then the left side is $$$1^2+2^2+\dots+n^2$$$, and the right side is the sum of $$$n$$$ times $$$1$$$, $$$(n-1)$$$ times $$$3$$$, ..., $$$(n-k+1)$$$ times $$$(2k-1)$$$, ..., $$$1$$$ times $$$(2n-1)$$$. So we will get
Reduce the right side of the equation:
Do the transposition:
Q.E.D.




