Binomial Theorem coefficients proof

Click For Summary
SUMMARY

The discussion focuses on proving the Binomial Theorem coefficients using the formula (n k) = n!/k!(n-k)! for k=0,1,...,n. Participants addressed part (b), which states that (n k) + (n k-1) = (n+1 k) for k=1,2,...n, and shared insights on using mathematical induction for part (c). A user initially struggled with notation but later resolved their confusion regarding the representation of binomial coefficients, suggesting the use of LaTeX or alternative notations like C(n,m) or nCm.

PREREQUISITES
  • Understanding of factorial notation and operations
  • Familiarity with binomial coefficients and their properties
  • Basic knowledge of mathematical induction
  • Experience with LaTeX for mathematical notation
NEXT STEPS
  • Study the properties of binomial coefficients in combinatorics
  • Learn the process of mathematical induction in proofs
  • Explore advanced LaTeX formatting for mathematical expressions
  • Review examples of the Binomial Theorem applications in algebra
USEFUL FOR

Students studying combinatorics, mathematics educators, and anyone interested in mastering the Binomial Theorem and its proofs.

srfriggen
Messages
304
Reaction score
7

Homework Statement



Define (n k) = n!/k!(n-k)! for k=0,1,...,n.

Part (b) Show that (n k) + (n k-1) = (n+1 k) for k=1,2,...n.

Part (c) Prove the binomial theorem using mathematical induction and part (b).

Homework Equations





The Attempt at a Solution




I'm wasn't able to find the correct symbols to write out what (n k) should look like (it should be vertical). I hope it is still clear what was meant. If anyone knows what symbols to use on this site please let me know.


I attempted this by using induction, but it got pretty sloppy pretty quickly. Before I try to pursue that route I was wondering if there was a more elegant way to approach the problem. Or if using induction, what would be the best way to start. Perhaps if someone can lay out the approach I should be able to make a good dent in the problem.

I will post any questions about part (c) only after I solve part (b).

Thank you for reading.

 
Physics news on Phys.org
srfriggen said:

Homework Statement



Define (n k) = n!/k!(n-k)! for k=0,1,...,n.

Part (b) Show that (n k) + (n k-1) = (n+1 k) for k=1,2,...n.

Part (c) Prove the binomial theorem using mathematical induction and part (b).

Homework Equations





The Attempt at a Solution




I'm wasn't able to find the correct symbols to write out what (n k) should look like (it should be vertical). I hope it is still clear what was meant. If anyone knows what symbols to use on this site please let me know.


I attempted this by using induction, but it got pretty sloppy pretty quickly. Before I try to pursue that route I was wondering if there was a more elegant way to approach the problem. Or if using induction, what would be the best way to start. Perhaps if someone can lay out the approach I should be able to make a good dent in the problem.

I will post any questions about part (c) only after I solve part (b).

Thank you for reading.

I just realized how to do this part (b). Please disregard.
 
srfriggen said:
I just realized how to do this part (b). Please disregard.

OK, but you also asked about notation. Some standard notations that do not use LaTeX are: C(n,m) or nCm; you get this last one by using the "X2" button in the menu at the top of the input panel. If you want the full, fancy version using LaTeX, you can say "[it e x] {n \choose m} [/i t e x]" for an in-line version or
"[t e x] {n \choose m} [/t e x]" for a displayed version. Remove all spaces in [] and remove the quotation marks. These give {n \choose m} and
{n \choose m}, respectively.

RGV
 

Similar threads

  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 18 ·
Replies
18
Views
2K
Replies
2
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
17
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K