From charlesreid1

(Created page with "{{FMM |title=A Binomial Problem |problem= <math> \binom{16}{4} = \binom{16}{2r+1} </math> Find r. |answer= First, if we solve it naively, we get r = 2r + 1 -r = 1 r = -...")
 
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 4: Line 4:


<math>
<math>
\binom{16}{4} = \binom{16}{2r+1}
\binom{16}{r} = \binom{16}{2r+1}
</math>
</math>


Find r.
Find r.


|answer=
Challenge problem:
 
<math>
\binom{120}{r} = \binom{120}{3r+4}
</math>
 
Find r.
 
|solution=


First, if we solve it naively, we get
First, if we solve it naively, we get
Line 31: Line 39:
r = 5
r = 5


What more do we need to do? We can use this identity to transform r = 2r + 1, but there may also exist other integers 0 <= r < l <= n such that <math>\binom{n}{r} = \binom{n}{l}</math>
What more do we need to do? We can use this identity to transform r = 2r + 1, but there may also exist other integers 0 <= r < s <= n such that <math>\binom{n}{r} = \binom{n}{s}</math>
 
We can prove that <math>\binom{n}{r} = \binom{n}{s}</math> only holds if r = s or r = n - s
 
This is something we may implicitly assume, due to our own understanding of the nature of the binomial numbers and Pascal's Triangle. But to be rigorous we have to cover all our bases.
 
Challenge problem:
 
Solving naively we get
 
r = 3r + 4
 
-4r = 4
 
r = -1
 
To transform, use the same identity as above
 
3r + 4 = r
 
3r + 4 = 120 - r


We can prove that <math>\binom{n}{r} = \binom{n}{l}</math> only holds if r = l or r = n - l
4r = 120 - 4


This is something we may implicitly assume, due to our own understanding of the nature of the binomial numbers and Pascal's Triangle. We just have to cover all our bases.
r = (120 - 4)/4 = 29


}}
}}

Latest revision as of 18:19, 17 January 2020

Friday Morning Math Problem

A Binomial Problem

$ \binom{16}{r} = \binom{16}{2r+1} $

Find r.

Challenge problem:

$ \binom{120}{r} = \binom{120}{3r+4} $

Find r.

Solution
First, if we solve it naively, we get

r = 2r + 1

-r = 1

r = -1

We use the fact that $ \binom{n}{m} = \binom{n}{n-m} $

2r + 1 =16 - (2r+1)

r = 16 - (2r+1)

r = 16 - 2r - 1

3r = 15

r = 5

What more do we need to do? We can use this identity to transform r = 2r + 1, but there may also exist other integers 0 <= r < s <= n such that $ \binom{n}{r} = \binom{n}{s} $

We can prove that $ \binom{n}{r} = \binom{n}{s} $ only holds if r = s or r = n - s

This is something we may implicitly assume, due to our own understanding of the nature of the binomial numbers and Pascal's Triangle. But to be rigorous we have to cover all our bases.

Challenge problem:

Solving naively we get

r = 3r + 4

-4r = 4

r = -1

To transform, use the same identity as above

3r + 4 = r

3r + 4 = 120 - r

4r = 120 - 4

r = (120 - 4)/4 = 29

Flags