Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized for You
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Still interested in this question? Check out the "Best Topics" block below for a better discussion on this exact question, as well as several more related questions.
C for me For XYZ to be prime we need to have a positive product so values could be: 1)1*1*(any prime) 2)1*(-1)*-(any prime) 3) -1*-1*any prime
St 1 tells us that either X or Y is +ve, so we know that XY is -ve. We know nothing about Z. Please note that negative numbers cannot be primes, but there is still a possibility for the variant 2.
St 2 tells us Z=1. we know nothing about X and Y
Combining two statements together we can answer the question: If X is any number we get a negative product of XYZ, and we know that no prime number can be negative. So answer is NO, thus SUFF
Archived Topic
Hi there,
This topic has been closed and archived due to inactivity or violation of community quality standards. No more replies are possible here.
Still interested in this question? Check out the "Best Topics" block above for a better discussion on this exact question, as well as several more related questions.