Show that if $k$ is an odd integer grater than $1$, then $\log_2(k)$ is an irrational number.
So my approach for this problem was to use proof by contradiction so I wrote "Assume by contradiction if $k$ is an odd integer greater than $1$ than $\log_2(k)$ will be a rational number. Such that $\log_2(k)=a/b$, $\gcd(a,b) = 1$ and $a,b$ are integers in its lowest terms. But I don't know what to do after. Should I use the fundamental theorem of arithmetic? Euclid's lemma?
$2^{(a/b)} = k \implies 2^a = k^b.$
But $2^a$ is even and $k^b$ is odd.