Help please!

Question 1161 Consider the following theorem: [A number m is a perfect square, if m = k, for some integer k.] Every odd positive integer can be written as the difference of two perfect squares. Translate this theorem into predicate logic. You may use predicates Odd(x) and Even(x) to indicate odd and even integers, a. b. Prove the theorem using a direct proof (that is, you must not use proof by contradiction, or any logical equivalences on the original theorem statement)