"There are five cities in a state and each of them is to be connected to exactly two other cities using telephone lines. In how many ways can it be done?"
Suppose a1, a2, . . . , an are n positive real numbers with a1a2 . . . an = 1. Then the minimum value of (1 + a1)(1 + a2). . .(1 + an) is (A) 2^n (B) 2^2n (C) 1, (D)None of the above
x2 ā¬ā 3y2 = 1376How many integer solutions exist for the given equation?(a) One (b) Two (c) Four (d) Zero
Plz give answer alongwith explanation.
This could be simplified to the form-
x2/1376-3y2/1376=1
This is analogous to the equation of hyperbola-
x2/a2-y2/b2=1 ;which is having integral solution only if x=a^m and y=b^n,which is not possible for the said values....Hence Zero integral solution is the answer.i am not sure but please tag me in OA.
Explanation: 3y2 = x2 ā 1376 As we can see L.H.S. is definitely a multiple of 3 and in R.H.S. 1376 leaves a remainder of 2 when divided by 3. There are three possibilities for x in R.H.S:
(i) If x is multiple of 3, so is x2, and R.H.S. will leave a remainder of 1 when divided by 3. (ii) If x is of the form 3m + 1, x2 will be of the form 3n + 1 and R.H.S will leave a remainder of 2. m, nāN
(iii) If x is of the form 3m + 2, x2 will be of the form 3n + 1 and R.H.S. will leave a remainder of 2.m, nāN So R.H.S. can never be a multiple of 3, while L.H.S. is always a multiple of 3. Hence no real solution exists.
OA: D) ZeroExplanation: 3y2 = x2 ā 1376As we can see L.H.S. is definitely a multiple of 3 and in R.H.S. 1376 leaves a remainder of 2 when divided by 3.There are three possibilities for x in R.H.S:(i) If x is multiple of 3, so is x2, and R.H.S. will leave a remainder of 1 when divided by 3.(ii) If x is of the form 3m + 1, x2 will be of the form 3n + 1 and R.H.S will leave a remainder of 2. m, nāN(iii) If x is of the form 3m + 2, x2 will be of the form 3n + 1 and R.H.S. will leave a remainder of 2.m, nāN So R.H.S. can never be a multiple of 3, while L.H.S. is always a multiple of 3. Hence no real solution exists. Happy CATing
Function f(x) is a continuous function defined for all real values of x, such that f(x) = 0 only for two distinct real values of x. It is also known thatf(6) + f(8) = 0f(7).f(9) > 0f(6).f(10) 0 and f(1) 0III. f(7).f(8) 0(a) 1 (b) 2 (c) 3 (d) 4Plz give answer alongwith explanation.
Answer: b
Explanation:from above given situation,we can derive the result that the graph touches x-axis at two points-
and other observations are-
f(0)>0
f(1)
f(2)
f(3)
f(4)
f(5)
f(6)
f(7)>0
f(8)>0
f(9)>0
f(10)>0
So,option I and II are correct,III is definitely wrong and we cann,t comment on the sitaution of IV.
Altogether,we have 2 correct solutions.Please tag me in OA
bhai frm whr do u get such ques for which u guys dnt hv an answer... anyway...took a random equation and checked...take equation |x|^3 + |x|^2 - |x| + 1 = 0 would have no solution...hence my take is 0...
it is given that 18th tap fills the tank in 2 minutes. Lets say its rate =2^aso total capacity of the tank = 2^(a+1)now this means that tank 1 to 17 will take a time of 4 minutesso tank 1 to 16 will take a time of 8 minutestank 1 to 15 will take a time of 16 minutestank 1 to 14 will take a time of 32 mintuesso pipe 15 takes 16 minutesoptions me nahi hai
let first tap's rate be ksum till second tap = 2k, rate of 2nd tap = 2ksum till third = 3k, rate = 6ksum till fourth = 9k , rate = 18kso the rates are in GP, with ratio = 3..=> 18th tap = 2k(3)^(18-2) 2k(3)^16 = 1/2=> k = 1/{4(3)^16}15th tap = 2k(3)^13 = 2(3)^13/4(3)^16 = 1/2(3)^3since rate = 1/timehence time = 2(3)^3 = 54 minutes??
sum till second tap = 2k kaisa?? only k is ther before that na?? and in the question it is given that sum of 1 to (n-1)