![]() ![]() If 219 is not divisible by any one of these prime numbers which are less than 14.8 then 219 will be prime. check if 219 is divisible by any one of 2,3,5,7,11,13. 219 will be prime if 219 is NOT divisible by any prime number less than "Square root of 219" ![]() The check for a Number to be prime is "If the number to be checked is NOT divisible by any prime number Less than the square root of the number then it is said to he a Prime Number" so if we have checked with 2, we dont require to check with 101. Now if the number,202, is div by 101,a prime no but 202=101*2. Now 14 itself is non prime so we require to check for div for all prime no till 14, that is till13. ![]() Any idea if we can use anything else?Ĭan you please throw more light on the logic behind this ?Īs 220 square root of the max square possible till that number.Ģ20 is between 196(14^2) and 225(15^2), so there cant be any combination which can have both factors > 14. I solved it using the divisibility rules.Īll the even numbers goes out of the window.Ģ01,207,213,219 - Sum of digits = 3 so divisible by 3Īll the numbers ending with 5 is obviously not prime This page indexes lists of small primes such as: the first 100000 primes lists of 100. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |