Official Quant thread for CAT 2013

@milestogo3 said:
Lcm(x,y).Lcm (y,z) . Lcm(z,x) = xyz gcd(x,y,z)none of x, y, z is an integer multiple of any other of x, y, z, find the minimum possible value of x + y + z
@krum said:
11/36
@rkshtsurana said:
options/?
x = p^2 q r
y = p q^2 r
z = p q r ^2

now as we need minimum number...lets have 3 minimum prime numbers...
p = 2 , q =3 , r =5

x = 60
y = 90
z = 150

so x +y +z = 300.
@rkshtsurana said:
none of thesemax when tile is of 3x2 so tile required = 24 x36 = 864min when tie is of 36x24 so tile required = 3 x2 = 6858
bhai minimum kaise determine kiya.. koi eqn ya funda batao..
@catter2011 said:
Data sufficiency: What is a two digit number?I. Sum of the digits of the number is 8.II. Difference of the digits of the number is 2.
cant say
@catter2011 said:
bhai minimum kaise determine kiya.. koi eqn ya funda batao..
jo max me , no of tiles aa rhi thi ussi se derive kr liya ...
@catter2011 said:
A square field of size 72 —72 is to be covered by rectangular tiles (with integral edges) with length to breadth ratio is 3 : 2. What is the difference between minimum and maximum number of tiles used?(A) 864 (B) 210 (C) 426 (D) 860 (E) None of these
858 ?
@catter2011 said:
A square field of size 72 —72 is to be covered by rectangular tiles (with integral edges) with length to breadth ratio is 3 : 2. What is the difference between minimum and maximum number of tiles used?(A) 864 (B) 210 (C) 426 (D) 860 (E) None of these
Sides of rectangle tiles = 3x and 2x

If we need to cover totally => Number of tiles required = 72*72 / (3x*2x) = 144*6/(x^2)

Number of tiles in an integer => For minimum , x = 12 and for maximum, x = 1
-> Minimum tiles = 6 , Maximum Tiles = 144*6 = 864

-> Difference = 864-6 = 858 ?
@rkshtsurana said:
jo max me , no of tiles aa rhi thi ussi se derive kr liya ...
haan sahi approach
@soham2208 said:
Sides of rectangle tiles = 3x and 2xIf we need to cover totally => Number of tiles required = 72*72 / (3x*2x) = 144*6/(x^2) Number of tiles in an integer => For minimum , x = 12 and for maximum, x = 1-> Minimum tiles = 6 , Maximum Tiles = 144*6 = 864-> Difference = 864-6 = 858 ?
yes NONE is da answer its 858
the measure of interior angles of convex hexagon are in increasing AP. How many such sequences are possible if hexagon is not equiangular and all the angle degree measure are positive integers less than 150 ?
In a certain code language, STRAIGHT is coded as SIFJZSST, then how CIRCULAR will be coded in the same code language?
@rkshtsurana said:
the measure of interior angles of convex hexagon are in increasing AP. How many such seuences are possible if hexagon is not equiangular and all the angle degree measure are positive integers less than 150 ?


6/2(2a+5d)=180*4
=>2a+5d=240

a=(240-5d)/2

given a+5d
a=120-5d/2
=>d is even

==>120-5d/2+5d==>120+5d/2==>d==>d
so 5 ?
If 'horse is black' is coded as %@$, 'horse in field' is coded as #%& and 'black board field' is coded as $&*, then what is the code for 'board is black'?

A) *@$ (B) $*% (C) &@$ (D) #%& (E) None of these
@rkshtsurana said:
the measure of interior angles of convex hexagon are in increasing AP. How many such seuences are possible if hexagon is not equiangular and all the angle degree measure are positive integers less than 150 ?
Let the least exterior angle be (A), A > 30

Sum of exterior angles = 360

[(2*A+ 5*d)/2]*6 = 360, where d > 0 (as unequal angles)
=> 2A + 5d = 120 ----(1)

d = even, as A has to be an integer
=> d = 2,4,6,8,10 [12 onwards, A is less than or equal to 30]

5 such sequences possible ?
@catter2011 said:
If 'horse is black' is coded as %@$, 'horse in field' is coded as #%& and 'black board field' is coded as $&*, then what is the code for 'board is black'?
horse - %
black - $
is - @
field - &
board - *

board is black - $@*
horse is black' %@$,
'horse in field #%&
'black board field' $&*,
'board is black *@$
@rkshtsurana said:
the measure of interior angles of convex hexagon are in increasing AP. How many such sequences are possible if hexagon is not equiangular and all the angle degree measure are positive integers less than 150 ?
5
In a set of 7 positive distinct numbers, both mean and median is 30. Find the largest no. this set can contain ?
@catter2011 said:
If 'horse is black' is coded as %@$, 'horse in field' is coded as #%& and 'black board field' is coded as $&*, then what is the code for 'board is black'?A) *@$ (B) $*% (C) &@$ (D) #%& (E) None of these
a??
@Brooklyn said:
a??
yes a)
@rkshtsurana said:
In a set of 7 positive distinct numbers, both mean and median is 30. Find the largest no. this set can contain ?
Mean = 30 => Sum of seven numbers = 210

Middle number = 30

a,b,c,30,d,e,f -> Sum of rest 6 = 180

For the largest number and satisfying all other conditions => a = 1, b =2,c =3, d = 31, e = 32

f = 210- 99 = 111 ?