To determine the maximum value of \( k \) such that \( 126! \) is divisible by \( 3^k \), we need to calculate the exponent of \( 3 \) in the prime factorization of \( 126! \). This is done using the formula:
\[ \text{Exponent of } p \text{ in } N! = \left\lfloor \frac{N}{p} \right\rfloor + \left\lfloor \frac{N}{p^2} \right\rfloor + \left\lfloor \frac{N}{p^3} \right\rfloor + \dots \]
Here, \( p = 3 \) and \( N = 126 \). Let’s compute the exponent step by step:
\[ 42 + 14 + 4 + 1 = 61 \]
Thus, the maximum value of \( k \) is 61 (Option B).
The diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect these zones using the least number of bridges. Out of the following options, which one is correct? Note:
In the given figure, PQRS is a square of side 2 cm, and PLMN is a rectangle. The corner \( L \) of the rectangle is on the side \( QR \). Side \( MN \) of the rectangle passes through the corner \( S \) of the square. What is the area (in cm\(^2\)) of the rectangle PLMN? Note: