The problem
Show that for every integer ,
Try it three ways: from the binomial theorem, by counting the subsets of an -element set, and by induction using Pascal's rule. One of them will feel like an explanation and the others like a check.
0 proofs posted
0 votes castNo proofs yet
Be the first to put an argument on the board.