In the student cafeteria, there are 2 types of bread, 3 kinds of stuffing and 5 types of spices. For the preparation of a sandwich, John uses 1 type of bread, 1 kind of stuffing and 2 different types of spices. If John eats 7 sandwiches per week, how many weeks will it take such that John must eat a sandwich which he has already eaten?
This problem is posed by Welson G .
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.
Strictly speaking, the whole weeks passed during the 61th day are 8, not 9....
Since John has two types of spices, we have: 2 ⋅ 3 ⋅ ( 2 5 ) = 6 0 Then: ⌈ 7 6 0 ⌉ = 9
It's a big blunder......................................................
Log in to reply
I'm not quite sure what you mean is a 'blunder'; please expand.
John has ( 1 2 ) ⋅ ( 1 3 ) ⋅ ( 2 5 ) = 2 ⋅ 3 ⋅ 1 0 = 6 0 possible sandwich combinations, so we will take 9 weeks to go over 6 0 .
3 ingredients
For first, 2 possibilities
For second, 3 possibilities
For Last, 5c2 =10 possibilities
Total ways 2X3X10=60
Total weeks 60/7=8.57
But it has to be an integer, thus we take next integer to 8 i.e. 9
it should be 61/7 because he has to repeat the same sandwich the last day.however the answer is same.
@ @Pranav Vashistha Why is it 5x2=10? The questions says that he uses 2 different types of spices.
@Pranav Vashistha Why is it 5x2=10? The questions says that he uses 2 different types of spices.
Log in to reply
It isnt 5x2....it is 5C2...that is out of 5 spices,select any 2, which is 10...Hopefully now it is clear : )
Number of Combinations of sandwiches: $$2\times 3 \times \frac{5\times 4}{2!} = 60$$ Divide by 7 and find the smallest integer greater than the result: $$\left\lceil \frac{60}{7}\right\rceil = 9$$
If you use the floor function. 60/7 is 8
sorry i meant the ceiling function, :-/
Log in to reply
I've made the edit. Great job with using Latex, though remember to check that your Latex is properly typeset.
@Yan Yau Cheng , do u like harry potter? i saw your problem "quick before the girls come in". it was hillarious!
We have 2 types of bread, 3 kinds of stuffing and 5 types of spices.
From which for making one sandwich, we can choose 1 type of bread in 2 ways , 1 kind of stuffing in 3 ways, 2 types of spices in 5C2 ways i.e., 10 ways.
Therefore, total different breads can be = 2 * 3 * 10 = 60, means all distinct breads can be eaten in 8 weeks and 4 days i.e., John is going to eat the repeated bread in 9th week. (Ans)
Multiply the number of choices of bread by the number of choices of stuffing and the number of choices of spices. The total choices of spices possible is given by ( 2 5 ) = 10.
2 × 3 × 1 0 = 6 0
Forgot to say that 7 6 0 is between 8 and 9, and therefore John runs out of new sandwiches to eat in week 9
Log in to reply
It is important to state the numerical answer clearly. Thanks for adding that in.
let the two breads be b1 and b2, three stuffings be s1, s2, s3 and spices be p1 ,p2,p3,p4,p5one bread can be selected in 2c1 ways stuffing can be selected in 3c1 ways spices can be selected in 5c2 ways. total possible ways are 2c1.3c1.5c2 = 60 hence same sandwhich will repeat after 9 monts(7*9=63)
This incomplete answer was just a test to see if I could publish an answer please ignore it.
Problem Loading...
Note Loading...
Set Loading...
The total number of different sandwiches equals ( 1 2 ) ⋅ ( 1 3 ) ⋅ ( 2 5 ) = 2 ⋅ 3 ⋅ 1 0 = 6 0
Assuming that John always eats a different sandwich until he runs out of options, he will eat 7 sandwiches a week.
Dividing 6 0 by 7 gives 8 7 4 .
Thus, it will be during week 9 that John eats a sandwich that he has already eaten, since he has enough different sandwiches for 8 weeks, but not enough for 9 .