somethingbetter
If Integer n >1, is n = 2?
1. n has exactly 2 +ve factors.
2. difference of any two distinct +ve factors of n is odd.
OA says 2 alone is sufficient. can somebody give reasoning for 2 being sufficient?
1) n can be any prime. if n = 3, then it has two positive factors. If n=2, it also have two positive factors. INSUFFICIENT.
2) Factor1 - Factor2 = odd
This can only be when one of them is odd, one of them is even.
Other than 2, you can take out all the primes here since the difference between factor of prime other than 2 is odd-odd. In fact, all odd numbers are out since it has a factor of itself and 1.
Now, for all even number except 2, you are always going to have 2 as a factor and itself, which makes the difference even. So all even numbers other than 2 is out. This only leave with n=2.
SUFFICIENT