Let n be a positive integer and let k be the number of positve integers less than 2^n.If 2^n is congruent to \(9\) (mod 13), then what is the remainder when k is divided by 13?
The remainder is 3.