Official Quant thread for CAT 2013

lets hit the next question... @Dexian @scrabbler xam mein itna time ni desakte iss question ko.

@Dexian said:
S will start at 193.........193 is S AI C H NS AI .......... :6S C .......... :6S H ........... :6S IA C H N :1 =211is it ok??
S C .... 12 since AI H N or IA H N
S H ditto.

So 223 isse bhi...

regards
scrabbler


@Dexian
Wont this be
S C .......... :3! *2!=12
S H ........... :3!*2!=12


@scrabbler said:
S C .... 12 since AI H N or IA H NS H ditto.So 223 isse bhi...regardsscrabbler
u r right as always........
@Adiflexs007 said:
@DexianWont this be S C .......... :3! *2!=12S H ........... :3!*2!=12
arey haan re ......... optionmatch karane ke liye main v na ......... kuchh v kar raha humm...
How many 5 digit numbers exist, sum of whose digits is an odd number?
1. 3000
2. 9000
3. 4500
4. 3300

@Dexian said:
How many 5 digit numbers exist, sum of whose digits is an odd number?1. 30002. 90003. 45004. 3300
total number of 5 digit numbers = 90*10^3

half of these have even sum of digits -> 45000 numbers...
@Dexian said:
How many 5 digit numbers exist, sum of whose digits is an odd number?1. 30002. 90003. 45004. 3300
9*10*10*10/2 = 4500 ?
@Dexian said:
How many 5 digit numbers exist, sum of whose digits is an odd number?1. 30002. 90003. 45004. 3300
5 digit or 4 digit?

regards
scrabbler

@scrabbler said:
5 digit or 4 digit?regardsscrabbler
5

4500 hai shayad..@Dexian

@scrabbler said:
5 digit or 4 digit?regardsscrabbler
@Dexian said:
5
bhai 5 digit a 45000 ayega na....4 digit honge....ya option mein ek 0 kamm hai...jo bhi hai, the concept is total numbers/2 (as we have equal number of even and odd sum of digits wale number)...
@Logrhythm said:
bhai 5 digit a 45000 ayega na....4 digit honge....ya option mein ek 0 kamm hai...jo bhi hai, the concept is total numbers/2 (as we have equal number of even and odd sum of digits wale number)...
time to sleep............

Q. a person has to select 1 of the 3 capsules . 1 capsule makes his wt inc by 1kg . another one ensures tht the weight doesnt change . the third one makes him gain 2kg n also compels him to select one of the three capsules once again- all similar to the first set of three capsules . the person has no way of identifying the capsules beforehand n is equally likely to take any of the three capsules at any stage . find the xpectd gain in weight ??


soln needed plz
@Abir1103 said:
Q. a person has to select 1 of the 3 capsules . 1 capsule makes his wt inc by 1kg . another one ensures tht the weight doesnt change . the third one makes him gain 2kg n also compels him to select one of the three capsules once again- all similar to the first set of three capsules . the person has no way of identifying the capsules beforehand n is equally likely to take any of the three capsules at any stage . find the xpectd gain in weight ??soln needed plz
For some reason getting 1.5.

still thinking...

regards
scrabbler
@Logrhythm said:
the farthest point from the circle is that point where the tangent touches it... (by this method we get both, the max and the min value)(x-3)^2 + (y+2)^2 = 3^2 is our equation of the circle with center at (3,-2) and radius = 3using distance from center = radius|{3*3 + 4*(-2) - k}|/rt(3^2+4^2) = 3+/- (1-k) = 1514 =hence max is 16....or by cauchy inequality..we have (x-3)^2 + (y+2)^2 = 9{(x-3)^2 + (y+2)^2}(3^2+4^2) >= (3(x-3) + 4(y+2))^225(x^2+y^2-(6x-4y-4)+9) >= (3x+4y-17)^225(x^2+y^2-(x^2+y^2)+9) >= (3x+4y-1)^225*9 >= (3x+4y-1)^23x+4y-1 =3x+4y =copied from one of my previous posts...
Logrhythm I am impressed :)

This is exactly how the official solution of this problem looked like (using both the methods), when it first appeared in QQAD 2006 NL. So you can pat on your back for that.

Most of you guys got this one correct. This is encouraging :)

Solve the next one:

How many integer solutions exist for (k,n), if n(3n-1)=k^2?
@Abir1103 said:
Q. a person has to select 1 of the 3 capsules . 1 capsule makes his wt inc by 1kg . another one ensures tht the weight doesnt change . the third one makes him gain 2kg n also compels him to select one of the three capsules once again- all similar to the first set of three capsules . the person has no way of identifying the capsules beforehand n is equally likely to take any of the three capsules at any stage . find the xpectd gain in weight ??soln needed plz
Expected weight gain = (1/3)*1 + (1/3)*0 + (1/9)*3 + (1/9)*2 + (1/27)*5 + (1/27)*4 + ...

E = (1/3 + 3/9 + 5/27 + .....) + (2/9 + 4/27 + ...)
=> E/3 = (1/9 + 3/27 + ..............) + (2/27 + 4/81 + ...)

Subtract to get
2E/3 = (1/3) + (2/9 + 2/27 + 2/81 + ....) + (2/9 + 2/27 + 2/81 + ..)
= 1/3 + 2*(2/9)/(1 - 1/3) = 1

E = 1.5
@bodhi_vriksha said:

Solve the next one:How many integer solutions exist for (k,n), if n(3n-1)=k^2?
n(3n - 1) is a perfect sq

We know that n and (3n - 1) are co-prime to each other as 3(n) - (3n - 1) = 1

So, we can say that for n(3n - 1) to be a perfect sq, both n and (3n - 1) has to be perfect squares, but (3n - 1) can never be a perfect square.

Hence no such (k, n) are possible except (0, 0)
@bodhi_vriksha said:
Logrhythm I am impressed This is exactly how the official solution of this problem looked like (using both the methods), when it first appeared in QQAD 2006 NL. So you can pat on your back for that. Most of you guys got this one correct. This is encouraging Solve the next one:How many integer solutions exist for (k,n), if n(3n-1)=k^2?
0 ?
@bodhi_vriksha said:
Logrhythm I am impressed This is exactly how the official solution of this problem looked like (using both the methods), when it first appeared in QQAD 2006 NL. So you can pat on your back for that. Most of you guys got this one correct. This is encouraging Solve the next one:How many integer solutions exist for (k,n), if n(3n-1)=k^2?
1..
@Narci said:
1..
How?