True or False?
1 4 C 4 + 1 4 C 5 = 1 4 C 6
Notation: m C n = n ! ( m − n ) ! m ! .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
By the given notation 1 4 C 4 + 1 4 C 5 4 ! ( 1 4 − 4 ) ! 1 4 ! + 5 ! ( 1 4 − 5 ) ! 1 4 ! 4 ! 1 0 ! 1 4 ! + 5 ! 9 ! 1 4 ! = 1 4 C 6 = 6 ! ( 1 4 − 6 ) ! 1 4 ! = 6 ! 8 ! 1 4 ! Dividing both sides by 1 4 ! gives 4 ! 1 0 ! 1 + 5 ! 9 ! 1 = 6 ! 8 ! 1 Thus, by multiplying both sides by 6 ! 1 0 ! , 4 ! 1 0 ! 1 ⋅ 6 ! 1 0 ! + 5 ! 9 ! 1 ⋅ 6 ! 1 0 ! 4 ! 6 ! + 5 ! 9 ! 6 ! 1 0 ! 4 ! 6 ⋅ 5 ⋅ 4 ! + 5 ! 9 ! ( 6 ⋅ 5 ! ) ( 1 0 ⋅ 9 ! ) 3 0 + 6 0 = 6 ! 8 ! 1 ⋅ 6 ! 1 0 ! = 8 ! 1 0 ! = 8 ! 1 0 ⋅ 9 ⋅ 8 ! = 9 0 which gives True .
Nice!
Bonus: 1 4 C 4 , 1 4 C 5 , 1 4 C 6 follows an arithmetic progression. So we know that there exists integers ( p , q ) such that p C q , p C q + 1 , p C q + 2 follows an arithmetic progression.
Show that if p C q , p C q + 1 , … , p C q + n follows an arithmetic progression (in that order), where p , q , n are all positive integers with q + n ≤ p , then the maximum value of n is 2,
Problem Loading...
Note Loading...
Set Loading...
By Pascal's identity, we have:
n − 1 C k − 1 + n − 1 C k ⟹ 1 4 C 4 + 1 4 C 5 = n C k = 1 5 C 5 = 5 ! 1 0 ! 1 5 ! = 9 ⋅ 1 0 ⋅ 6 ! 8 ! 6 ⋅ 1 5 ⋅ 1 4 ! = 6 ! 8 ! 1 4 ! = 1 4 C 6