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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

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:

==> In the original condition, there are 2 variables (a,b) and in order to match the number of variables to the number of equations, there must be 2 equations. Since there is 1 for con 1) and 1 for con 2), C is most likely to be the answer. By solving con 1) and con 2), from a=2, you get \(b^2=2^2=4\), then b=±2. Thus, (a,b)=(2,2) yes but (a,b)=(2,-2) no, hence it is not sufficient.

If mn≠0, what is the value of \(\frac{m+1}{m}-\frac{n+1}{n}\)?

1) m=n 2) m=1

==> If you modify the original condition and the question, you get \(\frac{m+1}{m}-\frac{n+1}{n}=\frac{n(m+1)-m(n+1)}{mn}= \frac{nm+n-mn-m}{mn}=\frac{n-m}{mn}=?\). Then, for con 1), m=n, so n-mmn=0, hence it is unique and sufficient.

==> In the original condition, there are 3 variables (a,b,c) and in order to match the number of variables to the number of equations, there must be 3 equations. Since there is 1 for con 1) and 1 for con 2), E is most likely to be the answer. By solving con 1) and con 2), if (a,b,c)=(1,1,1), you get a+b+c=1+1+1=3=odd, so no, but if (a,b,c)=(2,2,2), you get a+b+c=2+2+2=6=even, so yes, hence it is not sufficient.

What is the perimeter of a certain right triangle?

1) The hypotenuse’s length is 10 2) The triangle’s area is 24

==> In the original condition, for a right triangle, there are 2 variables (2 legs) and in order to match the number of variables to the number of equations, there must be 2 equations. Since there is 1 for con 1) and 1 for con 2), C is most likely to be the answer. By solving con 1) and con 2), you get 6:8:10 and the perimeter of the right triangle becomes 6+8+10=24, hence unique and sufficient.

Therefore, the answer is C. Answer: C
_________________

Is a positive integer n greater than 1 divisible by 2?

1) 24/n is an integer 2) 32/n is an integer

==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 1), n=2 yes, but n=3 no, hence it is not sufficient. For con 2), from \(32=2^5\), n always has 2 as its factor, hence yes, it is sufficient.

If the average (arithmetic mean) of set A is 10,000 and the average (arithmetic mean) of set B is 10,000, what is the range of set A and set B combined?

1) The range of set A is 6,000 2) The range of set B is 3,000

==> If you modify the original condition and the question, from range= Max-min, you get set A: Ra =Ma-ma and set B: Rb=Mb-mb. Then, there are 6 variables and 2 equations, and in order to match the number of variables to the number of equations, there must be 4 more equations. Since there is 1 for con 1) and 1 for con 2), E is most likely to be the answer. By solving con 1) and con 2), the answer becomes E as well. Also, there is no relationship between the average and the range, and thus the answer is definitely E.

==> In the original condition, there is 1 variable (x) and in order to match the number of variables to the number of equations, there must be 1 more equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 1), “3x is a factor of 48” becomes “x is a factor of 16”, and x=2 yes but x=8 no, hence it is not sufficient. For con 2), “2x is a factor of 12” becomes “x is a factor of 6”, hence it is always yes and sufficient.

There are 30 consecutive integers. What is the sum of the integers?

1) The sum of the smallest integer and the greatest integer is -1 2) The greatest integer is 14.

==> In the original condition, there is 1 variable (n, n+1, n+2,……n+29), and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 1), you get -15~14, so the sum=-15, hence unique and sufficient. For con 2), you also get -15~14, so the sum=-15, hence unique and sufficient. Thus, con 1) = con 2).

==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For remainder questions, you always use direct substitution. For con 1), n=6 no, n=12 yes, hence not sufficient. For con 2), n=24,48,…, hence it is always yes and sufficient.

Therefore, the answer is B. Answer: B
_________________

==> In the original condition, there are 3 variables (x,y,z) and in order to match the number of variables to the number of equations, there must be 3 equations. Since there is 1 for con 1) and 1 for con 2), E is most likely to be the answer. By solving con 1) and con 2), from x>y>z, it is always yes and sufficient.

Therefore, the answer is C. Answer: C
_________________

==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 1), from 2n=n+1, you get n=1, hence sufficient. For con 2), from \(n^2=n\) and \(n^2-n=0\), n(n-1)=0, you get n=0,1, hence it is not unique and not sufficient.

