Pascals triangle problem(discrete mathematics)

stanleyman
Messages
2
Reaction score
0

Homework Statement


Determine which row of pascals triangle contains 3 consecutive entries that are in the ratio 1:2:3.

Homework Equations


(n, k ) = n!/k!(n-k)!


The Attempt at a Solution


(n,k):(n,k+1):(n,k+2)
1 : 2: : 3

What I did was cross multiply.

2 times (n,k) = 1 times (n,k+1) and 3 times (n,k+1) = 2 times (n,k+2)
2(n!/(k!(n-k)!) = n!/(k+1)!(n-k-1)! and 3(n!/(k+1)!(n-k-1)!) = 2(n!/(k+2)!(n-k-2)!

I know that i should solve for n in the first equation then substitute n in the second equation to get n and k. I'm stuck on the algebra part.
 
Physics news on Phys.org
Well, what are some of the rules of factorials?

n! = n*(n-1)*(n-2)*...*2*1

n! = n*(n-1)!

So if we have an equation such as

n! = 10*(n-1)!

then to solve this, we would use the rule n! = n*(n-1)! to obtain

n*(n-1)! = 10*(n-1)!

then you can divide through by (n-1)! and find n=10. See if you can apply this rule to solve your equation.
 
thank you i got the answer.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top