
To solve the problem, we need to determine the configuration of the 12 houses and then calculate the maximum possible quoted price for a vacant house in Column-E. We'll follow these steps:
Therefore, the maximum possible quoted price for a vacant house in Column-E, Block YY is Rs. 21 lakhs.
Given: The price for an empty house is either Rs. 10 lakhs if it doesn't have a parking spot or Rs. 12 lakhs if it does.
In Block YY, both E1 and E2 are vacant, and one of them costs 15 lakhs. Let's focus on E1.
For E1:
Neighbor count = 1 (exactly one of D1 or F1 is occupied)
Road adjacency = 0
So, the cost of E1 would be:
$ (10 \text{ or } 12) + 5 \times 0 + 3 \times 1 = 13 \text{ or } 15 $ lakhs.
Since 15 lakhs is the lowest cost for a house in Block YY, E1 must cost 15 lakhs. This implies E1 is the only house in YY with a parking space.
Now, let's calculate the maximum possible price of E2.
E2's base price is 10 lakhs since it cannot have a parking space (only one house in YY, E1, has a parking space).
The road adjacency for E2 is 1, and the maximum neighbor count of E2 will be 2 (both D2 and F2 are occupied, and E1 is vacant).
So, E2's price would be:
$ 10 + 5 \times 1 + 3 \times 2 = 21 $ lakhs.
Hence, the maximum possible price for E2 is 21 lakhs.
Correct Option: (D) 21 lakhs.
A train travels from Station A to Station E, passing through stations B, C, and D, in that order. The train has a seating capacity of 200. A ticket may be booked from any station to any other station ahead on the route, but not to any earlier station. A ticket from one station to another reserves one seat on every intermediate segment of the route. For example, a ticket from B to E reserves a seat in the intermediate segments B– C, C– D, and D–E. The occupancy factor for a segment is the total number of seats reserved in the segment as a percentage of the seating capacity. The total number of seats reserved for any segment cannot exceed 200. The following information is known. 1. Segment C– D had an occupancy factor of 952. Exactly 40 tickets were booked from B to C and 30 tickets were booked from B to E. 3. Among the seats reserved on segment D– E, exactly four-sevenths were from stations before C. 4. The number of tickets booked from A to C was equal to that booked from A to E, and it was higher than that from B to E. 5. No tickets were booked from A to B, from B to D and from D to E. 6. The number of tickets booked for any segment was a multiple of 10.
For any natural number $k$, let $a_k = 3^k$. The smallest natural number $m$ for which \[ (a_1)^1 \times (a_2)^2 \times \dots \times (a_{20})^{20} \;<\; a_{21} \times a_{22} \times \dots \times a_{20+m} \] is: