Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Cat 2007 Quantitative Questions Day Qqad Problems

Cat 2007 Quantitative Questions Day Qqad Problems

Ratings: (0)|Views: 3,086|Likes:

Availability:

See more
See less

03/18/2014

pdf

text

original

Solution to Quantitative Question # 1Question: 1The equation |x-1| - |x-2| + |x-4| = m has exactly n real solutions for some real m. Then whichamong the following relations between m and n can not be true?(a) m/n = 3/5 (b) m = n (c) m/n = 3/2 (d) m/n = 5/3 (e) m = n-1Solution:Since 1, 2, 4 are the critical point, we divide the domain into 4 regions;1) when x > 4 |x-1| - |x-2| + |x-4| = (x-1)-(x-2)+(x-4) = m => x-3 = m => m>12) when 2 < x <=4 |x-1|-|x-2|+|x-4| = (x-1)-(x-2)-(x-4) = m => 5-x = m => 1 <= m < 33) when 1 < x <=2 |x-1|-|x-2|+|x-4| = (x-1)+(x-2)-(x-4) = m => x+1 = m => 1 < m <= 34) when -Infinity < x <=1 |x-1|-|x-2|+|x-4| = -(x-1)+(x-2)-(x-4) = m => 3-x = m => 2 <= m<= InfinityClearly for n=4 we have 2 < m < 3; for n=3 we have m = 2,3; for n=2 we have 1 < m < 2;for n=1 we have m=1; for n=0 we have 1 > m.Looking at the choices (a) m = 2.4 and n = 4 satisfy (b) m = n = 3 satify (d) m = 10/3 and n =2 satisy (e) m = -1 and n = 0 satisyHence, choice (c) is the right answer.---------------------------------------------------------------------------Solution to Quantitative Question # 2 (Answered 1st by warrior and best solution by Apple)---------------------------------------------------------------------------When Katrina get's Swiss chocolcates, she swings in delight, equal to her total chocolates at thattime. For instance, if Katrina gets 3 chocolates, then 7 chocolates and then 3 chocolates again,she at first makes 3 swings, then she makes 3+7 = 10 swings and then she makes 3+7+3 = 13swings, making a total of 3+10+13 = 26 swings. If all of Katrina's Swiss chocolates are in agroup of

either 3 or 7 and Katrina makes 99 swings during the process, in how many differentways can she get the chocolates in that process ?(a) 3 (b) 6 (c) 5 (d) 2 (e) none of the foregoingSolution:If a1, a2, a3, ... are the numbers in which Katrina gets chocolates in order then Katrina's totalswings will be n*a1 + (n-1)*a2 + .... + an where a1, a2 etc. take the values 3 or 7. Given thefact n*a1 + (n-1)*a2 + .... + an = 99; if all a1, a2 etc are 3 then 3n(n+1)/2 = 99 => n(n+1) =66, so we know n can atmost be 7. Taking a1, a2 as 7 we can see that n is greater than 4.OK, if it's 7a1 + 6a2 + ... + a7 = 99 then because 3 and 7 are each of the form 4k-1 we see 7a1+ 6a2 + ... + a7 = 99 reduces to 4*(7k1 + 6k2 + ...+ k7) = 99 + (1 + 2 +... +7) = 99 + 28,which is not possible. Similarly it's not for n=5. For 6 it's possible as 99 + (1 + 2 +...+ 6) = 120is div by 4.Now you are left with 6k1 + 5k2 + ...+ k6 = 30 where k1,k2 ... takes either 1 or 2(k1, k2, k3, k4, k5, k6) = (1, 2, 1, 2, 1, 2), (2, 1, 1, 1, 2, 2), (1, 1, 2, 2, 2, 1), (1, 2, 2, 1, 1, 1),(2, 1, 1, 2, 1, 1)Hence, choice (c) is the right answer.

