SOLUTION: hello sir, This is Prakash Baskaran. Is there any shortcut method to find out whether a number is prime or not?? for simple numbers it is easy, but what is I'am given a huge num,

Question 117716: hello sir,
This is Prakash Baskaran.
Is there any shortcut method to find out whether a number is prime or not?? for simple numbers it is easy, but what is I'am given a huge num,
another condition being that, the num is not divisible by any numbers from 1-15.
Pls do reply to my mail
Prakash Baskaran
Answer by MathLover1(20850) (Show Source): You can put this solution on YOUR website!

�Fermat's little theorem� can help you to determine whether number is prime or not. One version of the theorem states:
If is a and any whole number, then is a multiple of .
Examples:
if and , the theorem correctly predicts that divides evenly into , or
is divisible by
is divisible by
is divisible by

is divisible by

RELATED QUESTIONS
Sir I Need some help in how to determine whether the given number is prime or not for the (answered by Fombitz)

Hi there, I was wondering whether or not there is a method to solving this called a... (answered by Alan3354)

I have a factoring issue. I apologize if my question is in the incorrect category. I... (answered by stanbon)

What is the least positive integer k for which 120�k is the square of an integer? Is... (answered by ikleyn)

I would appreciate help with this question please. Checking to see whether the number p... (answered by Edwin McCravy)

7^5 - 7^3 = 7^3 (48) what is the shortcut to find this... (answered by richard1234)

Find the two-digit consecutive prime numbers that have the greatest difference between. (answered by Alan3354)

dear sir i have already send a Q . the Q is "whether ((2^16)+1) prime or composite ?" (answered by Edwin McCravy)

I have read from the list that 103 421 is a prime number Is there a simple way to find (answered by stanbon)