Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
    • Number of Print Columns
  • Include attachments
Searching in
About 36 results
  • https://math.libretexts.org/Courses/SUNY_Schenectady_County_Community_College/Discrete_Structures/11%3A_Counting/11.04%3A_Combinatorial_Proofs
    To give a combinatorial proof for a binomial identity, say A=B you do the following: (1) Find a counting problem you will be able to answer in two ways. (2) Explain why one answer to the counting pr...To give a combinatorial proof for a binomial identity, say A=B you do the following: (1) Find a counting problem you will be able to answer in two ways. (2) Explain why one answer to the counting problem is A. (3) Explain why the other answer to the counting problem is B. Since both A and B are the answers to the same question, we must have A=B. The tricky thing is coming up with the question.
  • https://math.libretexts.org/Bookshelves/Precalculus/Precalculus_(Stitz-Zeager)/09%3A_Sequences_and_the_Binomial_Theorem/9.04%3A_The_Binomial_Theorem
    Simply stated, the Binomial Theorem is a formula for the expansion of quantities for natural numbers.
  • https://math.libretexts.org/Courses/Lorain_County_Community_College/Book%3A_Precalculus_(Stitz-Zeager)_-_Jen_Test_Copy/09%3A_Sequences_and_the_Binomial_Theorem/9.04%3A_The_Binomial_Theorem
    Simply stated, the Binomial Theorem is a formula for the expansion of quantities for natural numbers.
  • https://math.libretexts.org/Bookshelves/Precalculus/Precalculus_2e_(OpenStax)/11%3A_Sequences_Probability_and_Counting_Theory/11.07%3A_Binomial_Theorem
    A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consumi...A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consuming. In this section, we will discuss a shortcut that will allow us to find (x+y)n without multiplying the binomial by itself n times.
  • https://math.libretexts.org/Courses/Lorain_County_Community_College/Book%3A_Precalculus_Jeffy_Edits_3.75/09%3A_Sequences_and_the_Binomial_Theorem/9.04%3A_The_Binomial_Theorem
    Simply stated, the Binomial Theorem is a formula for the expansion of quantities for natural numbers.
  • https://math.libretexts.org/Bookshelves/Precalculus/Precalculus_1e_(OpenStax)/11%3A_Sequences_Probability_and_Counting_Theory/11.06%3A_Binomial_Theorem
    A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consumi...A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consuming. In this section, we will discuss a shortcut that will allow us to find (x+y)n without multiplying the binomial by itself n times.
  • https://math.libretexts.org/Courses/Truckee_Meadows_Community_College/TMCC%3A_Precalculus_I_and_II/Under_Construction_test2_11%3A_Sequences_Probability_and_Counting_Theory/Under_Construction_test2_11%3A_Sequences_Probability_and_Counting_Theory_11.6%3A_Binomial_Theorem
    A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consumi...A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consuming. In this section, we will discuss a shortcut that will allow us to find (x+y)n without multiplying the binomial by itself n times.
  • https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/A_Spiral_Workbook_for_Discrete_Mathematics_(Kwong)/08%3A_Combinatorics/8.05%3A_The_Binomial_Theorem
    A binomial is a polynomial with exactly two terms. The binomial theorem gives a formula for expanding (x+y)ⁿ for any positive integer n .
  • https://math.libretexts.org/Courses/Monroe_Community_College/Supplements_for_Discrete_Judy_Dean/02%3A_Counting/2.04%3A_Combinatorial_Proofs
    To give a combinatorial proof for a binomial identity, say A=B you do the following: (1) Find a counting problem you will be able to answer in two ways. (2) Explain why one answer to the counting pr...To give a combinatorial proof for a binomial identity, say A=B you do the following: (1) Find a counting problem you will be able to answer in two ways. (2) Explain why one answer to the counting problem is A. (3) Explain why the other answer to the counting problem is B. Since both A and B are the answers to the same question, we must have A=B. The tricky thing is coming up with the question.
  • https://math.libretexts.org/Courses/Palo_Alto_College/College_Algebra/06%3A_Sequences_Probability_and_Counting_Theory/6.06%3A_Binomial_Theorem
    A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consumi...A polynomial with two terms is called a binomial. We have already learned to multiply binomials and to raise binomials to powers, but raising a binomial to a high power can be tedious and time-consuming. In this section, we will discuss a shortcut that will allow us to find (x+y)n without multiplying the binomial by itself n times.
  • https://math.libretexts.org/Bookshelves/Combinatorics_and_Discrete_Mathematics/Discrete_Mathematics_(Levin)/1%3A_Counting/1.2%3A_Binomial_Coefficients
    Here are some apparently different discrete objects we can count: subsets, bit strings, lattice paths, and binomial coefficients. We will give an example of each type of counting problem (and say what...Here are some apparently different discrete objects we can count: subsets, bit strings, lattice paths, and binomial coefficients. We will give an example of each type of counting problem (and say what these things even are). As we will see, these counting problems are surprisingly similar.

Support Center

How can we help?