---------------------------------------------------------------------------Solution to Quantitative Question # 3 (Answered 1st by krsh.vik)---------------------------------------------------------------------------Question:Let f(x ,y) be a function satisfying f(x ,y)=f(2x + 2y, 2y -2x) for all x , y. Define g(x)=f(2^x , 0).What is the minimum positive integer p if g(x+p)=g(x) for all x?(a) 4 (b) 6 (c) 8 (d) 12 (e) none of the foregoingSolution:f(x ,y)=f(2x+2y,2y-2) = f(8y ,-8x )f(8y,-8x) = f (8(-8x), -8(8y)) = f(-64x , -64y) = f(-64(-64x),-64(-64y)) = f(2^12 x ,2^12 y) =f(x,y)=> f(x,0)=f(2^12 x,0) so , f(2^x,0) = f(2^(x+12) ,0) = > g(x) = g(x+12)Hence, choice (d) is the right answer.Solution to Quantitative Question # 4 (Answered 1st by innocent_123 and Apple and best solutionby rajan24u)---------------------------------------------------------------------------Question:Consider a triangle PQR so that PQ=4, PR=5 and QR=6. Similarly, we have a point S so thatQS=5, RS=4, and PQSR is a paralleogram (not an isosceles trapezium). We draw the anglebisector of < P, which hits QS at T, and the angle bisector of <PQT, which intersects PT at U. Thenthe length of TU is (vx denotes square root of x)(a) 3 (b) 4v6/ 3 (c) 2v3 (d) 9/2 (e) none of the foregoingSolution:Letting <PRQ = x , we have <TPQ=<TPR =xLet A be the intersection of PT and QR. <PAQ =<APR +<PRA =2xSo , triangle PQR ~ triangle AQP , which gives , PA =4* 5/6 =10/3Now, since PR||QS , we have PA /AT =PR /QT => PA /PT = PR / PR + QT<PTQ = <RPT=<QPT ,so triangle PQT is isosceles where PQ=QT=4Hence , PT = {(PR + QT) /PR} * PA = 9/5 * 10/3 =6Since the angle bisector of the vertex angle of an isosceles triangle bisects its base,TU =1/2 *6 =3Hence, choice (a) is the right answer.---------------------------------------------------------------------------Solution to Quantitative Question # 5 (only sushane and innocent_123 got this correct)---------------------------------------------------------------------------Question:Three positive integers a, b, and c are consecutive terms in an arithmetic progression. Given thatn is also a positive integer, for how many values of n below 1000 does the equation a^2 - b^2 -c^2 = n have no solutions?

(a) 458 (b) 493 (c) 524 (d) 559 (e) 596Solution: (By our member sushan)Let a = b+d, and c = b-d => n = b(4d - b)put b = 4d - 1, it gives n = (4d - 1)*1 = 4d - 1 = 3,7,11,...,999 for d = 1,2,...,250put b = 4d - 2 it gives n = 8d - 4 = 4,12,...,996 for d = 1,2,...,125put b = 4d -3, n = 12d - 9 which is of the form 4k - 1 and already countedput b = 4d - 4 it gives n = 16d - 16 = 16,32,...,992 for d = 2,3,...,63it can be seen that b = 4d - 3, 4d - 5,... etc. give these already counted values of n.=> total n are 999 - 250 - 125 - 62 = 562. The answer is not in the choices!For more rigorous mathematical proof please refer innocent_123's post # 214 in the discussionthread.---------------------------------------------------------------------------Solution to Quantitative Question # 6 (Answered 1st by innocent_123, Apple and sushan)---------------------------------------------------------------------------Question:20 teams of five archers each compete in an archery competetion. An archer finishing in kthplacecontributes k points to his team, and there are no ties. The team that wins will be the onethat has the least score . Given that, the 1st position team's score is not the same as any otherteam,the number of winning scores that are possible is ?(a) 236 (b) 237 (c) 238 (d) 239 (e) none of the foregoingSolution:The teams’ scores must sum to 1 + 2 + . . . + ..+99+100 =5050. The winning score must be nolarger than 1/20 *5050 = 252.5 and is at least 1 + 2 + 3 + 4 + 5 = 15. However, not all scoresbetween15 and 252 inclusively are possible because all teams must have integer scores and no team cantie thewinning team. If the winning score is s, the sum of all teams’ scores is at least s + 19(s + 1) =20s +19,so solving gives s <= 251. Hence, 251 − 15 + 1 = 237 winning scores are possible.Hence, choice (b) is the right answer---------------------------------------------------------------------------Solution to Quantitative Question # 7 (Answered 1st by Apple and sunilnatraj)---------------------------------------------------------------------------Question:P(x) is a third degree polynomial and the coefficients of P(x) are rational. If the graph of P(x)touches the x-axis, then how many rational roots does P(x) = 0 have?(a) 0 (b) 1 (c) 2 (d) 3 (e) none of the foregoingSolution:Since P(x) touches x-axis => P(x)=0 has a repeatable root and is real. If the repeatable root isirrational and is a+vb then the non-repeatable root is k-2vb where k is a rational number. WHY?=> P(x) = p*(x-a-vb)^2*(x-k+2vb) which means the constant term of P(x) is irrational, acontradiction. Thus, the repeatable root is rational. And so is non-repeatable.Alternate Method:Let P(x) be x^3 − ax^2 + bx − c. Let m be a root of P(x) = 0 and P′(x) = 0