I'm reading D'Angelo and West, first edition for recreation. In example 20, it states "If integers x and y are odd, then x+y is even." (I took this to mean, P(x,y both odd) -> Q (x+y is even.) Easy proof - no problem. The example continues with "The converse of this conditional is false." (I took this to mean Q(x,y both odd) does not imply P(x+y is even). The reason is that x+y could be even but x and y are not both odd. (For example, both x and y are even).
In the example that follows, it is stated that an integer is even if and only if it is the sum or two odd integers, that is, P->Q and Q->P. The sum of two odd integers is always even - got that. But why is the other statement, an integer is even if it is the of two odd integers. That is true for every integer (2k = 2k-1 +1 shows that) but it's not always true in every case is it? For example the sum of two even integers is even 2k = 2p + 2q = 2(p+q).
What am I missing?