jan4dday
please explain 2nd Q.
i want an example where XYZ can be prime using STATEMENT 1 ALONE
First note prime numbers are only positive. (Also note that \(x\), \(y\) and \(z\) are integers)
Q: \(xyz=p\), is \(p\) prime?
(1) \(x=-y\) --> \(p=-x^2z\). Let's check when this expression gives a prime number:
Well first of all \(p\) to be prime \(z\) MUST be negative, as \(p\) MUST be positive to be a prime.
Next if \(x>|1|\), (eg \(|2|\), \(|3|\), ...) OR equals to zero, \(p\) won't be prime. So \(x\) must be equal to \(|1|\).
But it's not enough. We'll have \(p=-x^2z=-z\), so \(p\) to be a prime number \(z\) must be equal to \(-prime\).
You are asking how using statement (1) \(p\) could be a prime: according to above, when \(|x|=1\) and \(z=-p\). eg.: \(x=-1\) --> \(y=1\) --> z\(=-7\) --> \(p=(-1)*1*(-7)=7\), which is prime.
Statement (1) may or may not give the prime number for \(xyz\). Not sufficient.
(2) \(z=1\) --> \(p=xy\). Again for \(p\) to be a prime number \(xy\) must be \(>0\) (both positive or both negative). Then if \(x=|prime|\) and \(y=|1|\), OR \(y=|prime|\) and \(x=|1|\), so that \(xy>0\), then \(xy\) is a prime number. For any other values or combinations of \(x\) and \(y\), \(p\) won't be a prime. Not sufficient.
(1)+(2) \(p=xyz=-x^2\) (as \(x=-y\) and \(z=1\)). \(-x^2\) is never positive, hence \(p\) is not a prime. Sufficient.
Answer: C.
Hope it's clear.