Homework Statement
Suppose that m divisions are required to find gcd(a,b). Prove by induction that for m >= 1, a >= F(m+2) and b>= F(m+1) where F(n) is the Fibonacci sequence.
Hint: to find gcd(a,b), after the first division the algorithm computes gcd(b,r).
Homework Equations
Fibonacci...
Makes sense. Thanks for the recommendation. So we just treat the group of four, three, two chairs as a single "SLOT" so to say, that we insert?
So here's the plan:
8 women need 15 seats. This will be the basis for every other calculation.
I then break up the remaining chairs into three cases...
So I consider find the all possible combinations for the type of cheese being sold. If I have more than one order being replicated, that is equal to the same restocking order.
So I try to find the combinations for the different types of cheese sold? OK. I follow that logic.
So it will be...
Homework Statement
In how many different ways can you seat 11 men and 8 women in a row if no two women are to sit together?
Homework Equations
I have the combination and permutation equations
The Attempt at a Solution
I assume that given the context of this question if I have two, three...
I am getting extremely confused. A sale could involve more than one types of cheese, but they ask me for how many restocking orders are possible.
If I sell Blue Cheese and Brie, then I have a different restocking order than if I sell Cheddar and Gouda, even though they all have the same number...
Hi and thanks for your comment. Let's see what I can make here. So according to you we count the various possibilities for selling 34 types of cheese. That is a typical 'stars and bars problem' which I can do. However, the problem has 48 different orders.
Would that mean that I have 48 orders...
Hi, Thanks for replying.
I would disagree with you that each one of the cheese types must have been sold. It is possible, but it is also possible to have all of the 48 orders to be for one type of Feta Cheese, for example - as far as I see according to the wording of the problem.
If so, I do...