Lunchtime Scrambles

A Kindergarten class provides lunches for their students. The menu has 6 choices for a fruit, 5 choices for a sandwich, and 7 choices for a vegetable. Each student chooses one of each. If no two students have more than one item in common, what is the largest number of students that could be in the class?


The answer is 30.

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.

5 solutions

Michael Tang
Oct 27, 2013

We know that there are 5 × 6 = 30 5 \times 6 = 30 possible fruit-sandwich combinations. If we have at least 31 31 students in the class, two students must have both the same fruit & the same sandwich, which is a contradiction; thus, there can be at most 30 30 students.

It is also possible for there to be exactly 30 30 students, since in that case we could set up a one-to-one correspondence (a bijection ) between the students and the fruit-sandwich combinations, and so avoid having more than one item in common.

Therefore, 30 \boxed{30} is the largest number of students that could be in the class.

But how do you know that no students repeat fruit-vegetable combinations?

Daniel Chiu - 7 years, 7 months ago

Log in to reply

Ah, good point. Since there are 5 fruits and 7 vegetables, each of the 5 people with any given fruit can easily avoid repeating the same vegetable. The same holds with sandwich-vegetable.

Michael Tang - 7 years, 7 months ago

Log in to reply

I'm pretty sure that's right. I might need to actually find a construction to prove that 30 works however - in that case the solution is incomplete :(

Michael Tang - 7 years, 7 months ago

Log in to reply

@Michael Tang Well, it isn't all that hard. Just consider a 5x6 grid of numbers (which vegetable they get), and assign numbers such that numbers don't repeat in a row or column. This is easy enough, just list numbers:

1,2,3,4,5,6

7,1,2,3,4,5

6,7,1,2,3,4

5,6,7,1,2,3

4,5,6,7,1,2

Daniel Chiu - 7 years, 7 months ago

Log in to reply

@Daniel Chiu Great that you caught that.

If r s t r \leq s \leq t , and there are r r choices for sandwiches, s s choices for fruits and t t choices for vegetables, how many students can there be in the class?

Calvin Lin Staff - 7 years, 7 months ago

Log in to reply

@Calvin Lin r s rs

Daniel Chiu - 7 years, 7 months ago
Lucy Gow
Oct 30, 2013

No more than 6 students can have the same sandwich, because they each must get a different fruit. Therefore the number of students is no more than 6 × 5 = 30 6 \times 5 = 30 .

On the other hand, it's possible to have 30 students subject to the condition: for each of the five sandwich choices, we give out six; and then we give a different choice of fruit and a different choice of vegetable to each of the six students.

Therefore the largest number of students that could be in the class is 30.

Siao Chi Mok
Oct 28, 2013

Let's denote choices of fruit = {a, b, c, d, e, f}, choices of sandwich = {A, B, C, D, E}, and choices of vegetables = {1, 2, 3, 4, 5, 6, 7}. We should arrange the items so that no two students have more than one item in common. Hence, here's one of the possible ways to arrange. We arrange them in a sequence (a, A, 1), (a, B, 2), ..., (a, E, 5), (b, A, 6), ..., (b, E, 3), ..., (f, E, 2). It can be observed that the pair (A, 1) does not occur twice because the LCM of 5 and 7 is 35, and there are only 6 × \times 5 = 30 arrangements. Same goes to other pairs in the form (sandwich, vegetables). Thus, to fulfill the given condition, the largest possible number of arrangements of the items is 30 and so is the largest number of students.

The fact that 5 and 7 are coprime is not needed in the question, nor in your construction. Talking about LCM is irrelevant, and could make it confusing since it's not clear where this is needed.

Calvin Lin Staff - 7 years, 7 months ago

I know I'm a late solver and there's no hope for a vote at this stage. But yet I'd like to share a solution ( without solution, a problem looks odd :p ).

My solution would be easily digestive. I'm not naming a theory/principle.

Here, we can fix our gaze on sandwich first, as it has the lowest variety - chances of repeatation increases. Like: if a boy choses mutton sandwich, he can chose 1 1 out of those 6 6 vegetables. Another student chosing the same sandwich, cannot chose the then chosen vegetable. So, at most 6 6 student can chose mutton sandwich. Same case occurs for all 5 5 sandwiches.

Sum up: there's 5 × 6 = 30 5\times6=30 possible food package for individuals only. That sorts out the largest number of students there.

Adrian del Mundo
Oct 31, 2013

Start off with picking the food with the least amount of possible choices, which is the sandwich with 5.

For each set of food combinations where the sandwich is the one item in common, the fruits and vegetables have to all be different from each other. Since there are 6 choices for the fruit and 7 choices for the vegetable, the maximum amount of completely unique pairs is 6. It cannot be greater than 6 because there are only 6 unique choices for fruits.

To put it simply, imagine trying to make fruit-vegetable pairs using 6 fruits and 7 vegetables. You'll end up with 6 fruit-vegetable pairs, with 1 vegetable not being used.

So the answer is 5*6=30 (5 sandwich choices and 6 completely unique fruit-vegetable pairs)

As for the fruits and vegetables both repeating when the sandwiches are different, there are 6*7=42 ways to uniquely pair up the fruits and vegetables without having both the fruits and vegetables repeat, so there's no need to change anything because of that.

The above paragraph was a lucky stroke (haha)

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...