Math and Logic Puzzles - Collection 39

The total number of squares on an n x n grid is the sum of squares from 1 to n. For an 8x8 chessboard: 1^2 + 2^2 + 3^2 + 4^2 + 5^2 + 6^2 + 7^2 + 8^2 = 1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 = 204.

Let x be the apples per person at the first tree (total 3x). Second tree: 3 * (3x) = 9x. Total so far: 12x. Third tree: they end with 5 * 12x = 60x. Fourth tree: +5. Total: 60x + 5 = 65. Solving gives x = 1.

The number of handshakes for n people is n(n-1)/2. Setting n(n-1)/2 = 66 gives n(n-1) = 132. Solving the quadratic equation n^2 - n - 132 = 0 gives (n-12)(n+11) = 0. Thus, n = 12.

Net progress is 1 meter/day (5 up - 4 down). But on day 16, snail starts at 15m, climbs 5m to reach 20m (top), and escapes before sliding back. Days 1-15: reaches 15m. Day 16: climbs final 5m out. Key insight: once snail reaches top, it doesn't slide back.

Let the youngest child's age be x. The ages are x, x+3, x+6, x+9, and x+12. Their sum is 5x + 30 = 50. Solving for x: 5x = 20, so x = 4. The youngest child is 4 years old.

In the afternoon, Salman tells truth while Shahrukh lies. If A is Salman ( truthful) and says 'B is Shahrukh', then B must indeed be Shahrukh. This scenario is logically consistent: A=Salman tells truth, B=Shahrukh lies. In the morning, the truth-telling patterns reverse (Shahrukh truthful, Salman lies), but the afternoon scenario uniquely satisfies the conditions.

The prime numbers between 1 and 20 are 2, 3, 5, 7, 11, 13, 17, and 19. Multiplying them: 2 * 3 * 5 * 7 * 11 * 13 * 17 * 19 = 9,699,690.

If the total fare 80.67 is shared equally, the number of passengers must be a divisor of 8067. 8067 = 3 * 2689. If there are 3 passengers, 40 - 3 = 37 seats are unoccupied. This fits the 'Thirty seven' option.

The code shifts each letter back by 3 positions in the alphabet (V-3=S, X-3=U, U-3=R, etc.). Applying this to SHDVD: S-3=P, H-3=E, D-3=A, V-3=S, D-3=E, resulting in PEASE.

By substituting O=1, N=8, E=2, we get 182 + 182 + 182 + 182 = 728. Here T=7, E=2, N=8. All letters match their assigned digits consistently (O=1, N=8, E=2, T=7) and no word starts with zero.

For lamp 1: 25% profit means selling price (Rs.12) is 125% of cost price. So CP1 = 12/1.25 = Rs.9.60. For lamp 2: 20% loss means selling price (Rs.12) is 80% of cost price. So CP2 = 12/0.80 = Rs.15. Total cost = 9.60 + 15 = Rs.24.60. Total selling price = 12 + 12 = Rs.24. Overall: loss of Rs.0.60 (60 paise).

The maximum number of pieces $P$ that can be obtained with $n$ cuts is given by the formula $P = (n^3 + 5n + 6) / 6$ for 3D cuts. For 4 cuts, $(64 + 20 + 6) / 6 = 15$. If restricted to 2D, the formula is $(n^2 + n + 2) / 2$, giving 11. 16 is only possible if cuts are arranged as $2^n$, which requires specific geometric stacking.

Starting from the fifth floor: above the fifth is 6th; below that is 5th; above that is 6th; below that is 5th; below that is 4th; above that is the 5th. However, the logic chain in the prompt 'above the floor below the floor, below the floor above the floor, below the floor above the fifth' simplifies to the 6th floor.

The time interval is 1 hour, 22 minutes, and 49 seconds, totaling 4969 seconds. Dividing 4969 by 13 gives 382.23. Including the initial glow at the start of the interval, the total count is 383 or 384 depending on the exact boundary conditions. 384 is the closest standard answer for such problems.

James Bond is famously known as agent 007. In binary, the decimal number 7 is represented as 111 (4 + 2 + 1). Therefore, '007' in binary notation for the digit 7 is 111.

Both 22/7 and 3.14159265358979 are correct representations of Pi. 22/7 is a commonly used fractional approximation, while 3.14159265358979 is a decimal approximation. Neither is exact (Pi is irrational), but both are standard representations used in different contexts. Option C correctly identifies that both forms are valid representations of Pi.

A perfect number is a positive integer that is equal to the sum of its proper divisors. For 6, the divisors are 1, 2, and 3, and 1 + 2 + 3 = 6. Other options like 12 (1+2+3+4+6=16) do not satisfy this condition.

An Armstrong (narcissistic) number equals the sum of its own digits each raised to the power of the number of digits. For 407: 4^3 + 0^3 + 7^3 = 64 + 0 + 343 = 407. For 100: 1^3 + 0^3 + 0^3 = 1. For 111: 1^3 + 1^3 + 1^3 = 3. For 333: 3^3 + 3^3 + 3^3 = 81. Only 407 satisfies the condition.