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

It is currently 23 May 2013, 19:39
Customize  |  Hide

Prime Number Test - Proof please?

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
Manager
Manager
Joined: 22 Feb 2012
Posts: 93
Schools: HBS '16
GMAT 1: 740 Q49 V42
GMAT 2: 670 Q42 V40
GPA: 3.47
WE: Corporate Finance (Aerospace and Defense)
Followers: 2

Kudos [?]: 14 [0], given: 25

GMAT ToolKit User GMAT Tests User
Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 09:46
Found this in a Advanced GMAT Quant book....


Havent seen this anywhere else and would be interested in the proof for it if anyone can supply...

For all Prime numbers, p > 5

p^2 -1 is divisible by 24
Kaplan GMAT Prep Discount CodesKnewton GMAT Discount CodesManhattan GMAT Discount Codes
1 KUDOS received
Current Student
User avatar
Joined: 12 Sep 2011
Posts: 901
Concentration: Finance, Finance
GMAT 1: 710 Q48 V40
Followers: 93

Kudos [?]: 467 [1] , given: 114

GMAT Tests User
Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 10:28
1
This post received
KUDOS
I have also never seen this formula before, but as we all know, prime numbers have some very creative tricks and rules associated with them. Since the number resulting from this formula will always be a factor of 24 then that means that the answer to (P^2)-1 will always have 3 factors of 2 and 1 factor of 3 (aka 3 * 2^3).

Prime numbers will always be odd, and a prime number ^2 will also always be odd. So to subtract one from that number will always give you an even number. Since the prime number has be to greater than 5, then the lowest number this formula will yield is 48. Any even number great than 4 that does not have 2 and a prime number as its only factor will always have at least 3 factors of 2. So the last number that has to be dealt with to explain this formula is the last factor of 3. As you can see below, every number is divisible by 3 which explains this. Unfortunately, I can not figure out why this formula will always yield a number divisible by 3. Does anyone else have any insight? Very interesting one.

7^2 = 49 - 1 = 48
11^2 = 121 - 1 = 120
13^2 = 169 - 1 = 168
17^2 = 289 - 1 = 288
19^2 = 361 - 1 = 360
23^2 = 529 - 1 = 528
29^2 = 841 - 1 = 840

To me, this formula is just one of the "it is what it is" type formulas. The proof could be very complicated, and in fact be no real help to you on test day. My advice is to commit this formula to memory, and if you see anything to do with this on test day, you will be golden. Most likely you will not see anything referring to this formula, but the more tricks, tips, patterns, and secrets like these you know, the more time you can save and the higher score you can achieve.
_________________

New to the GMAT Club? <START HERE>

My GMAT and BSchool Tips:


Find out what's new at GMAT Club - latest features and updates

3 KUDOS received
CEO
CEO
User avatar
Joined: 17 Nov 2007
Posts: 3596
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 231

Kudos [?]: 1300 [3] , given: 346

GMAT ToolKit User GMAT Tests User
Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 10:33
3
This post received
KUDOS
S = p^2-1 = (p-1)*(p+1)

1) if p is a prime number and p>5, p is an odd number and both p-1 and p+1 are even integers and one of them is divisible by 4. So, S is divisible by 2*4=8

2) if we have 3 consecutive integers: (p-1), p, (p+1), one of them must be divisible by 3. p can't be divisible by 3 as it's a prime integer and greater than 5. Therefore, one of (p-1) or (p+1) is divisible by 3 and S is divisible by 3.

3) from 1&2 S is divisible by 3*8=24.
_________________

iOS/Android: GMAT ToolKit - The bestselling GMAT prep app | GMAT Club (free) | PrepGame | GRE ToolKit | LSAT ToolKit
PROMO: Are you an exiting GMAT ToolKit (iOS) user? Get GMAT ToolKit 2 (iOS) for only $0.99 (read more)
Math: GMAT Math Book ||| General: GMATTimer ||| Chicago Booth: Slide Presentation
The People Who Are Crazy Enough to Think They Can Change the World, Are the Ones Who Do.

