Hi Plz help ..........tried with 5 and 10 manually by drawing getting 5 as answer....:( correct is 3
C(n,r )= n!/r ! (n r )! where n! = n× (n −1)×(n − 2)× × 2×1.
What is the smallest positive integer 'k' such that C(2k, k) is divisible by 200?
(a) 23 (b) 61 (c) 13 (d) 11
Please explain the solution.
If A=(P,Q,R,S,T) and B=(a,b,c) then how many onto functions F:A->B are possible?
Please post solution as well.. Is this same as find the number of ways in which 5 different balls can be put in 3 different boxes such that no box remains empty.. @Dazed-Confused kindly help..What is the number of integer values of x that satisfy the inequality ((1/x-7)+(1/x+3))-7
A positive whole number M less than 100 is represented in base 2 notation, base 3 notation, and base 5 notation. It is found that in all three cases the last digit is 1, while in exactly two out of the three cases the leading digit is 1. Then M equals
Solve the attached question..
A and B start running simultaneously on a circular track from point O in the same direction. If the
ratio of their speeds is 6 : 1 respectively, then how many times is A ahead of B by a quarter of the
length of the track before they meet at O for the first time?
(a) 4 (b) 5 (c) 7 (d) 10
Please explain the solution.
x and y are real numbers such that y = |x – 2| – |2x – 12| + |x – 8|. What is the least possible value
of y?
(a) 6 (b) 2 (c) –2 (d) None of these
Please explain with solution.
A shipping clerk has five boxes of different but unknown weights each weighing less than 100 kgs. The clerk weighs the boxes in pairs. The weights obtained are 110,112, 113, 114, 115, 116, 117, 118, 120 and 121 kgs. What is the weight, in kgs, of the heaviest box?
[1] 60
[2] 62
[3] 64
[4] cannot be determined
pls share ur approach.....
Two people W and X start from two points Y and Z walking towards each others starting points. They meet along the way and then W takes 18mins more while X takes 50mins more to reach their destinations. How much time after starting did they meet??
There are three cities A, B and C. Each of these cities is connected with the other two cities by at least one direct road. If a traveller wants to go from one city (origin) to another city (destination), she can do so either by traversing a road connecting the two cities directly, or by traversing two roads, the first connecting the origin to the third city and the second connecting the third city to the destination. In all there are 33 routes from A to B (including those via C). Similarly there are 23 routes from B to C (including those via A). How many roads are there from A to C directly?
[1] 6
[2] 3
[3] 5
[4] 10
A man tosses a coin and wins a rupee for a head and loses a rupee for a tail. Suppose he tosses once, and quits if he wins, but tries once again if he loses on the first toss, then his expected net gain is
- 0.50
- 0.25
- 1.00
- 0.75
0 voters
Answr pls 1 2 2 3 4 7 15 91 ?...
with explainationRange of |x|/x, x 0 is
1. {– 1, 1}
2. [– 1, 1]
3. R – (– 1, 1)
4. (– 1, 1)
5.R – (– 1, 2)
If f(x) = 1/1-x, then find the value of f[f[f(x)]]
1. x
2. 1 - x
3. 1/1-x
4. 1/x
5. 2x
der s sme money wt ajay n sme wit vijay. if A gives Rs 30 to V, then the amounts wit them wud be interchanged. instead if V gives Rs 20 to A, then A wud hve a money of Rs 70 mor dan dat of V. fnd d amount dat A has.
a)40
b)50
c)70
D)cannot be determined.
explain how?
der are 10 children standng in a line, not all whom hve d same no of chocolates wit them. if the 1st child distributes his chocolates to d remaining 9 children such dat he doubles der respective no of chocolates then he ll be left wit 1 chocolate. if 10th child takes 1 choco 4m each of d remaining 9 then he'll be having 4 choco less dan d no of choco dat 1st child initially had. WHAT IS THE TOTAL NUMBER OF CHOCOLATES THAT ARE THERE WITH THE SECOND CHILD TO THE NINTH CHILD?
A) 10
B) 12
C) 15
D) 16
If f(x) = 3x – 5 and f(g(x)) = 2x, then find the value of g(x).
1. (2x + 5)/3
2. 2x + 5/3
3. 2x – 5/3
4. (2x – 5)/3
5. (5x + 2)/3
If f(x) is a function satisfying f(x + y) = f(x). f(y) for all x, y ∈ N, such that f(1) = 4 and summation of x-1 to n = 340. Then, the value of n is
1. 4
2. 5
3. 6
4. 8
5. 10
A perfectly flexible rope 2 cm in diameter is coiled closely upon the deck of the ship, and there are 140 complete coils. find the length of the rope