Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 26 Jun 2016, 05:49

GMAT Club Daily Prep

Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

If n is a prime number greater than 3, what is the remainder

Author Message
TAGS:

Hide Tags

Intern
Joined: 10 Aug 2011
Posts: 1
Followers: 0

Kudos [?]: 3 [2] , given: 0

If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

28 Oct 2011, 05:13
2
KUDOS
1
This post was
BOOKMARKED
00:00

Difficulty:

5% (low)

Question Stats:

94% (01:28) correct 6% (00:26) wrong based on 562 sessions

HideShow timer Statistics

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

it's a simple quesiton, but the solutuion is inspiring.

[Reveal] Spoiler: Solution
n^2-1=(n-1)(n+1)
since (n-1) and (n+1) are consecutive even numbers,one of them can be divided by 2, another one can be divided by 4;
and because n can not be divided by 3, so one of (n-1) and (n+1) can be divided by 3.
So (n-1)(n+1)=n^2-1 is divisible by 24, then the remainder of n^2 divided by 24 is 1.
[Reveal] Spoiler: OA

Last edited by Bunuel on 24 Apr 2012, 12:46, edited 2 times in total.
Edited the question
Math Forum Moderator
Joined: 20 Dec 2010
Posts: 2022
Followers: 155

Kudos [?]: 1482 [1] , given: 376

