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

It is currently 20 Aug 2014, 08:35

Flash Sale:

The Economist GMAT Tutor - 15% Off All Courses


Close

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
Your Progress

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Prime Numbers

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
Manager
Manager
avatar
Joined: 14 Jul 2009
Posts: 61
Followers: 1

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

GMAT Tests User
Prime Numbers [#permalink] New post 08 Feb 2010, 10:23
Hi all,

What is the fastest way to determine if a number is prime? I see some questions in which you need to check if a number is prime or not. The problem is sometimes the number is a huge number.

Thanks
Intern
Intern
avatar
Joined: 16 May 2009
Posts: 29
Followers: 0

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

Re: Prime Numbers [#permalink] New post 08 Feb 2010, 10:42
GS has posted the answer to this question on his flash cards so credit goes to him/her.


How to determine prime no = Find approx square root of the number. Then check if all the prime
numbers below the square root are factors of the given number. If none are then the number is
prime else not.
e.g. number 91. approx sq root is 10
Prime number below 10 are 2.3.5&7.
91 is not divisible by2,3 or 5. But it is divisible by 7.
Therefore 91 is not prime
1 KUDOS received
GMAT Instructor
avatar
Joined: 24 Jun 2008
Posts: 967
Location: Toronto
Followers: 252

Kudos [?]: 651 [1] , given: 3

GMAT Tests User
Re: Prime Numbers [#permalink] New post 08 Feb 2010, 14:32
1
This post received
KUDOS
Pedros above has posted the most efficient way to check if a number is prime. In general, it is *very* time consuming to prove that a large number *is* prime -- so time consuming that you could never be asked to do it on the GMAT. It is, however, sometimes easy to see that a large number is *not* prime, and that is something you are occasionally asked to do on the test. So, for example, it is easy enough to see that none of the numbers

31,112
31,113
31,114
31,115
31,116

are prime; three of them are even, 31,113 is divisible by 3 (add the digits) and 31,115 is divisible by 5 (it ends in 5). However, it would take several minutes with pen and paper to work out whether 31,111 is prime (it is not, as it turns out; it is divisible by 53). The only way to check that is to start trying to divide it by small primes until you find a factor, and that takes ages; you don't have time to do that on the GMAT, so they can't ask you to do it. The only way the GMAT can ask you whether a large number is prime is if it is not prime, and in that case the number must have an 'obvious' factor like 2, 3, or 5, or a factor you can find using algebraic techniques, as in the following examples:

11! + 7 (since 11! and 7 are both multiples of 7, when we add them we must get a multiple of 7, so 11! + 7 is not prime)

13^9 + 13^2 + 13 (again, we are adding multiples of 13, so we must get a multiple of 13; 13^9 + 13^2 + 13 is not prime)

1003^2 - 1000^2 (this follows the 'difference of squares' pattern, so we can factor: 1003^2 - 1000^2 = (1003+1000)(1003-1000) = (2003)(3), so is not a prime number)
_________________

Nov 2011: After years of development, I am now making my advanced Quant books and high-level problem sets available for sale. Contact me at ianstewartgmat at gmail.com for details.

Private GMAT Tutor based in Toronto

Intern
Intern
avatar
Joined: 16 May 2009
Posts: 29
Followers: 0

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

Re: Prime Numbers [#permalink] New post 08 Feb 2010, 14:57
IanStewart wrote:


11! + 7 (since 11! and 7 are both multiples of 7, when we add them we must get a multiple of 7, so 11! + 7 is not prime)

13^9 + 13^2 + 13 (again, we are adding multiples of 13, so we must get a multiple of 13; 13^9 + 13^2 + 13 is not prime)

1003^2 - 1000^2 (this follows the 'difference of squares' pattern, so we can factor: 1003^2 - 1000^2 = (1003+1000)(1003-1000) = (2003)(3), so is not a prime number)


Thank you Ian for that analysis
Re: Prime Numbers   [#permalink] 08 Feb 2010, 14:57
    Similar topics Author Replies Last post
Similar
Topics:
3 Experts publish their posts in the topic Prime Number Baten80 3 22 Feb 2011, 03:22
3 Experts publish their posts in the topic If N is a positive integer, is 9 a factor of N? Jinglander 8 24 May 2010, 21:58
prime numbers........... milind1979 4 06 Apr 2009, 00:57
prime numbers spiridon 5 05 Oct 2008, 11:15
Prime number jainan24 5 03 Jan 2007, 22:32
Display posts from previous: Sort by

Prime Numbers

  Question banks Downloads My Bookmarks Reviews Important topics  


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®.