(Predicate Logic) ∀x ∈ N(x > 1 → ∃k ∈ N∃m ∈ N(m ≡ 1(mod 2) ∧ x = 2^k⋅m))

Question

Can anyone show me how to prove this statement? I'm very confused. I have tried substitute numbers into each x, k and m, it seems this statement is true but it needs to be proved by mathematical methods.

Thank you!