This is probably a silly question, but, for integers...
$even$ x $even$ = $even$
$even$ x $odd$ = $even$
$odd$ x $even$ = $even$
$odd$ x $odd$ = $odd$
There are 3 times as many combinations that form even numbers than odd numbers, so why aren't there more odd numbers than even ones?
I know the truth can be seen by examining an integer number line, but I want to know why the above argument fails.

We can make this even more "surprising"
Every positive integer $N$ can be uniquely written as $$N=2^n\cdot m$$ with non-negative integer $n$ and odd $m$. Only if $n=0$, $N$ is odd, so "almost all" numbers should be even.
What is the catch ?
If we get to a fixed limit (instead of considering all positive integers), we will se that the upper bound for $m$ gets smaller with increasng $n$, so the number of even numbers is not larger (at least if the limit is even, otherwise we have one more odd number).
For infinite sets this leads to counterintuitive facts as "there are as many posite integers than numbers of the form $2^n$" with positive integer $n$" although very few positive integers are a power of $2$.
The even numbers are a proper subset of the positive integers, so in some sense there are "as many positive integers as even numbers". We only get to the correct fraction $\frac{1}{2}$, if we consider finite cases and increase the limit.
"Hilbert's hotel" might be a good introduction to get a feeling for this stuff.