Current Student
User avatar
Joined: 12 Sep 2011
Posts: 901
Concentration: Finance, Finance
GMAT 1: 710 Q48 V40
Followers: 93

Kudos [?]: 467 [0], given: 114

GMAT Tests User
Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 10:40
Well done walker! You are correct... I guess this is why I got a measly Q48 :oops: :lol:

Great insight
Veritas Prep GMAT Instructor
User avatar
Joined: 16 Oct 2010
Posts: 3111
Location: Pune, India
Followers: 572

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

Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 10:40
AbeinOhio wrote:
Found this in a Advanced GMAT Quant book....


Havent seen this anywhere else and would be interested in the proof for it if anyone can supply...

For all Prime numbers, p > 5

p^2 -1 is divisible by 24


A prime number greater than 3 is always of the form (6n+1) or (6n - 1) where n is a positive integer. Mind you, every number of the form (6n+1) or (6n - 1) is not prime but every prime (greater than 3) is of one of these forms. e.g. 5 = 6*1 - 1; 7 = 6*1+1; 11 = 6*2 - 1 etc

p^2 - 1 = (p-1)(p+1)

Since p is odd, (p is prime greater than 5), both (p-1) and (p+1) are even. Since (p-1) and (p+1) are consecutive even numbers, one of them will be divisible by 4. So (p-1)(p+1) has 8 as a factor.
Since p is of the form (6n+1) or (6n - 1), one of (p-1) and (p+1) must be of the form 6n i.e. it must be divisible by 6.
Hence, (p-1)(p+1) has 3 as a factor.

Therefore, (p-1)(p+1) has 8*3 = 24 as a factor.

These are not important rules/formulas. You can deduce these from other things you know but then there are unlimited properties you can deduce. So just focus on learning the basics.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Save 10% on Veritas Prep GMAT Courses And Admissions Consulting
Enroll now. Pay later. Take advantage of Veritas Prep's flexible payment plan options.

Veritas Prep Reviews

Manager
Manager
Joined: 28 Apr 2011
Posts: 188
Followers: 0

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

CAT Tests
Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 19:40
Walker respect man!!!!1

Have one question though can negative number be prime? like -5, -3?
CEO
CEO
User avatar
Joined: 17 Nov 2007
Posts: 3596
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40
Followers: 231

Kudos [?]: 1300 [0], given: 346

GMAT ToolKit User GMAT Tests User
Re: Prime Number Test - Proof please? [#permalink] New post 19 Mar 2012, 19:56
No.

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.
_________________

iOS/Android: GMAT ToolKit - The bestselling GMAT prep app | GMAT Club (free) | PrepGame | GRE ToolKit | LSAT ToolKit
PROMO: Are you an exiting GMAT ToolKit (iOS) user? Get GMAT ToolKit 2 (iOS) for only $0.99 (read more)
Math: GMAT Math Book ||| General: GMATTimer ||| Chicago Booth: Slide Presentation
The People Who Are Crazy Enough to Think They Can Change the World, Are the Ones Who Do.

Re: Prime Number Test - Proof please?   [#permalink] 19 Mar 2012, 19:56
    Similar topics Author Replies Last post
Similar
Topics:
New posts Prime number jainan24 5 03 Jan 2007, 23:32
New posts prime numbers spiridon 5 05 Oct 2008, 12:15
New posts prime numbers........... milind1979 4 06 Apr 2009, 01:57
New posts 1 Prime Numbers rainmaker123 3 08 Feb 2010, 11:23
New posts EXPERTS_POSTS_IN_THIS_TOPIC Test Day: Proof for US citizen? Samwong 2 28 Apr 2012, 22:42
Display posts from previous: Sort by

Prime Number Test - Proof please?

  Question banks Downloads My Bookmarks Reviews  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.