CSAT Solved Papers/ 2025/Q15

2025 CSAT — Q15

Quant Counting & combinatorics 2.5 marks Hard

A solid cube is painted yellow on all its faces. The cube is then cut into 6060 smaller but equal pieces by making the minimum number of cuts. Which of the following statements is/are correct?

I. The minimum number of cuts is 99.

II. The number of smaller pieces which are not painted on any face is 66.

Select the correct answer using the code given below:

  1. A I only
  2. B II only
  3. C Both I and II Answer
  4. D Neither I nor II

Worked rationale

To split a cube into a×b×ca \times b \times c equal cuboidal pieces you slice along the three directions: a1a-1, b1b-1, c1c-1 cuts (parallel cuts in one direction can be made together, but the count of cuts is (a1)+(b1)+(c1)(a-1)+(b-1)+(c-1)). With abc=60abc = 60, minimise

cuts=(a+b+c)3.\text{cuts} = (a+b+c) - 3.

Sum a+b+ca+b+c is smallest when the three factors are as close together as possible. The factorisation of 6060 into three nearest factors is 3×4×53 \times 4 \times 5 (sum 1212); any other, e.g. 2×5×62 \times 5 \times 6 (sum 1313) or 2×3×102 \times 3 \times 10 (sum 1515), is larger.

minimum cuts=(3+4+5)3=9.Statement I is correct.\text{minimum cuts} = (3+4+5) - 3 = 9. \quad \textbf{Statement I is correct.}

Unpainted pieces are the inner block stripped of the outer shell: (a2)(b2)(c2)(a-2)(b-2)(c-2). With 3×4×53\times4\times5:

(32)(42)(52)=1×2×3=6.Statement II is correct.(3-2)(4-2)(5-2) = 1 \times 2 \times 3 = 6. \quad \textbf{Statement II is correct.}

Answer: (c) Both I and II.

Visual solution

The same solve, worked by hand — read it, then trace it.

Hand-drawn worked solution for UPSC 2025 CSAT Q15 — Counting & combinatorics
Tap the drawing to open it full size for the fine detail.

Why the other options miss

  • A
    an arithmetic slip on the inner block: gets the 3×4×53\times4\times5 split and 99 cuts but botches the inner block (e.g. computes 1×1×3=31\times1\times3 = 3, mis-subtracting), so rejects II.
  • B
    wrong cut count: counts 66 unpainted but uses cuts =a+b+c=12= a+b+c = 12 (or some other count), so rejects the "99" in I.
  • D
    uses a non-minimal split: picks a non-minimal factorisation (e.g. 2×5×62\times5\times6, 1111 cuts, inner 0×3×4=00\times3\times4 = 0) and finds both statements false.

Specialist insight

Two facts carry this template. First, minimum cuts ⇔ factors closest together: for a fixed product, a+b+ca+b+c is minimised when a,b,ca,b,c are near-equal, so always reach for the “middle” factorisation (3,4,53,4,5 for 6060). Second, the unpainted core is (a2)(b2)(c2)(a-2)(b-2)(c-2) — peel one layer off each face. The dangerous slip is using a dimension that is too thin: a side of length 11 contributes (12)=1(1-2) = -1, which is not a piece — but with 3,4,53,4,5 the smallest side is 33, so (32)=1(3-2)=1 is a genuine single inner layer. Here both numbers land cleanly, and checking the inner block confirms the chosen factorisation was the minimal one.

The trap, in one line

Minimum cuts use the closest factor triple (3×4×53\times4\times5, so 99 cuts), and the unpainted core is (a2)(b2)(c2)=123=6(a-2)(b-2)(c-2) = 1\cdot2\cdot3 = 6 — both statements hold.

← All 2025 CSAT questions