i don't think that does the job

use the fact that for consecutive integers, one has to be even and one odd. so without loss of generality, assume the first integer is even. then the integers are given by 2n and 2n + 1 for some integer n. clearly 2n(2n + 1) = 2(2n^2 + n) is even. this completes the proof