QuestionA shop sells two variants of chocolates - one that costs $3 and the other that costs $5. If the shop sold $108 chocolates on a given day, how many different combinations of (number of $3 sold, number of $5 sold) exist?A. 6B. 7C. 15D. 8E. 12Correct Answer : Choice D. 8Explanatory AnswerLet the shop sell x numbers of the $3variant and y numbers of the $5 variant.So, 3x + … [Read more...] about Linear Equations : Common Multiples
GMAT Number Properties
Number Properties : LCM, HCF
This question is a relatively easy question on LCM and HCF of two numbers. QuestionIf the product of two positive integers is 144, which of the following could be the LCM and HCF of the two numbers?I. LCM : 24; HCF : 6II. LCM : 18; HCF : 8 III. LCM : 16; HCF : 9A. I onlyB. II and III only C. I and II onlyD. I and III only E. I, II and IIICorrect Answer : Choice … [Read more...] about Number Properties : LCM, HCF
Counting Methods : GMAT Problem Solving
This GMAT permutation combination practice question is a classic counting methods question focusing on numbers and number properties. You can use the explanation given in this question as a template to solve questions of this kind. After cracking the question, create your own variants of this question and try solving them to master this idea. Question How many odd 4 digit … [Read more...] about Counting Methods : GMAT Problem Solving
GMAT Data Sufficiency Practice : Inequalities & Number Properties
QuestionIs a + b > 0?1. a - b > 02. |a| < |b|Correct Answer is Choice C. Both statements together are sufficient to answer the question.Explanatory AnswerAn "IS" question is answered when you can provide a definite YES or a definite NO as an answer to the question using the data.We need to answer if a + b > 0.Statement 1: a - b > 0.We can infer that a > b.If … [Read more...] about GMAT Data Sufficiency Practice : Inequalities & Number Properties
DS Number Properties – Divisibility – Prime Divisors
This is an interesting Data Sufficiency question that tests your understanding of divisibility, indices and prime factors.QuestionIf n is an integer, is n3 divisible by 54? 1. n2 is divisible by 6. 2. n3 is divisible by 36.Correct Answer : Choice D. Each statement is independently sufficient to answer the question.Explanatory AnswerFor "is" questions in DS, we … [Read more...] about DS Number Properties – Divisibility – Prime Divisors