Question

I've got a little discrete math question on functions, could use some help, I'm fairly lost.

Answer 1

Probably have to explain in terms of bijective, injective and onto

Answer 2

But i'm thinking it has to do with the pigeonhole principle

Answer 3

You're on the right track with pigenhole principle.

The pigeonhole principle states the following;
If m objects are placed into n bins, where m > n, then some bin contains at least two objects. In this case, the objects are math students, the bins are various likes and dislikes. What you can conclude: Given a large enough number of objects
with a bounded number of properties, eventually at least two of them will share a property.

Answer 4

Oh okay thanks, that makes sense