IFRAME SYNC
IFRAME SYNC
IFRAME SYNC
IFRAME SYNC

proving the identity $b^3 = 6\binom{b}{3} + 6\binom{b}{2} + b$ for $b \in \mathbb{N}$, $b > 2$, by counting a set in different ways

I'm trying to prove that $\forall b \in \mathbb{N}, b>2,$ $b^{3} = 6\binom{b} {3} +6 \binom{b}{2} +b$ without just using algebra. The idea I've thought about is that there are $b^{3}$ ways to choose a triple of numbers from $\{1,\ldots, b\}$, and there are obviously $b$ ways to choose one element, the issue is I'm not sure how the $\binom{b}{3}$ and $\binom{b}{2}$ terms contribute. Any help would be greatly appreciated.



from Hot Weekly Questions - Mathematics Stack Exchange

Post a Comment

[blogger]

Contact Form

Name

Email *

Message *

copyrighted to mathematicianadda.com. Powered by Blogger.
Javascript DisablePlease Enable Javascript To See All Widget

Blog Archive