A nice fast approach is to TEST a possible value of n. Since n must be a prime number that's greater than 3, let's TEST n = 5boomgoesthegmat wrote:If n is a prime number greater than 3, what is the remainder when n^2 is divided by 12?
A) 0
B) 1
C) 2
D) 3
E) 5
OA: B
We can solve this problem by testing values easily.boomgoesthegmat wrote:If n is a prime number greater than 3, what is the remainder when n^2 is divided by 12?
A) 0
B) 1
C) 2
D) 3
E) 5
OA: B
We can let n = 5. Thus n^2 = 25 and 25/12 = 2 R 1.boomgoesthegmat wrote:If n is a prime number greater than 3, what is the remainder when n^2 is divided by 12?
A) 0
B) 1
C) 2
D) 3
E) 5
