Because evenness is a special case of k-evenness: A set is k-even if it can be divided into equal sets of size k. Which, for finite sets, is equivalent to the size of the set being 0 mod k, ie, is divisible by k. There are many ways to be not be divisible by any particular number bigger than two, and only one way to be divisible.

Uncountability is a particularly interesting form of non-divisibility, so I'm just fine calling all uncountable sets odd and countable sets even...

(And just because we're hung up on divisibility by two, let us remember: All prime numbers are odd, and two is the oddest of them all.)

I think the reals are also even: If x is rational pair it as you would in the rational case (which we assume is even - I haven't proven this). Otherwise pair it to -x, and thus the reals are even.

Being "even" seems like a much more interesting (and simpler) property of a set. I don't see what use there could be to know that you could pair things off, with one element left over. When you extend the notion you do have to decide what to preserve, but to me parity is much more about divisibility and symmetry than it is about reminader. I agree that it's arbitrary, though less arbitrary than the odd definition.

If you can pair but not count, the reals would be odd I think, as long as zero is unsigned. Zero would make it odd.