## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

**http://www.vedicaptitude.com/?page_id=934
**

Not logged in

< 432 882 922 930 931 932

934 > Last »

Re: lulu% - 29-03-2012, 03:11 PM Quote:

**there r 3 studnts ta 3. 50 4. not 5. cbd bio=chem/4 30=120/4.
**

» Quote

**The Following User Says Thank You to Debtanu12 For This Useful Post: Toughluck2009
**

Sponsored Links (#9312)

» Quote

(#9313) Re: Official Quant Thread for CAT 2012 [part 2] - 29-03-2012, 04:05 PM Quote:

» Quote

(#9314)

culdip

you can not handle today the way you handled yesterday Addicted PaGaL

Re: lulu% - 29-03-2012, 04:14 PM Quote:

Originally Posted by bs0409

How many solutions does n^2 - [n^2] = (n - [n])^2 have satisfying 1 ≤ n ≤ 5 where [n] denotes greatest integer less than or equal to n?

n^2-[n^2] = (n-[n])^2 = n^2+[n]^2-2n[n] [n]^2+[n^2] = 2n[n]

... 7/2.mere methods pe hanso. Hardcore PaGaL Re: lulu% .. 2. 5/2. 39/8 .n =1.. 4. 19/6.5. 9/4. 2. 11/3.. 3.5. 3/2. The number of real solutions to the equation 4n^2 . 2.75.29-03-2012. 4. 4.25... 4. 29-03-2012 at 05:11 PM. 33/8.29-03-2012. 5 .. Posts: 1...40[n] + 51 = 0 are 4n^2 .438 Join Date: Jun 2011 Location: Kanpur Age: 22 Thanks: 501 Thanked 1. 2..5.[n^2] = (n . 3.379 Times in 676 Posts Groans: 7 Groaned at 5 Times in 5 Posts » Quote (#9315) mudwel hanso. 37/8. RHS can never be an integer as numerator is odd and denominator is even. 19/4. 3. » Quote The Following User Says Thank You to mudwel For This Useful Post: bs0409 (#9316) bs0409 A truth told late can be more harmful than a lie.[n])^2 have satisfying 1 ≤ n ≤ 5 where [n] denotes greatest integer less than or equal to n? 2.How many solutions does n^2 . 04:23 PM Quote: Originally Posted by culdip n^2-[n^2] = (n-[n])^2 = n^2+[n]^2-2n[n] [n]^2+[n^2] = 2n[n] n = 1..75. 17/4. 23/6.. 9/2. 4.5. 11/4. 35/8. 2.40[n] +51=0 [n]=(4n^2+51)/40. 1. Certified PaGaL Re: lulu% .Let [n] denotes greatest integer less than or equal to n.25. 5 total 21 sulutions Last edited by culdip. 04:21 PM Quote: Originally Posted by bs0409 Posts: 475 Join Date: Nov 2010 Location: Bhopal Thanks: 73 Thanked 170 Times in 135 Posts Groans: 1 Groaned at 0 Times in 0 Posts 1. so no solutions. 10/3..

819 Times in 3. 21 solutions » Quote The Following 3 Users Say Thank You to chillfactor For This Useful Post: bs0409. k² + 2k => n² .(k² to k² + 2k) = n² . we will have two solutions k = 2.29-03-2012.... 1 solution as n ≤ 5 But n = 2. 3. 5 are counted twice So.257 Thanked 1. 04:24 PM Quote: Originally Posted by bs0409 Posts: 4. 4.... The number of divisors of N are » Quote (#9317) chillfactor has no status. For k = 1.909 Join Date: Feb 2010 Location: Mumbai Age: 26 Thanks: 2.078 Times in 666 Posts Groans: 22 Groaned at 27 Times in 10 Posts Let N be the largest integer divisible by all positive integers less than its cube root. Toughluck2009 (#9318) dixjatin The road will never be the Re: lulu% .597 Posts Groans: 0 Groaned at 15 Times in 13 Posts How many solutions does n^2 . 6 solutions k = 4.1)/2k So. k² + 1.732 Join Date: Oct 2008 Age: 28 Thanks: 4. then [n²] can be k²..... But how did you get the values?? is it by trial and error?? Posts: 1. 8 solutions k = 5.total 13 solutions Aekdum sahi...276 Thanked 11.. . k + 2/2k.2kn + k² => n² = k. 4 solutions k = 3.[n])^2 have satisfying 1 ≤ n ≤ 5 where [n] denotes greatest integer less than or equal to n? I think its 21 solutions If [n] = k. Certified PaGaL Re: lulu% .. k + (2k .29-03-2012. .. mudwel. 04:38 PM .[n^2] = (n . k + 1/2k..

803 Join Date: Jan 2010 Location: Bangalore Thanks: 3. Naga Saar.Basics. Vikas bhai and many more . that this post is not organized.299 Posts Groans: 5 Groaned at 13 Times in 11 Posts . IMT .29-03-2012. SORRY.php?d=8392 . number of students taking up biology = 0. Hemant saar. Microsoft Word .Find last two nonzero digits.N. Varun saar.. Rejects : IMT G. Didn't attend : FORE. number of students taking up physics = p+x Therefore. maximum value of x = 12 I think you are doing it wrong 12+24+36+48=120 In this case each student will attend only one class. TAPMI.. Puys.5*(p+x) => 5*(p+x)=120 => p+x=24 Therefore.Plotting graphs of quadratic Posts: 2. Awaited : IMI Certified PaGaL Re: lulu% . Physics = 24 Chemistry = 48 Maths = 36 Biology = 12 Hence. Maxima and Minima_4 Venn Diagrams Transformation of graphs by modulus function .. which is not asked in the question » Quote (#9319) pkaman Converts : Great Lakes. Nachiket bhai.5*(p+x) Therefore.545 Thanked 3.Number of solutions of an equation. number of students taking up maths = 1. that I have learnt from puys like you and GODS viz. Angad bhai. Mn bhai..com/mod/forum/discuss. Its nothing but just the random collection of tips and tricks that I have gathered over past few months.463 Times in 1. KJS. Download these : MBA|CAT|CAT 2011|CAT 2012|CAT Online|MBA 2012|MBA Entrance Exams|CAT Test|Preparation|CAT Questions http://totalgadha. below is the list of concepts/tricks/fundamentals/formulaes etc. number of students taking up chemistry = 2*(p+x) Therefore. MBA|CAT|CAT 2011|CAT 2012|CAT Online|MBA 2012|MBA Entrance Exams|CAT Test|Preparation|CAT Questions .. 04:44 PM WARNING : This is going to be a Loooooooong post .same Newbie PaGaL Quote: Originally Posted by Debtanu12 Posts: 23 Join Date: Jan 2008 Age: 25 Thanks: 4 Thanked 12 Times in 9 Posts Groans: 1 Groaned at 0 Times in 0 Posts Number of students taking up all four subjects = x Number of students taking up any three subjects = 0 Number of students taking up any two subjects = 0 Number of students taking up physics only = p Therefore.Venn Diagrams. Problems.

AC * BD >= AB*CD + AD*BC For a cyclic quadrilateral the equality holds true i.equations.(n/2)C2 + 1) if n is even as we get centre point as a common point to n/2 diagonals.Last minute MUST Geometry : Ptolemy's theorem : For a quadrilateral ABCD to be a closed figure .2) If |x| +|y|=a.root 3) r^2 -> Sum of the exterior angles of a polygon add up to 360 -> In general. Inclusion?exclusion principle .. then the area of the region bounded by the given curve will be 2a^2..ust. but not using the sides = n/3 * C(n-4.Exclusion http://www. of triangles that can be drawn by using the vertices. -> that if nCa=nCb then either a=b or a+b=n When two equations a1x^2 + b1x + c1 = 0 and a2x^2 +b2x + c2 = 0 have . So in case of Cyclic Quad. + nCn = 2^n to get an intersection point inside the polygon..ml#post1742160 (PG Underdogs Team ' 09) . we need to select 4 of the vertices. if AC and BD are diagonals.Inclusion Exclusion http://www...e AC * BD = AB*CD + AD*BC For any quad ABCD. Find the area of the region bounded by the graph |x-7|+|y-9|=12 (AIMCAT 1209) Area bounded by the graph |x-7|+|y-9| = 12 is same as Area bounded by the graph |x|+|y| = 12 and that is =>2*12^2=288 sq units nC0 + nC1 + nC2 + . and q=1/2(Sum of Opposite Angles) Area=((s-a)(s-b)(s-c)(s-d)-abcd*cosq)^1/2.-Exclusion..c.math.edu/~putnam/inclExcl. total intersection points = C(n. ???? for quadr. the free encyclopedia .hk/~mabfchen/Mat.pdf . No.cornell.sum of opposite sides is equal The perimeter of a right angle triangle=2(r+2R) And the area =r^2+2rR = r(r + 2R) -> when two circles are of same radius are overlapped with center common area is 1/2 (4*pi /3 . 4) we get nC4 intersection points if polygon has n sides with n being odd.Inclusion . side lengths a. After choosing them we can get two intersecting diagonals in only one way.math.pdf . for n-sided polygon. This is also valid also when |x+k|+|y+k|=a Q. Area=((s-a)(s-b)(s-c)(s-d))^1/2. So.com/forum/cat-an.Wikipedia.d respt..pagalguy. And (nC4 .. circumscribing a circle .Inclusion Exclusion http://www...b.

.. + C(n + r . v1/v2=root(t2/t1) Sum of digits formed without repetition : If zero is not there..s will be divisible by 7. hence 48 8's will be divisible by 7 any digit repeated 3 times is divisible by 3*37 1^k + 2^k + 3^k. 1)x + C(r + 1.2) + . n)x^n + . 496 and 8128. 2)x^2 + . n times.. Basically if no of marks are +n for correct and -1 for incorrect..11.1 is divisible by 7.7. then (c1a2. 1)yx^(n .1)/2 after crossing if they take time t1 and t2 to reach destination..3) + .y)^n = 2{C(n. n-1 times)] Remainders : There is a theorem in quant Very Imp Any no written 6 times is divisible by 3. S = (n-2)! (Sum of all digits) [(n-1)(1111.11..(x . } (1-x)^(-3) = 1 + C(3...3)*x^3 + . + 1 = n(n ..+ n^k is divisible by n(n+1)/2 when k is odd -> No's repeated 3^n times are divisible by 3^n -> a^6 ..13. Binomial : (a + b)n = nC0an + nC1an − 1b + nC2an − 2b2 + nC3an − 3b3 + .2)*x^2 + C(5.x)^(-r) = (1 + C(r. where a and 7 are coprime. (Fermat. of co-prime pairs of factors = (a+1)(b+1)(c+1) + ab + bc + ca +3abc . then Number of score which are not possible is given by (n .37 and the no itself Therefor 111111 will be divisible by 3.1)*x^1 + C(4. If zero '0' is there .13..7. + nCnbn (1 ... 3)y^3*x^(n ...1 A perfect number is the number whose sum of all factors except itself is equal to that number itself..c2a1)^2 = (a1b2-a2b1)(b1c2-b2c1) COMMON ROOT is: c1a2-c2a1/a1b2-a2b1 No. 37 and 1 now similarly 6 8.1.ONE common root... (x + y)^n . First 4 perfect numbers are 6.1 will be divisible by 7 => 999999 will be divisible -> group 3 digits each and then alternatively subtract and add...(1111... 28.1) + (n . S = (n-1)! * (Sum of digits)*11111.s theorem) => 10^6 ...1) + C(n.n times) . then.. The final .

-> Say the number is xxxxxx (that is x occurring 6 times) Now xxxxxx=1001*xxx for any value of x In fact for a set of 3 numbers recurring twice it will be divisible by 1001. And when raised to odd power.number when divided by 7 will give u the remainder. Eg: . when raised to even power end with 01. -> The remainder we get when we divide the sum of the digits by 9 is the same as the remainder when we divide the number by 9 Note:.when p is odd -> Odd perfect squares are always of form 8k + 1 -> Square numbers are always of the form 3n or 3n+1 -> 2^20n has last four digit as c9376 2^(20k) always has last two digits as 76 2^(20k + 10) always has last two digits as 24 -> When a three digit number has last two digits 24 and 74 .11 & 13 -> Last three digits of 7^k has a pattern. end with 49 or 99 resp.345 + 12 (mod 1001) = 345 (mod 1001) -> Euler's number of number N is the number of numbers less than N and coprime to N. 123123 = 123*1001 abcabc=abc*1001 Now 1001=7*13*11 So the number mentioned in the first line will always be divisible by 7.If we have to find remainder on division by 1001.12345678 = 678 .. 7^4 = 401 7^8 = 801 7^12 = 201 7^16 = 601 7^20 = 001 7^24 = 401 7^28 = 801 and so on ... -> when number in base n is divided by n -1 . then their cube always ends in 24 -> Numbers ending with 49 and 99. and find the difference between the sum of alternate terms.is divisible by 1+2+3+4. 123456789 (789+123-456 )/7 would give u the same reminder -> Sum of square of 12 consecutive odd numbers is S = 48k² + 572 -> 1^p+2^p. the divisiblity rule is sum of number should be divisible by n -1 -> In any base 'n' last digit is always the remainder when the number is divided by n. then form pairs of 3 from the right side.

. where B" = {number of ways in which N can be written as product of two factors} ..+k)^n = n!/(p!*q!*r!) -> Suppose we have to find the number of ways in which an ordered pair (a. where B' = {no of odd factors of (N/2)} . where a and b are natural numbers. 1) is 2 and f(3... b) to (0.. form triplets and add all these triplets.1 . 1) is 1 because the line joining (1.. when u divide any term with the common difference remainder is first term!! > -> In how many ways can a number be written as a sum of ‘n’ consecutive natural numbers. Similarly f(2...schwarz inequality: (a^2 + b^2)(x^2+y^2) >= (ax+by)^2 (x1² + x2² + x3²)(y1² + y2² + y3²) ≥ (x1y1 + x2y2 + x3y3)² -> x^4 + y^4 + z^4 = (x² + y² + z²)² .. the number of ways in which N can be written as sum of n consecutive positive odd integers is B''... b) be the number of cells that the line joining (a.. (When N is odd) B" = {number of ways in which (N/4) can be written as product of two factors} .. divide this by 999 to obtain remainder . -> For a quadratic equation of the form ax^3 + bx^2 + cx + d. Let f(a. 2*3^((n-1)/2) and for even 3^(n/2) -> divisibility rule of 999 is : starting from right hand side of number . for odd N it will be zero.. B" = 0 Largest possible value of k for which 3 raise to power 11 is expressible as sum of k consecutive positiv integers for odd numbers . eg . 2) = 4. a and b are natural numbers. (When N is a multiple of 4) For N = 4k + 2. Sum of the roots is -b/a Sum of the roots taken 2 at a time is c/a Product of the roots is -d/a -> Cauchy . . For example f(1. of factors of A)/2 -> In an AP..1 So. can be choosen such that LCM of a and b is (p^x)*(q^y)*(r^z)*.1 . 0) cuts in the region 0 ≤ x ≤ a and 0 ≤ y ≤ b. b). 0) cuts just one cell.2(x²y² + y²z² + z²x²) -> Coef of a^p*b^q*c^r in (a+b+c+..g... 1) and (0. so perfectly divisible .. 123876 --> 123 + 876 = 999 .-> Product of all factors= A ^(No.. n = 1000 1000= 2^3* 5^3 no of ways= (no of odd factors -1)= (3+1)-1= 3 the number of ways in which N can be written as sum of n consecutive positive even integers is B'. where ‘n’ is greater than 1? no of ways= (no of odd factors -1) e.... total number of such ordered pairs = (2x + 1)(2y + 1)(2z + 1).. or HCF = 1 is So.

So. -> Numbers of form (50k ± 12)² ends in 44 -> Numbers of form (500n ± 3 ² will end in 444 -> Number of ways a number can be expressed as diff of perfect square is : (number of factors)/2 45 = 3^2 * 5 (number of factor)/2= 6/2 = 3 . Max value of asinx + bcosx = (a^2+b^2)^1/2 Min value of asinx + bcos = -(a^2+b^2)^1/2 how many pairs of positive integers r there (a.a .y are powers of prime factors of the LCM of the number -> The last non-zero digit of a number N! is LNZ(4^n)*LNZ(2n)! .. Any perfect square when divided by 7 leaves a remainder of 0 or 1 or 2 or 4 Squares of even numbers will be of form 4n -> The digit sum of perfect squares are always 1.b) = a + b .20.)..4. If each term of an infinite GP is equal m times the sum of all the terms that follow it. (for N = 10. then k can take [p/5] + 1 different values for p<= 0 If a.b.. for p > 5..30. then.b) Baye's theorem : P(I/R)=P(R/I)*P(I)/(P(R/I)*P(I)+P(II)P(R/II)+P(R/III)P(R/III) SQUARES : Any perfect square when divided by 4 leaves remainder as either 0 or 1. m*n parallelograms => m+n+2 lines If p! ends with k zeros. 3(a^4+b^4+c^4+d^4)=(a^2+b^2+c^2+d^2)^2 put a.7 or 9.b.. then r (common ratio) = 1/(m+1) If p is prime then any no repeated p-1 times is divisible by p.c value and solve for d .HCF(a..b). the largest number that can not be formed is (ab . where n=N/10 R(n!) = Last Digit of [ 2^a x R(a!) x R(b!) ] ..b) so that their LCM is < a number > Total Cases = (2x+1)(2y+1) where x.. If p is prime. f(a. k^(p-1) mod p = 1 mod p We know that with two coprime numbers a and b.c are distant from point P which is interior to triangle to vertices and d is side of triangle .

. Z(A) is the last non zero digit of N's factorial. for 99 Z(99)=4*Z(19)*Z(9) Now. sum of the squares of the roots of a quadratic equation : (b/a)^2 ..xn)^r. m. Sum of roots = .where n = 5a + b Example: What is the rightmost non-zero digit of 25! ? → R (25!) = Last Digit of [ 2^5 x R (5!) x R (0!) ] → R (25!) = Last Digit of [ 2 x 2 x 1 ] = 4 -> Last two non zero digits of nth multiple of 10 i.. So.1) Product of roots = (-1)ⁿ*Constant term Sum of roots is always -b/a Product of roots is (-1)^n * k/a .. Z(99)=4*2*8=64 The number of ways one can go from P to Q (using the shortest path) is (m+n) C m or (m+n) C n. we get product of roots as c/a With cubic equations we get product of roots as -d/a In general.3(c/a)(b/a) -> For any expansion of the type (x1+x2+x3. the number of terms is given by (n+r-1)C(r-1) -> For a quadratic equation.. where k is constant term. Sum of 1 roots at a time = -b/a ... For Z(19) you can run the method recursively to find out it's 2 Z(9)=8 So. ax^n + b*x^(n-1) + . 6 otherwise Z(x/5)=Smallest Integer <= N/5. where.... So..e.n are number of rows and columns of the grid.. with quadratic equations. Z(B)= 4 if tens digit is odd . (10n)! is LTNZ(44^n)*LTNZ(2n!) or (10*n) = (44)^n * (2n)! The last two non-zero digits of a number N! is Z(A)=Z(B) *Z(x/5) *Z(Unit Digit) Where.2(c/a) sum of the cubes of the roots of a quadratic equation : (b/a)^3 .Coefficient of x^(n .

of circles ) * ( no. When n parallel lines intersect m straight lines .. -> if sides of rectangle are mutually prime.. where 'n' is the number of straight lines Problems on Intersection of Straight lines ..of straight lines) 4. the number of squares cut by diagonal is a+b-1 ..( Triangles that can be formed with all points ) – ( Triangles formed with collinear points ) And the same funda is applied whenever such variations in condition occurs . When n straight lines and m circles intersect each other .) if x. Then no. Circles. they intersect in at most 2 * m * n = 2* ( no. number of positive integral solutions of ax+by+cz=d is equal to coefficient of x^d in (x^a + x^2a + x^3a... which satisfies this will be {factors of C^2}/2 for unordered case..)(1+x^b+ x^2b+. They intersect each other in 2*(mc2) ways = m (m-1)= 2p2 ways 3.. of parallelograms possible = nc2 * mc2= mn (m-1) (n-1)/4 5...... of solution of (a. -> For polygon with sides 'n' (n>5).. If there are m number of circles .... If there are n number of straight lines .. Quadrilaterals Etc Basic Concept Fundas 1.) If an equation is 1/a+1/b=1/c.. They intersect each other in nc2 ways 2. and asked how many triangles it can formed=> The funda for this . then the no...Sum of 2 roots at a time = c/a Sum of 3 roots at a time = -d/a And so on.then....)(x^c+x^2c+.collinear points are given . number of solutions are coefficient of x^d in (1+x^a + x^2a + x^3a.)(1+x^c+x^2c+. -> the hands are at right angles when the lag between them is 15 min.... There is one case when collinear and non.. y and z can take zero value also..... Formation of Points and Formation of Triangles.... the number of triangles which have no side common with any side of the side of the polygon is given by n/6 * (n4)*(n-5) Number of additional lines created through intersection = 1/8 * [ n! / (n-4)!] ..)(x^b+ x^2b+...b)..

04:45 PM . Toughluck2009.803 Join Date: Jan 2010 Location: Bangalore Thanks: 3. 29-03-2012 at 04:47 PM. 0. 0. it has 4 choices. total 16 + 10 = 26 regions contd.. 1. KJS. 0. Estallar12.. (2. So.299 Posts Groans: 5 Groaned at 13 Times in 11 Posts (a) 4 different boll in 3 different beg (b) 4 identical ball in 3 different bag (C)4 different boll in 3identical beg (d)4 identical boll in 3identical beg 1) 4 identical balls in 4 identical bags: (This is easy one) 5 ways: (4. So. So. Last edited by pkaman. 0) => 1 way only (3.. (3. 1. 1. Enceladus. bs0409.) This is based on first case (1) (4. 4^4. (2. c and d are number of balls in each bag. 1. Awaited : IMI Certified PaGaL Re: lulu% .. IMT . b. 0). Circle always gives extra regions which are equal to 2*(number of lines) ** So. 0) or (1. contd.tyagi (#9320) pkaman Converts : Great Lakes. 1. cracker12. 0. 0. meversusme. 0). Permutations & Combinations : how many ways one can put Posts: 2.463 Times in 1.Maxim number of regions given by 'n' lines = 1 + (Sum of all natural numbers till n) So.29-03-2012. 4 choices for each. rodneyrude101..+5) = 16 regions As circle will give 2*5 more regions. gudda1122. 1. 0) => 4C3 ways 3 balls to be grouped can be chosen in 4C3 ways and remaining . Didn't attend : FORE. 0. mudwel. Rejects : IMT ..545 Thanked 3... TAPMI. 0.N. » Quote The Following 14 Users Say Thank You to pkaman For This Useful Post: anjaneyanjan7. chillfactor. 7C3 ways (3) 4 different balls in 4 different bags: (This is also easy one) Each ball can go to one of the 4 bags.G. . jain44 44. 2. 0). coolbrady. 1) (2) 4 identical balls in 4 different bags: (This is also easy one) It is like this: a+b+c+d = 4 where a. So. 5 lines will give 1 + (1+2+. varun. it will be 4*4*4*4. (4) 4 different balls in 4 same bags: (This is calculation bsed.

0) => 4C2 4C2 ways to chose 2 balls and then reaming will be 1 and 1. Speed. Tournament Funda There are 16 teams and they are divided into 2 pools of 8 each. we take care of 2 cases. when a < b We can do a quick test like: 1/2 < 99/100 a/b < (a+n)/(b+n) . 1. 1) => 1 way only Fractions : a/b < (a+n)/(b+n) . The top four . [Assumung that we do -(a+n) and -(b+n) and n being +ve number] Cases also vary for sqaures.. when a > b Quick test: 3/2 > 101/100 .. 2.. So. Actually. Time. # They will meet first time after covering a total distance of 2d # For subsequent meetings they will meet after covering a total distance of 2d. Distance : If the two bodies are moving in opposite direction. 0) => 2 balls can be chosen in 4C2 ways. as we select 2. (1... Each team in a group plays against one another on a round-robin basis. If the two bodies are moving in same direction. n > 0 and a > b or b > a. 6 ways. 0. Cases reverse for -ve numbers. b. at one time. (2. 1. Draws in the competition are not allowed... These are mentioned above in the post. # They will meet first time after covering a total distance of d # For subsequent meetings they will meet after covering a total distance of 2d. But. 1. We should alyways keep in mind cases for a/b when a. 1.. So we can generalize it to be d(2n+1) Similarly. So. So. So we can generalize it to be 2dn. it is better to create such cases on the fly by doing quick test for un-usual formats. at the same time we make one more pair of remaing 2. we can take 4C2/2 = 3 ways.one in 1 way (2.

Round Robin/League Games: Suppose A. Max. In this case it would be (4+3+2+1+0)/5=2. Minimum number of wins required to guarantee qualification in the next round _____? Now. 1. no. of matches. 1 group is consisting of 8 teams. Easiest of the lot.E. Distribute the remaining points equally/ as equal as possible. If top "k" teams are supposed to qualify for the next round then choose top k-1 teams and make them win as many matches as possible. Suppose each of the 8 teams were seeded and we consider the case where a higher seeded team will always win.B.1. In this case consider the mean of first 5 higher seeded teams (7+6+5+4+3)/5=5 So it may be the case that 5 teams can end up having 5 wins each. So each team will play 7 match each.C.2.D. no.teams from each group will qualify for the next round i.4. . Top 2 Qualify for Finals. Minimum number of wins required to qualify for the next round _____? 2. Q2. no. Of the remaining 5 teams just find out the mean of their number of wins.6.5. Q3. the team with better run-rate would be ranked ahead.3. A3. And hence 1 team will miss the second round birth. So the number of wins for the 8 teams would be 7. So 5 teams can end up with 2 wins each and a team with better run rate will qualify with 2 wins.F play each other exactly once. A1. 4 Standard Questions: Q1. i don't know how many of you are aware of the following method. In case of teams having the same number of wins. of matches a team can win and still not qualify. Min. Q4. A2. So minimum number of wins to guarantee a place would be 6. Distribute as equally as possible. If top "k" teams are supposed to qualify then choose top k+1 teams and make them beat every other team then you'll be left with matches between k+1 teams. For minimum number of wins we allow 3 teams to win maximum number of matches.e round 2. But 1 thing I mention in advance that this should take only 30 seconds to solve 1. 2. Min. Find total no. of matches a team must win in order to have a chance of qualifying.0 with highest seeded team winning all and lowest seeded team losing all. of matches a team must win to reach next round undisputed/ guaranteed.

5 4. g udda1122. Usko aadha kar do. dixjatin. mudwel. snaval1. 3 is the first side: 3^2=9.log b.12.tyagi » Post Repl y Page 932 of 938 « First < 432 832 882 922 930 931 932 933 934 > Last » « Quant Basics for Zeros in Quant ..Toughluck2009.5+0. A3 + 1 Miscellaneous : a.A4. meversusme.CAT 2012 | . chillfactor. Find the triplet taking y as the smallest side. bs0409.5=12 Triplet is {5.100}. rodneyrude101. then express the number in the form x*y. 9/2=4.5=5 So. Agar kisi even number of smallest side banana hai. cracker12.log c in GP vice versa How to find pythagorean triplets : Kisi bhi odd number. So. aur aadha neeche do values aengi.4.b. 25/2=12. ka square nikalo. Eventually multiply all the three sides by x. triplet is {3.5-0. hamare triplets hain {28..5=4 4.5 12.» Posting Rules Forum Jump . Ye do values. fungus.5+0.5 upar.. Enceladus. Aadhe se 0. and y is an odd number.c in AP log a. 28=4*7 7 ke saath triplets aate hain: 24 aur 25.5} 5: 5^2=25.96.5-0. HOPE IT HELPS !!! » Quote The Following 17 Users Say Thank You to pkaman For This Useful Post: anjaneyanjan7. aur a pythogorean triplets hain. where x is a power of 2.a.5=13 12.13} and so on. Example: 28 needs to be the smallest side. Estallar12. jain4444. example lo ye. varun. coolbrady. let these be b and c.

You You You You may may may may not not not not post new threads post replies post attachments edit your posts Quantitative Questions and Answ ers Go BB code is On Smilies are On [IMG] code is On HTML code is Off Trackbacks are On Pingbacks are On Refbacks are Off Forum Rules .

- Fg 200103
- fS
- 4024_s10_qp_12
- Coordinate Geometry
- myver
- Building Graphics Lab Manual
- Prelim 1998 2002
- Circles
- A dual to a BMO problem
- Circle - For Class 9
- Circle
- 10-1 Circles and Circumference
- chapter1-8reflections
- Book 2 Problems
- Generalized Tucker Circles
- SSLC Maths-E Handbook Formulae 15-19
- finalpow22015
- Cat 2009 QuantTest 116
- Constructing Geometric Ornamental Systems<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> <HTML><HEAD><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1"> <TITLE>ERROR
- Isogonal
- aquaponics final proposal
- trial 1 gr 9 2014-2015 lda
- - Viii Maths.pdf (Revised)
- MATHEMATICS V LP 1ST TO 4TH GRADING.......docx
- Howtolie
- long term plan jhu portfolio
- B107B107M-13 Standard Specification for Magnesium-Alloy Extruded Bars, Rods, Profiles, Tubes, And Wire
- Midterm Review Packet Problems Without Answers
- 2011 Wenona Assessment Test 2 Exam (Algebra)
- CPrgmAssignPro1

- Bin_sear
- proposed roads to freedom.pdf
- demystifying-financial-derivatives.pdf
- virus using C.docx
- crack_the_interview.pdf
- Essential Skills.pdf
- Options, Futures and Other Derivatives 7th John Hull.pdf
- Virus Using C
- Gain Experience.pdf
- Workbook 1
- Sample Questions
- 30 Days to a More Powerful Vocabulary_0671530313
- Hacker's Dictionary
- Demand Forecasting
- IBM-JD
- eigrp-pdf
- Transformation Doc

Close Dialog## Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

Loading