Akshay1298
How to find out a larger number prime or not? Is there any technique to find them?
Generally, there’s no simple way to check if a very large number is prime (unless it has small factors, which are easier to check). For numbers like that, you’d need a computer to test.
On the GMAT, you won’t encounter a large number to factorize unless there’s a clear shortcut.
Here is a way though:
•
Verifying the primality (checking whether the number is a prime) of a given number \(n\) can be done by trial division, that is to say dividing \(n\) by all integer numbers smaller than \(\sqrt{n}\), thereby checking whether \(n\) is a multiple of \(m\leq{\sqrt{n}}\).
Example: Verifying the primality of \(161\): \(\sqrt{161}\) is little less than \(13\), from integers from \(2\) to \(13\), \(161\) is divisible by \(7\), hence \(161\) is not prime.
Note that, it is only necessary to try dividing by
prime numbers up to \(\sqrt{n}\), since if
n has any divisors at all (besides 1 and
n), then it must have a prime divisor.