Official Quant thread for CAT 2013

@Logrhythm said:
x=7^ay=7^bz=7^ca+b+c = 11total = 13c2 = 78but when 2 are same -> (0,0,11);(1,1,9);(2,2,7);(3,3,5);(4,4,3);(5,5,1) ->6*3 = 18 => 78-18 = 6060/6 = 10so total cases = 10+6 = 16...
and if i have to find triplets where no two are same cant i do it by distributing 0,1,2 to a,b,c respectively and then finding the number of positive integral solutions? if it can be done kindly show the method as i dont know the formula to find the number of positive integral solutions
@abhishek.2011 said:
1458 just factorize the options
@shattereddream said:
its 1458
ha bhai...realised my mistake...jyada dimag chala diya tha :P

@The_Loser said:
your answer is correct, but I am not getting the right way.why din you pic up entire 7! & 11! as whole. why just only 8,9,10,11. ?
See you have written
a*b = 7!*11!

then you found the no of ways in which 7!*11! can be written as product of two coprime numbers, but a and b are not coprime (there HCF is 7!)

thats why we have to assume a = 7!*m and b = 7!*n, now here m and n are coprime else HCF will be more than 7!

So, (7!*m)*(7!*n) = 7!*11!
=> m*n = 8*9*10*11

Rest will be same as in my last post
@ochapuspita said:
test test.........
hi! ..i think u r new to PG. This thread is for Quant discussions
please dont spam here. Post your query/chat here :
http://www.pagalguy.com/posts/4828213

:)

@ChirpiBird ok, thanks :)

ya an easy one, still fumbling
How to find unit digit of [10^50/69].
[ ] represent greatest integer function

@hiteshkhurana82 said:
ya an easy one, still fumblingHow to find unit digit of [10^50/69].[ ] represent greatest integer function
Is the answer = 2

10^50 mod 69 = 52

So, Last digit in 10^50 - 52 = 8
=> 69K = 10^50 - 52
So, Last digit of K can only be 2

Hence, Unit Digit of [ 10^50/69 ] = 2 ? ..
What is the remainder when 1^2 * 2^3 + 2^2 * 3^3 ..... + 99^2 * 100^3 divided by 36?
@techgeek2050 said:
What is the remainder when 1^2 * 2^3 + 2^2 * 3^3 ..... + 99^2 * 100^3 divided by 36?
is it 8 ...
@hedonistajay said:
is it 8 ...
it's 12
@techgeek2050 said:
What is the remainder when 1^2 * 2^3 + 2^2 * 3^3 ..... + 99^2 * 100^3 divided by 36?
Ummmm... 12 by any chance ??
@techgeek2050 said:
What is the remainder when 1^2 * 2^3 + 2^2 * 3^3 ..... + 99^2 * 100^3 divided by 36?
Consider with 9 and 4.

All terms divisible by 4. So of the form 4k

Also when divided by 9, the terms leave -1, 0, 0, -1, 0, 0....which in 99 terms adds to -33 equiv +3 with 9. So 9m+3 form as well.

1st number satisfying both = 12.

regards
scrabbler

@ScareCrow28 said:
Ummmm... 12 by any chance ??
not sure of the oa. plz share ur approach.
@gautam22 said:
sir ji last baar likh raha hoon 3 values ( 0 , 3 , -1)?????
The two equations can be written as (y-m)^2 = 5m^2 + 4, and (y-2)^2 = 2(m^3 + m +2)

For three different roots either one of the equations should have a double root while the other should not or both the equations should have a common root.

(y-m)^2 = 5m^2 + 4 cannot have double roots as RHS can never be zero.

If the second equation has double root, then (m+1)(m^2 - m + 2) = 0 => m = -1

But if we put m = -1 in the two original equations we get the 2, -4 as roots for the first equation and 2 as double root for the second. Thus, in all we have 2 different roots. Hence, m = -1 is also ruled out.

Also, if both the equations have a common root, then (y^2-2my-4(m^2 + 1)) - (y^2 €“ 4y -2m(m^2 + 1)) = 0
hence, (2m - 4)y = (2m - 4)(m^2 + 1)=> m =2 or y=m^2 + 1

Putting m = 2 in our two quadratic equations we get (m-2)^2 = 24 for both=> we have only 2 different roots.

Putting y = m^2 + 1, we get (m^2 - 1)^2 = 2(m^3 + m + 2) which can be factored as (m+1)(m-3)(m^2 + 1) = 0, hence m = -1 or 3.

But we already neglected m = -1.
So for m=3 we get the equations as y^2-6y-40 = 0, and y^2-4y-60 = 0. The roots of first eq. are 10, -4 and that of second are 10, -6.

So only for m = 3 there are three different roots 10,-4, and -6

Team BV - Vineet
@techgeek2050 said:
What is the remainder when 1^2 * 2^3 + 2^2 * 3^3 ..... + 99^2 * 100^3 divided by 36?
9*4

all terms div by 4. -> 4x
8,0,0,8,0,0,... -> 33*8 = 264 %9 = 3 -> 9y+3

so 12...
@techgeek2050 said:
not sure of the oa. plz share ur approach.
All the numbers are divisible by 4, so we need to check by 9
Now, the numbers of the form (3k+1)^2*(3k+2)^3 will not be divisible by 9. All others are divisible.

(3k+1)^2*(3k+2)^3 mod 9 = (6k+1)*(8)*(33) = (6k+1)(-1)(-3) = 3(6k+1) = 18k + 3

So, remainder by 9 = 3
And, hence by 36 = 3*4 = 12
@techgeek2050 said:
it's 12
are you sure its 12? i think it should be 16
@scrabbler said:
Consider with 9 and 4.All terms divisible by 4. So of the form 4kAlso when divided by 9, the terms leave -1, 0, 0, -1, 0, 0....which in 99 terms adds to -33 equiv +3 with 9. So 9m+3 form as well.1st number satisfying both = 12.regardsscrabbler
bro isko summation wala logic laga ke bhi toh solve kar sakte hai.. you will get (summation)n^2*(n+1)^3 = [n*(n+1)*(2n+1)]/6*[((n+1)*(n+2))/2]^2
@iLoveTorres said:
are you sure its 12? i think it should be 16
see the posts above yours 😃
@iLoveTorres said:
bro isko summation wala logic laga ke bhi toh solve kar sakte hai.. you will get (summation)n^2*(n+1)^3 = [n*(n+1)*(2n+1)]/6*[((n+1)*(n+2))/2]^2
Yahi to galti kardi tumne.. Direct summation formula nahi laga sakte..first you need to open then put summation formulas..