Quant Boosters  Sibanand Pattnaik  Set 2

2C^2 = A^2 +B^2
=> C^2  A^2 = B^2  C^2
=>(C  A) * (C + A) = (BC) * (B+C)
Now Let (BC) = X/Y * (CA) , (1)
Then , (B+C) = Y/X * (C+A) (2)
GCD (X,Y) = 1
this way we get to 169

Q2) E = x  1 + 2x  1 + 3x  1 + 4x  1 + ... + 19x  1 + 20x  1 attain a minimum value
a) 1/10
b) 1/12
c) 1/14
d) 1/16 (Credits  Test Funda)

E = 1x  1 + 2x  1/2 + 3x  1/3 + ... + 20x  1/20
All zeros occur at 1/n (n is a natural number less than 20)
Let say minimum of E occurs at x = 1/t
This is analogous to considering that there are 1 + 2 + 3 ... + 20 = 210 points on the number line. We need to select a point such that the sum of the distances of this point from all the 210 point will be a minimum. Thus, we need to take the median of these 210 points. i.e, any point between 105th point and 106th point. If we move to the left on the 105th point or to the right of the 106th point, the sum of the distances will increase.
Now the 105th point will be 1 + 2 + 3 + ... + 14 = 105
Thus the 105th point is 1/14 and the 106th point is 1/15. The expression, E will be minimum if we take x as any of these two values. i.e, at x = 1/14 or x = 1/15 (or any value in between)
Here, answer is 1/14

Q3) Solve for x if (x  1/x)^1/2 + (1  1/x)^1/2 = x

Domain x  1/x > = 0,
1  1/x > = 0, x > 0
So (x  1)/x > = 0 , (x^2  1)/x > 0
x > = 1 is Domain.
now squaring twice n simplifying
Replace x  1/x = t
t^2 + 2 = x^2 + 1/x^2 so
t^2 + 2  2t  1 = t^2  2t + 1 = (t1)^2 = 0
So t = 1, x1/x = 1
x^2  1 = x, x^2  x  1 = 0
x = ( 1 + root(5))/2

Q4) what is the coefficient of a^204 in (a1)(a^2  2) (a^3 3)....(a^20 20)

Max power of "a" in the expression = 1+2+3+4+.....+20 = (20 * 21 )/2 = 210
To get coefficient of a^204 we have to find the constant term of expression having power a^6 or remove factors of a^6" , which are (x^11) * (x^55)" product of constant term = 5
 (x^22) * (x^44)" product of constant term = 8
 (x^11)" (x^22)" (x^33)" product of constant term = 6
 (x^6  6) * 1 .. product of constant terms = 6
so your required coefficient = 5 + 8  6  6 = 1

Q5) How many 5 digit numbers are there whose sum of digits is 12 ?

a + b + c + d + e = 12
now a should be atleast 1
(x+1) + b + c + d + e = 12
=> x + b + c + d + e = 11 so 15c4 casesnow remove the cases when x > = 9
so, (x + 9) + b + c + d + e = 11
=> x + b + c + d + e = 2 i.e 6c4 casesand when b, c , d , e > = 10 , we have to remove those cases as well .. isn't it ?
so , x + (b+10) + c + d + e = 11
=> x + b + c + d + e = 1 i.e 5c4 casesRequired numbers = 15c4  4 * 5c4  6c4
= 1365  20  15
= 1365  35
= 1330

Q6) There are exactly 2005 ordered pairs (x, y) of positive integers satisfying 1/x + 1/y = 1/N. Find the number of digits in smallest possible value of N if N is a natural number.

2005 = 5 * 401
N=a^p * b^q
N^2 = a^(2p) * b^(2q)
So (2p + 1)(2q + 1)= 5 * 401
p = 200, q = 2
N = 2^200 * 3^2
[LogN] + 1 = [200log2 + 2log3] + 1 = [61.16] + 1 = 62 digits

Q7) Total no of integral solution for x + y + z = 15 where 1≤ x, y, z ≤ 6

(6  a ) + (6  b) + (6  c) = 15
=> a + b + c = 3
5c2
Total no . of integral solutions = 10Alternate method : Coefficient of x^15 in (x + x^2 + x^3 + ... + x^6)^3
= x^12 in (1  x^6)^3 * (1x)^3
= 14c2  3c1 * 8c2 + 3c2
= 10

Q8) Find the coefficient of x^14 in (x^3 + x^6 + x^9 +...) * (x^2 + x^4 + x^6 + ...) * (x + x^2 + x^3 + ...)

Method  1 :
If you are good in binomial then do it directly. Else you can also think this in these lines. Is this not same as 3x + 2y + z = 14 and is this not same as finding the positive distinct integral solutions of the equation a + b + c = 14? so (13c2  3 * 6)/6 = 10Method 2 :
If you want to solve it by binomial then check below
coefficient of x^14 in (x^3 + x^6 + x^9 + ...) * (x^2 + x^4 + x^6 + ...) * (x + x^2 + x^3 + ...)
= coefficient of x^14  6 (1 + x^3 + x^6 + ...) * (1 + x^2 + x^4 + ...) * (1 + x + x^2 + x^3 + ...)
= coefficient of x^8 in (1 + x^2 + x^3 + x^4 + ... + x^8 +...) * (1 + x^2 + x^3 + x^4 + ... + x^8 + ....)
= 1 + 1 +1 + 1 + 1 + 2 + 1 + 2 = 10

Q9) In how many ways can an amount of rs. 100 be paid exactly using coins of denomination 1,2 and 5 such that atleast one coin of each denomination is used?

Basically the problem is to find +ve integer solutions to A + 2B + 5C = 100
So A + 2B can take values 5 , 15, 25 ,......95
The number of solutions corresponding to this will be 2 + 7 + 12 ... + 47 = 245
Also, A + 2B can be 10 , 20 , 30 ... 90
The number of solutions corresponding to this will be 4 + 9 + 14 ... + 44 = 216
so total = 245 + 216 = 461.

Q10) In how many ways can 2310 be expressed as a product of 3 factors?

2310 = 2 * 3 * 5 * 7 * 11
These 5 primes to be distributed into 3 places.
Total : 3^5 ways , but this is ordered ( arranged) and we need unordered.
We know that any triplet with distinct elements (a,b,c) is arranged in 3! ways, so all the distinct triplets in 3^5 = 243 are arranged in 3! Ways.
Except for one triplet (1, 1, 2310) which is arranged in 3!/2= 3 ways
So remove this from total and we are left with only distinct, is divide by 3! ,
So (3^5  3)/3! , and just add that one case of 1, 1, 2310
So (3^53)/3! + 1 = 41

Q11) How many pairs of positive integers (m, n) satisfy 1/m + 4/n = 1/12. Where n is an odd integer less than 60.