TestMagic

learner84 · 2009 August 6th, 04:27 PM

If n is the 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

Please do not use picking number methodology. I look for a better way to solve this problem more systematically. I'm not happy with the explanation from OG either.

clock60 · 2009 August 6th, 05:49 PM

any prime number greater than 2 or 3 can be perform as (6k+1) or (6k-1)
let it be n=(6k+1) when we square this we have (36k2+12k+1) i think that
remainder is 1 so as 36 and 12 are multiple of 12
what is answer?

2009 August 6th, 04:27 PM	#1 (permalink)
learner84 Eager! Join Date: Jul 2009 Posts: 36	Remainder problem - alternative explanation apart from OG If n is the 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 Please do not use picking number methodology. I look for a better way to solve this problem more systematically. I'm not happy with the explanation from OG either.

Thread Tools	Search this Thread
Show Printable Version Email this Page	Search this Thread: Advanced Search
Display Modes
Linear Mode Switch to Hybrid Mode Switch to Threaded Mode

2009 August 6th, 05:49 PM	#2 (permalink)
clock60 TestMagic Guru-in-Training Join Date: May 2009 Posts: 723	any prime number greater than 2 or 3 can be perform as (6k+1) or (6k-1) let it be n=(6k+1) when we square this we have (36k2+12k+1) i think that remainder is 1 so as 36 and 12 are multiple of 12 what is answer?

TestMagic

Free GMAT, GRE, SAT Test, TOEFL practice tests