Shown below is an arrangement of closely stacked spheres. Assume each one to be in contact with its immediate neighbour. What is the total number of points where the spheres touch each other?
As a check, this approach climbs the stack from the single sphere at the top down to the base. It adds new contacts at each stage, instead of splitting the count into within layer and between layer totals from the start.
The lone sphere at the top has no neighbor beside it, so it starts with \( 0 \) contacts of its own. It rests in the pocket of the \( 4 \) spheres below it, adding \( 4 \) contacts. Those \( 4 \) spheres touch each other along their own square layer for \( 4 \) more contacts. They also rest on the \( 9 \) spheres beneath them, adding \( 4 \times 4 = 16 \) further contacts. The \( 9 \) spheres touch each other for \( 12 \) contacts, and rest on the base layer of \( 16 \) spheres for \( 4 \times 9 = 36 \) contacts. The base layer itself has nothing beneath it, so it only adds its own \( 24 \) internal contacts.
Running the total as the layers are added gives \( 4 + 4 + 16 + 12 + 36 + 24 = 96 \). This matches the count found by working from the bottom up. the answer is 96
The diagram below represents a road network connecting five towns, namely Meeren, Lannisport, Winterfell, Oldtown, and Gulltown. The maximum speed limits along any stretch of road are as shown in the diagram. The straight road that connects Meeren to Gulltown passes through Oldtown. Another straight road, running west to east, connecting Meeren to Winterfell, passes through Lannisport. Further, two straight roads, one from Lannisport to Oldtown and another from Winterfell to Gulltown, are perpendicular to the road joining Meeren to Winterfell, and run from south to north. 
Consider a car always travelling at the maximum permissible speed, and always taking the shortest route. It takes 1 hour to reach Oldtown from Meeren, 2 hours to reach Gulltown from Oldtown, and 45 minutes to reach Winterfell from Gulltown. (For this problem, always consider the shortest route in terms of distance.)
GadRev is a rm that reviews different latest gadgets through a team of four reviewers (R1, R2, R3, and R4). Recently the reviewers reviewed four different tech gadgets (A, B, C, and D) on a scale of 1 to 5 (all integer values) where 1 denotes poor and 5 denotes excellent. These review ratings were then tabulated. However, due to a technical glitch, some of these ratings got deleted. The average rating given by each reviewer, and the average rating given to each gadget were earlier communicated to the team management in a separate email and hence can be useful to retrieve the deleted ratings. The available ratings along with the average ratings are represented in the following table:
In an 8-week course, a professor administered a test at the end of each week. Each of the eight tests was scored out of 4 marks, and a student could only receive a non-negative integer score. Two students, Ravi and Sumana, took the eight tests.
In the first test, Ravi and Sumana scored the same marks. From the second to eighth tests, Ravi scored the exact same non-zero marks. Sumana scored the same marks as Ravi from the fifth test onwards. Ravi’s total marks in the first three tests was the same as Sumana’s total marks in the first two tests. Also, Sumana’s marks in the first test, total marks of the first two tests, and total marks of the eight tests are in a geometric progression.