+0  
 
0
146
1
avatar

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?

 Jan 9, 2022
 #1
avatar
0

The remainder is 3.

 Jan 9, 2022

15 Online Users

avatar