==> In the original condition, there is 1 variable (x) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For con 1), x is a factor of 16, so x=8 yes, x=16 no, hence not sufficient. For con 2), x is a factor of 12, so it is always yes, hence sufficient.

Therefore, the answer is B. Answer: B
_________________

If x and y are integers greater than 1 and x>y, what are the values of x and y? 1) x+y=13 2) xy=22

==> In the original condition, there are 2 variables (x,y) and in order to match the number of variables to the number of equations, there must be 2 equations. Since there is 1 for con 1) and 1 for con 2), C is most likely to be the answer. By solving con 1) and con 2), you get x=11 and y=2, hence it is unique and sufficient. The answer is c. However, this is an integer question, one of the key questions, so you apply CMT 4(A). For con 1), from (x,y)=(11,2),(10,3), it is not unique and not sufficient. For con 2), you only get (x,y)=(2,11), hence it is unique.

Therefore, the answer is B, not C. Answer: B
_________________

In the x-y plane there is a line K, (x/a)+(y/b)=1. What is the x-intercept of line K?

1) a=b 2) a=1

==> If you modify the original condition and the question, the x-intercept is the value of x when y=0, hence from (x/a)=1, you get x=a, so you only need to find a.

Therefore, the answer is B. Answer: B
_________________

==> In the original condition, there are 4 variables (w,p,s,t) and in order to match the number of variables to the number of equations, there must be 4 equations. Since there is 1 for con 1) and 1 for con 2), E is most likely to be the answer. By solving con 1) and con 2), you get (w,s,p,t)=(1,1,1,1) yes, but (w,s,p,t)=(3,-1,-4,-1) no, hence it is not sufficient.

Therefore, the answer is E. Answer: E
_________________

1) The sum of any two prices of these 3 products is $8,000 2) At least one of them is 4,000

==> In the original condition, there are 3 variables, and in order to match the number of variables to the number of equations, there must be 3 equations. Since there is 1 for con 1) and 1 for con 2), E is most likely to be the answer. By solving con 1) and con 2), the price of each 3 products becomes $4,000, hence it is unique and sufficient. This is an inequality question, one of the key questions, so you apply CMT 4 (A: if you get C too easily, consider A or B). For con 1), the price of each 3 products always becomes $4,000, hence it is unique and sufficient. For con 2), it is unknown, hence it is not sufficient.

Therefore, the answer is A. Answer: A
_________________

==> In the original condition, there is 1 variable (m) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer.

For con 1), from m=5,10…, it is not unique and not sufficient. For con 2), from m=5,7…, it is not unique and not sufficient. By solving con 1) and con 2), you get m=5, hence it is unique and sufficient.

Therefore, the answer is C. Answer: C
_________________

==> In the original condition, there is 1 variable (n) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer.

For con 1), in order to get n(n+2)=even, you get n=even, hence yes, it is sufficient. For con 2), n=2 yes, but x=3 no, hence it is not sufficient.

Therefore, the answer is A. Answer: A
_________________

When a positive integer \(m^2\) is divided by 4, what is the remainder?

1) When m is divided by 3, the remainder is 1 2) When m is divided by 2, the remainder is 1

==> In the original condition, there is 1 variable (m) and in order to match the number of variables to the number of equations, there must be 1 equation. Since there is 1 for con 1) and 1 for con 2), D is most likely to be the answer. For remainder questions, it is best to use direct substitution.

For con 1), if you substitute from m=3p+1=1,4,7…, from m=1, 1^2=1=4(0)+1, the remainder=1, and if m=4, from 4^2=16=4(4)+0, the remainder=0, hence it is not unique and not sufficient. For con 2), from m=2q+1=1,3,5,7,…, you get m2=1,9,25,49.., and the remainder divided by 4 always becomes 1, hence it is unique and sufficient.

Therefore, the answer is B. Answer: B
_________________

==> In the original condition, there are 2 variables (x,y) and in order to match the number of variables to the number of equations, there must be 2 equations. Since there is 1 for con 1) and 1 for con 2), C is most likely to be the answer. By solving con 1) and con 2), from x<√x, you get 0<x<1, and from √y<y, you get y>1. Then, you get x<1<y, hence always yes.