Tuesday, 26 February 2019

Proving that even numbers equal the sum of two odd numbers.

Define E to be the set of even integers; E = {x Z : x = 2k, where k Z}.



Define F to be the set of integers that can be expressed as the sum of two odd numbers.



Prove E = F.



My attempt: The only way I can figure out the solution is by providing numbers and examples. It's easy to see that two odd numbers will always equal an even integer. I just don't know how to write the proof for it.

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...