Re: A question with inspiring solution [#permalink]

Show Tags

28 Oct 2011, 06:25
1
KUDOS
chonepiece wrote:
If n is a prime number greater than 3, what is the remainder when n is divided by 12?
0
1
2
3
5

This question is wrong. Please correct it.

what is the remainder when n is divided by 12
should be
what is the remainder when n^2 is divided by 12
_________________
Math Expert
Joined: 02 Sep 2009
Posts: 33504
Followers: 5931

Kudos [?]: 73496 [1] , given: 9902

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

09 Feb 2012, 14:57
1
KUDOS
Expert's post
1
This post was
BOOKMARKED
chonepiece 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

it's a simple quesiton, but the solutuion is inspiring.

[Reveal] Spoiler: Solution
n^2-1=(n-1)(n+1)
since (n-1) and (n+1) are consecutive even numbers,one of them can be divided by 2, another one can be divided by 4;
and because n can not be divided by 3, so one of (n-1) and (n+1) can be divided by 3.
So (n-1)(n+1)=n^2-1 is divisible by 24, then the remainder of n^2 divided by 24 is 1.

There are several algebraic ways to solve this question including the one under the spoiler. But the easiest way is as follows: since we cannot have two correct answers just pick a prime greater than 3, square it and see what would be the remainder upon division of it by 12.

n=5 --> n^2=25 --> remainder upon division 25 by 12 is 1.

_________________
Veritas Prep GMAT Instructor
Joined: 16 Oct 2010
Posts: 6667
Location: Pune, India
Followers: 1827

Kudos [?]: 11106 [1] , given: 218

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

10 Feb 2012, 02:33
1
KUDOS
Expert's post
2
This post was
BOOKMARKED
chonepiece 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

it's a simple quesiton, but the solutuion is inspiring.

[Reveal] Spoiler: Solution
n^2-1=(n-1)(n+1)
since (n-1) and (n+1) are consecutive even numbers,one of them can be divided by 2, another one can be divided by 4;
and because n can not be divided by 3, so one of (n-1) and (n+1) can be divided by 3.
So (n-1)(n+1)=n^2-1 is divisible by 24, then the remainder of n^2 divided by 24 is 1.

Check out these posts for more on divisibility of consecutive integers:
http://www.veritasprep.com/blog/2011/09 ... c-or-math/
http://www.veritasprep.com/blog/2011/09 ... h-part-ii/

and of course, the most efficient solution would be what Bunuel suggested - Pick a prime number > 3 and check for it!
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199 Veritas Prep Reviews Senior Manager Joined: 23 Mar 2011 Posts: 473 Location: India GPA: 2.5 WE: Operations (Hospitality and Tourism) Followers: 19 Kudos [?]: 180 [1] , given: 59 Re: If n is a prime number greater than 3, what is the remainder [#permalink] Show Tags 10 Feb 2012, 02:47 1 This post received KUDOS all i did was pick numbers and try...got remainder as 1 always. so B. anything wrong in my approach pls advice _________________ "When the going gets tough, the tough gets going!" Bring ON SOME KUDOS MATES+++ ----------------------------- Quant Notes consolidated: consolodited-quant-guides-of-forum-most-helpful-in-preps-151067.html#p1217652 My GMAT journey begins: my-gmat-journey-begins-122251.html All about Richard Ivey: all-about-richard-ivey-148594.html#p1190518 Veritas Prep GMAT Instructor Joined: 16 Oct 2010 Posts: 6667 Location: Pune, India Followers: 1827 Kudos [?]: 11106 [1] , given: 218 Re: If n is a prime number greater than 3, what is the remainder [#permalink] Show Tags 10 Feb 2012, 02:54 1 This post received KUDOS Expert's post sdas wrote: all i did was pick numbers and try...got remainder as 1 always. so B. anything wrong in my approach pls advice No. Nothing wrong. Just that you don't need to try many numbers. There will only be one answer to a PS question. So all you need to do is try any one number greater than 3. Whatever you get, that will be the answer in every case. _________________ Karishma Veritas Prep | GMAT Instructor My Blog Get started with Veritas Prep GMAT On Demand for$199

Veritas Prep Reviews

Senior Manager
Joined: 23 Mar 2011
Posts: 473
Location: India
GPA: 2.5
WE: Operations (Hospitality and Tourism)
Followers: 19

Kudos [?]: 180 [0], given: 59

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

10 Feb 2012, 03:41
cool karishma. i only tried 5^2 and 7^2 both i got 1 as remainders
_________________

"When the going gets tough, the tough gets going!"

Bring ON SOME KUDOS MATES+++

-----------------------------

My GMAT journey begins: my-gmat-journey-begins-122251.html

Intern
Joined: 12 May 2011
Posts: 17
Location: london
Schools: cambridge, oxford
Followers: 0

Kudos [?]: 92 [0], given: 2

Show Tags

23 Apr 2012, 06:45
Hi

This is my first post, and am hoping someone can help me out with this question.

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

What I am looking for is advice on how to approach this problem, what are the math rules I can apply.

Many thanks
Manager
Joined: 26 Dec 2011
Posts: 117
Followers: 1

Kudos [?]: 27 [0], given: 17

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

24 Apr 2012, 10:36
I tried solving it may be a lengthier method .. prime number greater than 6 is 6k+1 or 6k-1.. thus squaring say 6k+1 will give.. 36k2 + 12K + 1.... remainder 1... to double check for 5... 25/12..remainder 1... thus B.
Intern
Joined: 05 Apr 2012
Posts: 42
Followers: 0

Kudos [?]: 23 [0], given: 12

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

07 May 2012, 17:02
Bunuel wrote:
chonepiece 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

it's a simple quesiton, but the solutuion is inspiring.

[Reveal] Spoiler: Solution
n^2-1=(n-1)(n+1)
since (n-1) and (n+1) are consecutive even numbers,one of them can be divided by 2, another one can be divided by 4;
and because n can not be divided by 3, so one of (n-1) and (n+1) can be divided by 3.
So (n-1)(n+1)=n^2-1 is divisible by 24, then the remainder of n^2 divided by 24 is 1.

There are several algebraic ways to solve this question including the one under the spoiler. But the easiest way is as follows: since we can not have two correct answers just pick a prime greater than 3, square it and see what would be the remainder upon division of it by 12.

n=5 --> n^2=25 --> remainder upon division 25 by 12 is 1.

Hello
if n is a prime number bigger than 3 it can also be 7 right ?
Hence 7 ^2 =49/12 Is not equal to 1
can I pick 7 or ?

thanks

best regards
Math Expert
Joined: 02 Sep 2009
Posts: 33504
Followers: 5931

Kudos [?]: 73496 [0], given: 9902

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

08 May 2012, 01:18
Expert's post
keiraria wrote:
Bunuel wrote:
chonepiece 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

it's a simple quesiton, but the solutuion is inspiring.

[Reveal] Spoiler: Solution
n^2-1=(n-1)(n+1)
since (n-1) and (n+1) are consecutive even numbers,one of them can be divided by 2, another one can be divided by 4;
and because n can not be divided by 3, so one of (n-1) and (n+1) can be divided by 3.
So (n-1)(n+1)=n^2-1 is divisible by 24, then the remainder of n^2 divided by 24 is 1.

There are several algebraic ways to solve this question including the one under the spoiler. But the easiest way is as follows: since we can not have two correct answers just pick a prime greater than 3, square it and see what would be the remainder upon division of it by 12.

n=5 --> n^2=25 --> remainder upon division 25 by 12 is 1.

Hello
if n is a prime number bigger than 3 it can also be 7 right ?
Hence 7 ^2 =49/12 Is not equal to 1
can I pick 7 or ?

thanks

best regards

As explained. you can pick ANY prime greater than 3.

Also, 49 divided by 12 yields the remainder of 1: 49=4*12+1.

Hope it's clear.
_________________
Director
Status: Gonna rock this time!!!
Joined: 22 Jul 2012
Posts: 547
Location: India
GMAT 1: 640 Q43 V34
GMAT 2: 630 Q47 V29
WE: Information Technology (Computer Software)
Followers: 3

Kudos [?]: 50 [0], given: 562

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

01 Nov 2012, 03:13
VeritasPrepKarishma wrote:
sdas wrote:
all i did was pick numbers and try...got remainder as 1 always. so B. anything wrong in my approach pls advice

No. Nothing wrong. Just that you don't need to try many numbers. There will only be one answer to a PS question. So all you need to do is try any one number greater than 3. Whatever you get, that will be the answer in every case.

I wonder why every prime no greater than 3 when squared and divided by 4 results in the remainder of 1
_________________

hope is a good thing, maybe the best of things. And no good thing ever dies.

Who says you need a 700 ?Check this out : http://gmatclub.com/forum/who-says-you-need-a-149706.html#p1201595

My GMAT Journey : end-of-my-gmat-journey-149328.html#p1197992

Math Expert
Joined: 02 Sep 2009
Posts: 33504
Followers: 5931

Kudos [?]: 73496 [1] , given: 9902

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

01 Nov 2012, 05:54
1
KUDOS
Expert's post
sachindia wrote:
VeritasPrepKarishma wrote:
sdas wrote:
all i did was pick numbers and try...got remainder as 1 always. so B. anything wrong in my approach pls advice

No. Nothing wrong. Just that you don't need to try many numbers. There will only be one answer to a PS question. So all you need to do is try any one number greater than 3. Whatever you get, that will be the answer in every case.

I wonder why every prime no greater than 3 when squared and divided by 4 results in the remainder of 1

Any prime number $$p$$ greater than 3 could be expressed as $$p=6n+1$$ or $$p=6n+5$$ ($$p=6n-1$$), where $$n$$ is an integer >1.

That's because any prime number $$p$$ greater than 3 when divided by 6 can only give remainder of 1 or 5 (remainder can not be 2 or 4 as in this case $$p$$ would be even and remainder can not be 3 as in this case $$p$$ would be divisible by 3).

But:
Note that, not all number which yield a remainder of 1 or 5 upon division by 6 are primes, so vise-versa of above property is not correct. For example 25 (for $$n=4$$) yields a remainder of 1 upon division by 6 and it's not a prime number.

Now, if a prime is of the form $$p=6n+1$$, then $$p^2=36n^2+12n+1=12(3n^2+n)+1$$ and if a prime is of the form $$p=6n-1$$, then $$p^2=36n^2-12n+1=12(3n^2-n)+1$$. Both yield the remainder of 1 when divided by 12.

Hope it's clear.
_________________
Director
Status: Gonna rock this time!!!
Joined: 22 Jul 2012
Posts: 547
Location: India
GMAT 1: 640 Q43 V34
GMAT 2: 630 Q47 V29
WE: Information Technology (Computer Software)
Followers: 3

Kudos [?]: 50 [0], given: 562

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

02 Nov 2012, 01:11
Do we really need to know this concept for GMAT
I find this going slighty above my head. .
_________________

hope is a good thing, maybe the best of things. And no good thing ever dies.

Who says you need a 700 ?Check this out : http://gmatclub.com/forum/who-says-you-need-a-149706.html#p1201595

My GMAT Journey : end-of-my-gmat-journey-149328.html#p1197992

Math Expert
Joined: 02 Sep 2009
Posts: 33504
Followers: 5931

Kudos [?]: 73496 [0], given: 9902

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

02 Nov 2012, 02:14
Expert's post
Sachin9 wrote:
Do we really need to know this concept for GMAT
I find this going slighty above my head. .

Useful property, good to know.
_________________
Intern
Joined: 31 Aug 2013
Posts: 15
Followers: 0

Kudos [?]: 2 [0], given: 1

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

17 Nov 2013, 13:39
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

whenever any square of prime number>2 is divisible by 12 the remainder is always 1.
Check through options:

here in case n = 5,7,11 and so on.

5^2 = 25 when its divisible by 12,the remainder is 1.
7^2 = 49 when its divisible by 12, still the remainder is 1.
11^2 = 121 when its divisible by 12,the remaider is 1.

So answer of this question is (b).
Senior Manager
Joined: 28 Apr 2014
Posts: 291
Followers: 1

Kudos [?]: 30 [0], given: 46

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

01 May 2014, 03:13
pavanpuneet wrote:
I tried solving it may be a lengthier method .. prime number greater than 6 is 6k+1 or 6k-1.. thus squaring say 6k+1 will give.. 36k2 + 12K + 1.... remainder 1... to double check for 5... 25/12..remainder 1... thus B.

Too much of an overkill. As Bunuel suggested , here the best approach would be to put values and get the response.
Verbal Forum Moderator
Joined: 15 Apr 2013
Posts: 194
Location: India
Concentration: General Management, Marketing
GMAT Date: 11-23-2015
GPA: 3.6
WE: Science (Other)
Followers: 14

Kudos [?]: 339 [0], given: 28

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

13 Feb 2015, 21:17
Hello,

In OG explanation it is mentioned that

Consider n2/12 as each n divided by 6 ????

Well I don't think that's correct. It should be read as n2 divided by 6 X 2... Please classify...

Thanks

Posted from my mobile device
Math Expert
Joined: 02 Sep 2009
Posts: 33504
Followers: 5931

Kudos [?]: 73496 [0], given: 9902

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

16 Feb 2015, 03:41
Expert's post
vikasbansal227 wrote:
Hello,

In OG explanation it is mentioned that

Consider n2/12 as each n divided by 6 ????

Well I don't think that's correct. It should be read as n2 divided by 6 X 2... Please classify...

Thanks

Posted from my mobile device

Below is a solution from OG:

The simplest way to solve this problem is to choose a prime number greater than 3 and divide its square by 12 to see what the remainder is. For example, if n= 5, then n^2 =25, and the remainder is 1 when 25 is divided by 12. A second prime number can be used to check the result. For example, if n = 7, then n^2 =49, and the remainder is 1 when 49 is divided by 12. Because only one of the answer choices can be correct, the remainder must be 1.

For the more mathematically inclined, consider the remainder when each prime number n greater than 3 is divided by 6. The remainder cannot be 0 because that would imply that n is divisible by 6, which is impossible since n is a prime number. The remainder cannot be 2 or 4 because that would imply that n is even, which is impossible since n is a prime number greater than 3. The remainder cannot be 3 because that would imply that n is divisible by 3, which is impossible since n is a prime number greater than 3. Therefore, the only possible remainders when a prime number n greater than 3 is divided by 6 are 1 and 5. Thus, n has the form 6q + 1 or 6q + 5, where q is an integer, and, therefore, n^2 has the form 36q^2 +12q +1 =12(3q^2 +q) +1 or 36q^2+60q +25 =12(3q^2+5q +2)+ 1. In either case, n^2 has a remainder of 1 when divided by 12.

Can you please tell me which part there is not clear? Thank you.
_________________
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 10192
Followers: 481

Kudos [?]: 124 [0], given: 0

Re: If n is a prime number greater than 3, what is the remainder [#permalink]

Show Tags

17 Feb 2016, 12:17
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Re: If n is a prime number greater than 3, what is the remainder   [#permalink] 17 Feb 2016, 12:17

Go to page    1   2    Next  [ 22 posts ]

Similar topics Replies Last post
Similar
Topics:
1 If P is a prime number greater than 3, find the remainder when p^2 + 1 2 10 Jun 2016, 20:44
2 If n=3*4*p where p is a prime number greater than 3,how many different 2 08 Jun 2016, 23:58
28 If n is a prime number greater than 3, what is the remainder 20 26 Aug 2012, 02:56
14 The sum of prime numbers that are greater than 60 but less 8 23 Jul 2012, 04:39
23 If n = 4p, where p is a prime number greater than 2, how man 9 24 Aug 2007, 09:41
Display posts from previous: Sort by