GMAT Question of the Day: Daily via email | Daily via Instagram New to GMAT Club? Watch this Video

It is currently 18 Feb 2020, 13:31

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.

Close

Request Expert Reply

Confirm Cancel

Easy math trick to check whether a Number is Prime or Not

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
Manager
Manager
avatar
S
Joined: 11 Sep 2019
Posts: 78
Easy math trick to check whether a Number is Prime or Not  [#permalink]

Show Tags

New post 26 Sep 2019, 04:31
3
1
To check whether a number N is prime, adopt the following process.

(a) Take the square root of the number.

(b) Round of the square root to the immediately lower integer. Call this number Z.
For example if you have to check for 181, its square root will be 13. Hence, the value of Z, in this case will be 13.

(c) Check for divisibility of the number N by all prime numbers below z. If there is no prime number below the value of z which divides N then the number N will be prime.

To illustrate :-
The value of \sqrt{239} lies between 15 to 16. Hence, take the value of z as 15.
Prime numbers less than 15 are 2, 3, 5, 7, 11 and 13.
239 is not divisible by any of these.
Hence you can conclude that 239 is a prime number.

P.S. in order to check the divisibility, you should learn Divisibility Rules which are easy and simple, and will take far less time.
GMAT Club Legend
GMAT Club Legend
User avatar
V
Joined: 18 Aug 2017
Posts: 5931
Location: India
Concentration: Sustainability, Marketing
GPA: 4
WE: Marketing (Energy and Utilities)
GMAT ToolKit User Reviews Badge CAT Tests
Easy math trick to check whether a Number is Prime or Not  [#permalink]

Show Tags

New post 26 Sep 2019, 05:44
2
Aadi01
well you can use following formula to determine validity of prime
for any prime no>3 it can expressed as p=6n+1 or p=6n-1 ; n is the +ve integer value

hope this helps


Aadi01 wrote:
To check whether a number N is prime, adopt the following process.

(a) Take the square root of the number.

(b) Round of the square root to the immediately lower integer. Call this number Z.
For example if you have to check for 181, its square root will be 13. Hence, the value of Z, in this case will be 13.

(c) Check for divisibility of the number N by all prime numbers below z. If there is no prime number below the value of z which divides N then the number N will be prime.

To illustrate :-
The value of \sqrt{239} lies between 15 to 16. Hence, take the value of z as 15.
Prime numbers less than 15 are 2, 3, 5, 7, 11 and 13.
239 is not divisible by any of these.
Hence you can conclude that 239 is a prime number.

P.S. in order to check the divisibility, you should learn Divisibility Rules which are easy and simple, and will take far less time.
Math Expert
avatar
V
Joined: 02 Aug 2009
Posts: 8261
Easy math trick to check whether a Number is Prime or Not  [#permalink]

Show Tags

New post 27 Sep 2019, 19:37
Archit3110 wrote:
Aadi01
well you can use following formula to determine validity of prime
for any prime no>3 it can expressed as p=6n+1 or p=6n-1 ; n is the +ve integer value

hope this helps



Aadi01 wrote:
To check whether a number N is prime, adopt the following process.

(a) Take the square root of the number.

(b) Round of the square root to the immediately lower integer. Call this number Z.
For example if you have to check for 181, its square root will be 13. Hence, the value of Z, in this case will be 13.

(c) Check for divisibility of the number N by all prime numbers below z. If there is no prime number below the value of z which divides N then the number N will be prime.

To illustrate :-
The value of \sqrt{239} lies between 15 to 16. Hence, take the value of z as 15.
Prime numbers less than 15 are 2, 3, 5, 7, 11 and 13.
239 is not divisible by any of these.
Hence you can conclude that 239 is a prime number.

P.S. in order to check the divisibility, you should learn Divisibility Rules which are easy and simple, and will take far less time.


That is correct, but remember
Prime number will be of the type 6k+1 or 6k-1, but vice versa is not true..
So, if a number>3 can NOT be written in the form 6k+1 or 6k-1, it will NOT be a prime number..
But if a number>3 is in the form 6k+1 or 6k-1, it CAN be a prime number, so you will have to check further to ascertain if that number is a prime number.

If the choices contain ONLY one in that form, you can blindly mark that answer. However, do check all the choices for this form.
_________________
GMAT Club Bot
Easy math trick to check whether a Number is Prime or Not   [#permalink] 27 Sep 2019, 19:37
Display posts from previous: Sort by

Easy math trick to check whether a Number is Prime or Not

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  

Moderator: DisciplinedPrep






Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne