Step 1: The problem asks for the probability that two randomly chosen smallest squares on a chessboard share a side. A standard chessboard consists of \(8 \times 8\) squares, which means there are 64 total small squares.
Step 2: The number of possible pairs of squares is given by \(\binom{64}{2}\).
Step 3: The number of favorable outcomes where two squares have a side in common is based on the number of adjacent squares. Each square has up to 4 adjacent squares (except for the edge squares), and the total number of such adjacent square pairs is fewer than 64, as we are restricted to squares that share a side.
Step 4: By counting the adjacent pairs (both horizontally and vertically) and dividing by the total number of pairs, we obtain the probability \(\frac{1}{18}\).
Four students of class XII are given a problem to solve independently. Their respective chances of solving the problem are: \[ \frac{1}{2},\quad \frac{1}{3},\quad \frac{2}{3},\quad \frac{1}{5} \] Find the probability that at most one of them will solve the problem.
Two persons are competing for a position on the Managing Committee of an organisation. The probabilities that the first and the second person will be appointed are 0.5 and 0.6, respectively. Also, if the first person gets appointed, then the probability of introducing a waste treatment plant is 0.7, and the corresponding probability is 0.4 if the second person gets appointed.
Based on the above information, answer the following