SUBSET| GEOMETRICAL| SELECTING 0 OR MORE(PROBLEM SOLVING SESSION)

SUBSET, GEOMETRICAL, SELECTING 0 OR MORE

PROBLEM SOLVING SESSION(CONIC SECTION)

Geometrical Problems OF Maximum and Minimum

Geometrical Problem OF Maximum and Minimum

Maximising nCr || Geometrical problems || Chessboard Problem || Divisibility Problems

Illustrations Based on Geometrical Problems OF Tangent and Normal and Approximation

Geometrical Problems

Geometrical Problems

Maximising n C r || Geometrical problems|| Chessboard Problem||Divisibility Problems

A and B try to solve the problem independently. The probability that A solves the problem is (1)/(2) and that B solves the problem is (1)/(3) . Find the probability that : (a) Both of them solve the problem (b) The problem is solved.