(52){{5} \choose {2}} Proofs that (nk)≤(nk+1){{n} \choose {k}} \leq {{n} \choose {k+1}} if k<n/2k<n/2

preprint2010arXivOpen access

Abstract

There is no trivial mathematics, there are only trivial mathematicians! A mathematician is trivial if he or she believes that there exists trivial mathematics. Being a non-trivial mathematician myself, I will describe ten different proofs of the seemingly trivial fact that the number of ways of choosing k people out of n people is less than or equal to the number of ways of choosing k+1 people out of n people, provided that k is less than half of n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.