BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

OG 12 PS 23

Expert replies
by okletsdothis » Fri Sep 03, 2010 6:30 am
If n is a prime number greater than 3, what is the
remainder when n2(n square) is divided by 12 ?

(A) 0
(B) 1
(C) 2
(D) 3
(E) 5


Ans is B

Can someone explain this to me in simpler language ?
Join the discussion
Source: — Problem Solving |

by Gurpinder » Fri Sep 03, 2010 6:44 am
okletsdothis wrote:If n is a prime number greater than 3, what is the
remainder when n2(n square) is divided by 12 ?

(A) 0
(B) 1
(C) 2
(D) 3
(E) 5


Ans is B

Can someone explain this to me in simpler language ?
N is a prime greater than 3. So N = 5. N^2 = 25. 25/12 = 24 with a remainder 1. So (B)
"Do not confuse motion and progress. A rocking horse keeps moving but does not make any progress."
- Alfred A. Montapert, Philosopher.
Join the discussion

by okletsdothis » Fri Sep 03, 2010 6:50 am
YOu have considered only 1 prime number greater than 3. cant be true for all prime numbers ?
Join the discussion

by Gurpinder » Fri Sep 03, 2010 6:57 am
okletsdothis wrote:YOu have considered only 1 prime number greater than 3. cant be true for all prime numbers ?
Good thinking! but this is not a data sufficiency problem. If we start considering other prime numbers, the list will go on for ever...
"Do not confuse motion and progress. A rocking horse keeps moving but does not make any progress."
- Alfred A. Montapert, Philosopher.
Join the discussion

by debmalya_dutta » Fri Sep 03, 2010 7:10 am
okletsdothis wrote:YOu have considered only 1 prime number greater than 3. cant be true for all prime numbers ?
You can try it out for any number of prime numbers
@Deb
Join the discussion

by zino0067 » Fri Sep 03, 2010 8:04 am
okletsdothis wrote:If n is a prime number greater than 3, what is the
remainder when n2(n square) is divided by 12 ?

(A) 0
(B) 1
(C) 2
(D) 3
(E) 5


Ans is B

Can someone explain this to me in simpler language ?
n^2-1 (mod 12)≡(n+1)(n-1) (mod 12)
Now n is odd number.
n^2-1 (mod 12)≡0
n^2 (mod 12)≡1

Therefore Ans is B.
Join the discussion

by GMATGuruNY » Fri Sep 03, 2010 12:07 pm
okletsdothis wrote:YOu have considered only 1 prime number greater than 3. cant be true for all prime numbers ?
If different prime numbers could yield different remainders, there would be no correct answer choice.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion