If k > 2, and n = 2k-3, show that 3n is not congruent to 1 (mod 2k).
Old thread but if you're still interested: there are several ways to do this.
1) By induction for assume
2) A rather nice way is to consider
therefore the highest power of 2 dividing is 2
It follows that is the highest power of 2 dividing , so cannot divide