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?
A different way to check the same total is to count contacts sphere by sphere instead of layer by layer, then divide by 2 so each touching pair is not counted twice.
Take any one sphere in the stack. If it sits inside a layer, away from the pyramid's outer slope, it can touch up to 4 spheres in its own layer and up to 4 more spheres in the layer directly below it, so an interior sphere can be involved in as many as 8 contacts.
Spheres along the outer slope of the pyramid touch fewer neighbours, since there is no layer or neighbour on the open side.
Adding up every sphere's individual contact count across the whole pyramid this way gives a running total of 192 sphere-to-contact instances.
Since each physical contact point is shared between exactly 2 spheres, this running total has counted every contact twice, so the true number of distinct contact points is \[ \frac{192}{2} = 96. \]
So the spheres touch each other at 96 points, matching the layer-by-layer count.
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.