document.write( "Question 117716: hello sir,
\n" );
document.write( "This is Prakash Baskaran.
\n" );
document.write( "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,
\n" );
document.write( "another condition being that, the num is not divisible by any numbers from 1-15. \r
\n" );
document.write( "\n" );
document.write( "Pls do reply to my mail\r
\n" );
document.write( "\n" );
document.write( "Prakash Baskaran \n" );
document.write( "
Algebra.Com's Answer #85707 by MathLover1(20850)![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "“Fermat's little theorem” can help you to determine whether number is prime or not. One version of the theorem states:\r \n" ); document.write( "\n" ); document.write( "If \n" ); document.write( "\n" ); document.write( "Examples: \r \n" ); document.write( "\n" ); document.write( " if \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " |