The equation 2 cot 2x − 3 cot 3x = tan 2x
has
(1) Two solutions in (0, (π/3))
(2) One solution in (0, (π/3))
(3) No solution in (−∞, ∞)
(4) Three solution in (0, π)
The number of integral values of x
which satisfies
(((x − 5)^(10) (x − 13)^(20) (x − 19)^(13) )/((x − 10)^(18) (x − 25)^(19) )) ≥ 0 and
2 ≤ x ≤ 30 are
(1) 23
(2) 24
(3) 25
(4) 26
A glass bulb contains 2.24 L of H_2 and
1.12 L of D_2 at S.T.P. It is connected to
a fully evacuated bulb by a stopcock
with a small opening. The stopcock is
opened for sometime and then closed.
The first bulb now contains 0.1 g of D_2 .
Calculate the percentage composition
by weight of the gases in the second
bulb.
lemme join miss Tawa Tawa here.
It takes 8 painters working at the
same rate ,5 hours to paint a
house.If 6 painters are working at
2/3 the rate of the 8 painters,how
long would it take them to paint
the same house?
30cm^3 of hydrogen at s.t.p combines with 20cm^3 of oxygen to form steam
according to the following equation, 2H_2 (g) + O_2 (g) → 2H_2 O (g).
Calculate the total volume of gaseous mixture at the end of the reaction.
Prove : ∀n ∈ N, n ≥ 2, so ∃ x,y,z ∣
x,y,z ∈ N such that
(4/n) = (1/x) + (1/y) + (1/z)
Example:
choose n = 2
(4/2) = (1/x) + (1/y) + (1/z)
If x = 1 , y = 2 and z = 2, the equa-
tion is correct!
Let a, b, c ∈ R, a ≠ 0, such that a and
4a + 3b + 2c have the same sign. Show
that the equation ax^2 + bx + c = 0 can
not have both roots in the interval
(1, 2).
A river of width d is flowing with speed
u as shown in the figure. John can swim
with maximum speed v relative to the
river and can cross it in shortest time
T. John starts at A. B is the point
directly opposite to A on the other
bank of the river. If t be the time John
takes to reach the opposite bank, match
the situation in the column I to the
possibilities in column II.
Column I
(A) John reaches to the left of B
(B) John reaches to the right of B
(C) John reaches the point B
(D) John drifts along the bank while
minimizing the time
Column II
(p) t = T
(q) t > T
(r) u < v
(s) u > v
N propositions are judged by 2k−1 people.
Each person assigns “true” to
exactly M propositions and “false”
to the other N−M (M ≤ N).
To say a proposition is “approved” means
it is true according to at least k judges.
Find the minimum and maximum numbers
of approved propositions given N, M and k.