- #1

mr_coffee

- 1,629

- 1

I'm having some troubles seeing how I would apply the even case for this problem.

The problem is:

If n + 1 integers are chosen from the set {1,2,3,...,2n} where n is a postive integer, must at least one of them be even? why?

Well the book did the exact same problem but instead of even they said must at least one of them be odd? why?

Well there explanation was the following:

Yes. There are n even integers in the set {1,2,3,...,2n}, namely 2(=2x1), 4(=2x2), 6(=2x3),...,2n(2xn). So the maximum number of even integers that can be chosen is n. Thus if n + 1 integers are chosen, at least one of them must be odd.

If I apply the same concept to my problem, don;t' they answer my question in explaning that at least one of them must be odd?

Yes. There are n even integers in the set {1,2,3,...,2n}, namely 2(=2x1), 4(=2x2), 6(=2x3),...,2n(2xn). So the maximum number of even integers that can be chosen is n. Thus if n+1 integers are chosen, at least one must be even.

Or do I have to work in reverse and say:

yes. There are 2n+1 odd integers in the set {1,2,3...,2n},

namely 1(=2(0)+1),

3(=2(1)+1),

5(=2(2)+1),...

but when it comes to 2n, i can't express that as odd can i?

or do i just say, 2n+1?

So the maximum number of odd integers that can be chosen is 2n+1. Thus if n+1 integers are chosen, at least one must be even.