${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$

Details ${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$ ${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$

2010-03-05

arxiv.org/abs/1003.1273v1

Mathematics

Combinatorics

Transcript of a mathematics colloquium talk delivered at Columbia University on Feb. 17, 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with ${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and ${5\choose 2}$ Proofs that ${n\choose k} \leq {n\choose {k+1}}$ if $k<n/2$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687719