Two one sentence proofs

Continuing in the same vein here are two one sentence proofs.

Theorem: For x,y\in\mathbb{C}, n\in\mathbb{N} we have (x+y)^n=\sum_{k=0}^{n}\tbinom{n}{k}x^ky^{n-k}.

Proof: The coefficient of x^ky^{n-k} in the left hand side of the given expression, i.e. in \underbrace{(x+y)(x+y)\cdots (x+y)}_{\text{n terms}}, is obtained by selecting exactly k parenthesis out of the total n available to yield the x's, (the remaining parenthesis yield the y's), which can be done in \tbinom{n}{k} ways following which the coefficient is exactly \tbinom{n}{k}.\Box

Theorem: \sqrt{2} is irrational.

Proof: If \sqrt{2}=m/n is in lowest terms then \sqrt{2}=(2n-m)/(m-n) is in lower terms.\Box

Remark: The above proof generalizes to the case when k is a non-square positive integer. Indeed, if j<\sqrt{k}<j+1 then assuming that \sqrt{k}=m/n is in lowest terms also implies that \sqrt{k}=(kn-jm)/(m-jn) is in lower terms.


Leave a comment

Filed under Combinatorics, Miscellaneous

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s