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,
Algebra ->
Divisibility and Prime Numbers
-> 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,
Log On
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
