Study guide

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma)

TR-YÖS 2026 — Türkiye Yurt Dışından Öğrenci Kabul Sınavı Exam

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: TR-YÖS Overview, Eligibility & Admissions Strategy

1.1 Current TR-YÖS Identity, Two-Test Blueprint and Admissions 1.2 Candidate Eligibility, Blue Card (Mavi Kart), Dual Citizenship & Registration 1.3 ÖSYM Scoring Mathematics, the 0.5 Raw-Point Rule, 1/4 Penalty & 100-Minute Pacing

2 Chapter 2: Sayısal Yetenek — Number Series, Sequences & Cryptarithmetic

2.1 Linear, Polynomial, Alternating & Recursive Number Series (Sayı Dizileri) 2.2 Number Matrices, Row-Column Operations & Functional Input-Output Tables 2.3 Cryptarithmetic (Harfli İşlemler), Letter-Digit Coding (Şifreler) & Symbolic Operators

3 Chapter 3: Sayısal Yetenek — Visual Series, Analogies & Odd-One-Out

3.1 Figural Series, Angular Rotations, Translations & Element-Counting Rules 3.2 Visual Analogies, Geometric Transformations & Proportion Mapping 3.3 Visual Classification, Topological Invariants & Odd-One-Out (Farklı Olanı Bulma)

4 Chapter 4: Sayısal Yetenek — Visual Matrices, Pattern Completion & Grid Logic

4.1 3x3 Visual Matrices: Superposition, Boolean XOR & Attribute Permutations 4.2 Pattern & Grid Completion (Şekil Tamamlama), Quarter-Tile Symmetry & Tessellations 4.3 Magic Squares, Latin Grids, Sudoku Variants & Relational Matrix Tables

5 Chapter 5: Sayısal Yetenek — 3D Spatial Reasoning: Cubes, Folding & Reflections

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma) 5.2 Cube Nets (Küp Açılımları), Opposite-Face Parities & 3D Die Rotations 5.3 Paper Folding & Hole Punching (Kağıt Katlama-Kesme), Mirror & Water Reflections

6 Chapter 6: Sayısal Yetenek — Balance Scales, Gears, Clocks & Calendar Logic

6.1 Balance Scales (Teraziler), Symbolic Weight Substitution & Inequality Scales 6.2 Meshed Gears (Çarklar), Concentric Pulleys, Belt Directions & Turn Ratios 6.3 Clock Hand Angles (Saat Problemleri), Modular Calendar Arithmetic & Compass Bearings

7 Chapter 7: Sayısal Yetenek — Data Interpretation, Grid Counting & Deductive Logic

7.1 Bar, Line and Pie Charts & Multi-Table Data Interpretation (Tablo ve Grafikler) 7.2 Grid Perimeter, Shaded Area, Sub-Shape Counting & Shortest Lattice Paths 7.3 Deductive Logic, Linear/Circular Seating Arrangements & Truth-Value Puzzles

8 Chapter 8: Temel Matematik — Number Systems, Base Arithmetic, Divisibility & Rationals

8.1 Number Sets, Parity, Consecutive Sums, Factorials & Base-n Arithmetic (Taban Aritmetiği) 8.2 Division Algorithm, Divisibility Rules, Prime Factorization, Divisors, EBOB (GCD) & EKOK (LCM) 8.3 Rational Numbers, Infinite/Telescoping Fractions & Repeating Decimals (Devirli Ondalık Sayılar)

9 Chapter 9: Temel Matematik — Exponents, Radicals, Factoring, Equations & Inequalities

9.1 Exponential Equations (Üslü Sayılar), Nested Radicals & Rationalizing Denominators 9.2 Algebraic Identities (Çarpanlara Ayırma), Sums and Differences of Cubes & Reciprocal Sums 9.3 First-Degree Linear Systems, Simple Inequalities (Basit Eşitsizlikler) & Absolute Value (Mutlak Değer)

10 Chapter 10: Temel Matematik — Ratios, Proportions & Classic Word Problems

10.1 Ratios, Direct/Inverse/Compound Proportions (Oran-Orantı) & Means 10.2 Number, Fraction, Age (Yaş) & Work/Pipe (İşçi-Havuz) Word Problems 10.3 Percentage, Profit-Loss (Kâr-Zarar), Mixture (Karışım) & Motion (Hareket) Problems

11 Chapter 11: Temel Matematik — Sets, Modular Operations, Functions, Polynomials & Quadratics

11.1 Sets (Kümeler), Cartesian Products, Binary Operations (İşlem) & Modular Arithmetic (Modüler Aritmetik) 11.2 Functions (Fonksiyonlar): Domain/Range, Composition, Inverses & Functional Equations 11.3 Polynomials (Polinomlar), Quadratic Equations, Vieta's Formulas & Parabolas

12 Chapter 12: Temel Matematik — Logarithms, Complex Numbers, Combinatorics, Trigonometry & Calculus

12.1 Logarithms (Logaritma), Complex Numbers & Arithmetic/Geometric Sequences (Diziler) 12.2 Permutations, Combinations, Binomial Expansion & Probability (Olasılık) 12.3 Trigonometry and Optional Calculus Enrichment

13 Chapter 13: Temel Matematik (Geometri) — Angles, Triangles, Similarity, Area & Polygons

13.1 Parallel-Line Angle Rules (Z, U, M, Kalem Ucu), Triangle Angles & Triangle Inequality 13.2 Right Triangles, Euclid's Altitude Laws, Angle Bisectors, Medians, Similarity & Area 13.3 Regular Polygons, Quadrilaterals, Parallelograms, Trapezoids, Rhombuses, Rectangles & Squares

14 Chapter 14: Temel Matematik (Geometri) — Circles, 3D Solids & Analytic Geometry

14.1 Circle Angles, Chords, Tangents, Power of a Point (Kuvvet) & Sector/Annulus Area 14.2 3D Solid Geometry (Katı Cisimler): Prisms, Cylinders, Pyramids, Cones & Spheres 14.3 Analytic Geometry (Analitik Geometri): Points, Lines, Slopes, Point-to-Line Distance & Circles

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma)

Key Takeaways Explain This Topic AI

The Column-Height Plan Map (Sütun Yüksekliği Yöntemi) eliminates hidden-block errors by writing the vertical stack height (h = 1, 2, 3, ...) on every exposed top roof square and summing k * n_k.

The Horizontal Floor Slice Method (Katman Yöntemi) counts cubes floor by floor from the ground up; under standard gravity support, any cube on Floor k requires k - 1 hidden supporting cubes directly beneath it.

To complete an existing block stack into an A x B x C rectangular prism (Prizmaya Tamamlama), the exact number of missing unit cubes is (A * B * C) - N_existing.

When an n x n x n cube (n >= 2) is painted on all 6 exterior faces and sliced into n^3 unit cubes, the counts of cubes with 3, 2, 1, and 0 painted faces are 8, 12(n - 2), 6(n - 2)^2, and (n - 2)^3 respectively.

When one exterior face is left unpainted (such as a cube resting on a table), boundary cubes touching that unpainted face lose one painted surface, shifting 4 corners to 2-face, 4 edges to 1-face, and 1 face interior to 0-face.

Last updated: October 2026

5.1 3D Block Stacks, Hidden Cube Counting & Painted Cube Formulas (Küp Sayma)

Cube-counting exercises can ask for occupied blocks, an enclosing prism or painted faces. Hidden space makes a supplied plan or explicit support rule valuable. The methods below count specified structures exactly; a view with insufficient information may require a minimum or maximum rather than a unique total.

1. Method 1 — The Column-Height Plan Map ( Sütun Yüksekliği / Tepe Haritası Yöntemi )

In a standard gravity-supported stack of identical unit cubes ( özdeş birim küpler ), every vertical 1 × 1 1 \times 1 1 × 1 column of stacked blocks has exactly one exposed top roof tile ( üst yatay yüzey ) . A rear column can be entirely concealed. Use a supplied height map, multiple views, or explicit constraints; a single perspective drawing need not determine every hidden column uniquely.

Step-by-Step Procedure

Establish the Ground Reference ( z = 1 z = 1 z = 1 ): Locate the lowest frontmost or outermost cubes resting directly on the base plane. Their top roofs sit at height h = 1 h = 1 h = 1 .

Label Every Exposed Roof Tile with Its Column Height h h h : Step upward from terrace to terrace. Each vertical step up adds + 1 +1 + 1 to the column height ( h = 1 , 2 , 3 , 4 , … h = 1, 2, 3, 4, \dots h = 1 , 2 , 3 , 4 , … ). Write the integer h h h directly inside each visible top roof square on your exam booklet.

Tally by Height and Multiply: If n k n_k n k ​ denotes the number of roof tiles labeled with height k k k , the total number of unit cubes (visible plus hidden) is: N total = ∑ k = 1 h max ⁡ k ⋅ n k = 1 ⋅ n 1 + 2 ⋅ n 2 + 3 ⋅ n 3 + 4 ⋅ n 4 + … N_{\text{total}} = \sum_{k=1}^{h_{\max}} k \cdot n_k = 1 \cdot n_1 + 2 \cdot n_2 + 3 \cdot n_3 + 4 \cdot n_4 + \dots N total ​ = k = 1 ∑ h m a x ​ ​ k ⋅ n k ​ = 1 ⋅ n 1 ​ + 2 ⋅ n 2 ​ + 3 ⋅ n 3 ​ + 4 ⋅ n 4 ​ + …

Counting from a Fully Specified Column Map

Suppose a 3 × 3 3 \times 3 3 × 3 ground footprint has column heights arranged from back-left to front-right as shown in the top-down plan map ( kuşbakışı sütun haritası ) below: [ 4 3 2 3 2 1 2 1 1 ] \begin{bmatrix} 4 & 3 & 2 \\ 3 & 2 & 1 \\ 2 & 1 & 1 \end{bmatrix} ​ 4 3 2 ​ 3 2 1 ​ 2 1 1 ​ ​

A column labeled 4 4 4 in the back-left corner automatically accounts for 1 visible top cube and 3 hidden supporting cubes beneath it ( z = 1 , 2 , 3 z = 1, 2, 3 z = 1 , 2 , 3 ).

Grouping equal numbers gives: one 4 4 4 , two 3 3 3 s, three 2 2 2 s, and three 1 1 1 s: N total = ( 4 × 1 ) + ( 3 × 2 ) + ( 2 × 3 ) + ( 1 × 3 ) = 4 + 6 + 6 + 3 = 19 unit cubes N_{\text{total}} = (4 \times 1) + (3 \times 2) + (2 \times 3) + (1 \times 3) = 4 + 6 + 6 + 3 = 19\text{ unit cubes} N total ​ = ( 4 × 1 ) + ( 3 × 2 ) + ( 2 × 3 ) + ( 1 × 3 ) = 4 + 6 + 6 + 3 = 19 unit cubes

Overhang Exception ( Askıda / Çıkıntılı Küpler ): If a figure explicitly depicts a glued cantilever or bridge where a cube projects outward with empty space underneath it, label that column with the number of actual occupied blocks in that vertical line rather than its top elevation.

2. Method 2 — Horizontal Floor Slice Counting ( Katman / Kat Yöntemi )

When a 3D figure is terraced like a wedding cake or staircase, slicing the solid horizontally into floors ( katlar ) from bottom to top provides an instant cross-check.

Floor 1 ( 1. Kat — Base Footprint): Count the total number of ( x , y ) (x, y) ( x , y ) grid squares covered by the base of the structure. Using the 3 × 3 3 \times 3 3 × 3 matrix above, every cell has h ≥ 1 h \ge 1 h ≥ 1 , so Floor 1 contains F 1 = 9 F_1 = 9 F 1 ​ = 9 cubes.

Floor 2 ( 2. Kat ): Count how many columns reach height h ≥ 2 h \ge 2 h ≥ 2 (or simply subtract the h = 1 h = 1 h = 1 columns from Floor 1: F 2 = F 1 − n 1 F_2 = F_1 - n_1 F 2 ​ = F 1 ​ − n 1 ​ ). Above, three cells have h = 1 h = 1 h = 1 , so F 2 = 9 − 3 = 6 F_2 = 9 - 3 = 6 F 2 ​ = 9 − 3 = 6 cubes.

Floor 3 ( 3. Kat ): Subtract the h = 2 h = 2 h = 2 columns from Floor 2 ( F 3 = F 2 − n 2 F_3 = F_2 - n_2 F 3 ​ = F 2 ​ − n 2 ​ ). Since three cells have h = 2 h = 2 h = 2 , F 3 = 6 − 3 = 3 F_3 = 6 - 3 = 3 F 3 ​ = 6 − 3 = 3 cubes.

Floor 4 ( 4. Kat ): Subtract the h = 3 h = 3 h = 3 columns from Floor 3 ( F 4 = F 3 − n 3 F_4 = F_3 - n_3 F 4 ​ = F 3 ​ − n 3 ​ ). Since two cells have h = 3 h = 3 h = 3 , F 4 = 3 − 2 = 1 F_4 = 3 - 2 = 1 F 4 ​ = 3 − 2 = 1 cube.

Sum the Floor Slices: N total = F 1 + F 2 + F 3 + F 4 = 9 + 6 + 3 + 1 = 19 unit cubes N_{\text{total}} = F_1 + F_2 + F_3 + F_4 = 9 + 6 + 3 + 1 = 19\text{ unit cubes} N total ​ = F 1 ​ + F 2 ​ + F 3 ​ + F 4 ​ = 9 + 6 + 3 + 1 = 19 unit cubes

Under standard gravity support, floor counts must decrease monotonically ( F 1 ≥ F 2 ≥ F 3 ≥ ⋯ ≥ F h max ⁡ F_1 \ge F_2 \ge F_3 \ge \dots \ge F_{h_{\max}} F 1 ​ ≥ F 2 ​ ≥ F 3 ​ ≥ ⋯ ≥ F h m a x ​ ​ ), and the difference between two consecutive floors F k − F k + 1 F_k - F_{k+1} F k ​ − F k + 1 ​ equals n k n_k n k ​ , the exact count of exposed roof tiles at height k k k .

3. Completing a Block Stack to a Prism or Cube ( Prizmaya / Küpe Tamamlama )

Count Existing Cubes ( N existing N_{\text{existing}} N existing ​ ): Use the Column-Height Plan Map to find the exact number of cubes already present.

Measure the Three Maximum Spans ( A , B , C A, B, C A , B , C ):

  • A = x max ⁡ A = x_{\max} A = x m a x ​ (maximum width in unit cubes from left to right)
  • B = y max ⁡ B = y_{\max} B = y m a x ​ (maximum depth in unit cubes from front to back)
  • C = z max ⁡ C = z_{\max} C = z m a x ​ (maximum height in unit cubes from bottom to top)

Apply the Target Volume Formula:

To complete to the minimum enclosing Rectangular Prism ( Dikdörtgenler Prizması ): Missing Cubes = ( A × B × C ) − N existing \text{Missing Cubes} = (A \times B \times C) - N_{\text{existing}} Missing Cubes = ( A × B × C ) − N existing ​

To complete to the minimum enclosing Cube ( En Küçük Küp ): A cube must have equal edge lengths along all three axes, so its side length must equal the largest span, L = max ⁡ ( A , B , C ) L = \max(A, B, C) L = max ( A , B , C ) : Missing Cubes for a Cube = L 3 − N existing , where L = max ⁡ ( A , B , C ) \text{Missing Cubes for a Cube} = L^3 - N_{\text{existing}}, \quad \text{where } L = \max(A, B, C) Missing Cubes for a Cube = L 3 − N existing ​ , where L = max ( A , B , C )

4. Painted Cube & Cuboid Dissection Formulas ( Boyalı Küpler ve Prizmalar )

Suppose a solid n × n × n n \times n \times n n × n × n cube ( n ≥ 2 n \ge 2 n ≥ 2 ) is dipped into paint so that all 6 exterior faces are painted , and is then sliced by 3 ( n − 1 ) 3(n - 1) 3 ( n − 1 ) planes parallel to its faces into n 3 n^3 n 3 unit cubes. Each unit cube's painted-face count depends strictly on its geometric location in the original block:

3 Painted Faces ( 3 Yüzü Boyalı — Corner Cubes / Köşe Küpleri ): Only the cubes sitting at the 8 vertices of the large block touch three exterior faces. Regardless of how large n ≥ 2 n \ge 2 n ≥ 2 is, there are always 8 such cubes.

2 Painted Faces ( 2 Yüzü Boyalı — Edge Cubes / Kenar / Ayrıt Küpleri ): Located along the 12 edges of the cube, excluding the 2 corner cubes at the ends of each edge. Each edge of length n n n contains ( n − 2 ) (n - 2) ( n − 2 ) interior edge cubes, yielding 12 ( n − 2 ) 12(n - 2) 12 ( n − 2 ) cubes.

1 Painted Face ( 1 Yüzü Boyalı — Face-Center Cubes / Yüzey Merkez Küpleri ): Located in the interior of the 6 square faces after peeling off the 1-unit outer border along all four sides of each face. Each face leaves an ( n − 2 ) × ( n − 2 ) (n - 2) \times (n - 2) ( n − 2 ) × ( n − 2 ) inner square, yielding 6 ( n − 2 ) 2 6(n - 2)^2 6 ( n − 2 ) 2 cubes.

0 Painted Faces ( Boyasız — Interior Core Cubes / İç Küpler ): Peeling off the 1-unit painted skin from left/right, front/back, and top/bottom reduces each dimension by 2 2 2 , leaving an unpainted inner cube of dimensions ( n − 2 ) × ( n − 2 ) × ( n − 2 ) (n - 2) \times (n - 2) \times (n - 2) ( n − 2 ) × ( n − 2 ) × ( n − 2 ) , or ( n − 2 ) 3 (n - 2)^3 ( n − 2 ) 3 cubes.

Partial Painting Variant: Cube Resting on an Unpainted Floor (5 Faces Painted)

A classic TR-YÖS twist states: "An n × n × n n \times n \times n n × n × n wooden cube resting on a flat table is spray-painted on all exposed surfaces (5 faces painted, bottom face unpainted) and then cut into n 3 n^3 n 3 unit cubes." Because the bottom face receives no paint, every cube in the bottom layer ( z = 1 z = 1 z = 1 ) loses one painted face compared to the 6-face formula:

3 Painted Faces: Only the 4 top corners meet three painted faces ⟹ 4 \implies 4 ⟹ 4 .

2 Painted Faces: The 4 bottom corners (which touch two painted vertical walls and the unpainted floor) plus the 4 top horizontal edges ( 4 ( n − 2 ) 4(n - 2) 4 ( n − 2 ) ) plus the 4 vertical edges ( 4 ( n − 2 ) 4(n - 2) 4 ( n − 2 ) ) ⟹ 8 ( n − 2 ) + 4 \implies 8(n - 2) + 4 ⟹ 8 ( n − 2 ) + 4 .

1 Painted Face: The 1 top face interior ( ( n − 2 ) 2 (n - 2)^2 ( n − 2 ) 2 ) plus the 4 vertical side face interiors ( 4 ( n − 2 ) 2 4(n - 2)^2 4 ( n − 2 ) 2 ) plus the 4 bottom horizontal edge interiors ( 4 ( n − 2 ) 4(n - 2) 4 ( n − 2 ) , which touch only one vertical painted wall) ⟹ 5 ( n − 2 ) 2 + 4 ( n − 2 ) \implies 5(n - 2)^2 + 4(n - 2) ⟹ 5 ( n − 2 ) 2 + 4 ( n − 2 ) .

0 Painted Faces: The inner core ( n − 2 ) 3 (n - 2)^3 ( n − 2 ) 3 plus the unpainted bottom face interior ( n − 2 ) 2 (n - 2)^2 ( n − 2 ) 2 ⟹ ( n − 2 ) 2 ( n − 1 ) \implies (n - 2)^2(n - 1) ⟹ ( n − 2 ) 2 ( n − 1 ) .

Summary Reference Table: Painted Cube & Cuboid Formulas ( n , a , b , c ≥ 2 n, a, b, c \ge 2 n , a , b , c ≥ 2 )

Painted Faces Category n × n × n n \times n \times n n × n × n Cube (All 6 Faces Painted) a × b × c a \times b \times c a × b × c Cuboid (All 6 Faces Painted) n × n × n n \times n \times n n × n × n Cube on Table (5 Faces Painted)

  • Total Unit Cubes n 3 n^3 n 3 a ⋅ b ⋅ c a \cdot b \cdot c a ⋅ b ⋅ c n 3 n^3 n 3
  • 3 Painted Faces (Corners) 8 8 8 8 8 8 4 4 4 (top corners only)

2 Painted Faces (Edges) 12 ( n − 2 ) 12(n - 2) 12 ( n − 2 ) 4 [ ( a − 2 ) + ( b − 2 ) + ( c − 2 ) ] 4[(a - 2) + (b - 2) + (c - 2)] 4 [( a − 2 ) + ( b − 2 ) + ( c − 2 )] 8 ( n − 2 ) + 4 8(n - 2) + 4 8 ( n − 2 ) + 4

1 Painted Face (Centers) 6 ( n − 2 ) 2 6(n - 2)^2 6 ( n − 2 ) 2 2 [ ( a − 2 ) ( b − 2 ) + ( a − 2 ) ( c − 2 ) + ( b − 2 ) ( c − 2 ) ] 2[(a - 2)(b - 2) + (a - 2)(c - 2) + (b - 2)(c - 2)] 2 [( a − 2 ) ( b − 2 ) + ( a − 2 ) ( c − 2 ) + ( b − 2 ) ( c − 2 )] 5 ( n − 2 ) 2 + 4 ( n − 2 ) 5(n - 2)^2 + 4(n - 2) 5 ( n − 2 ) 2 + 4 ( n − 2 )

0 Painted Faces (Unpainted) ( n − 2 ) 3 (n - 2)^3 ( n − 2 ) 3 ( a − 2 ) ( b − 2 ) ( c − 2 ) (a - 2)(b - 2)(c - 2) ( a − 2 ) ( b − 2 ) ( c − 2 ) ( n − 2 ) 2 ( n − 1 ) (n - 2)^2(n - 1) ( n − 2 ) 2 ( n − 1 )

At Least 1 Painted Face n 3 − ( n − 2 ) 3 n^3 - (n - 2)^3 n 3 − ( n − 2 ) 3 a b c − ( a − 2 ) ( b − 2 ) ( c − 2 ) abc - (a - 2)(b - 2)(c - 2) ab c − ( a − 2 ) ( b − 2 ) ( c − 2 ) n 3 − ( n − 2 ) 2 ( n − 1 ) n^3 - (n - 2)^2(n - 1) n 3 − ( n − 2 ) 2 ( n − 1 )

  • Worked Examples
  • Worked Example 5.1.1 — Column-Height Map & Completing to a Minimum Cube

Problem: A corner block structure rests on a 4 × 3 4 \times 3 4 × 3 base (width x max ⁡ = 4 x_{\max} = 4 x m a x ​ = 4 , depth y max ⁡ = 3 y_{\max} = 3 y m a x ​ = 3 ). Its top-down column-height plan map is given by: [ 5 4 2 1 3 2 1 1 2 1 1 0 ] \begin{bmatrix} 5 & 4 & 2 & 1 \\ 3 & 2 & 1 & 1 \\ 2 & 1 & 1 & 0 \end{bmatrix} ​ 5 3 2 ​ 4 2 1 ​ 2 1 1 ​ 1 1 0 ​ ​

(where 0 0 0 indicates an empty ground square). Find: (a) the total number of unit cubes in the structure, (b) the minimum number of additional unit cubes needed to complete it into a 4 × 3 × 5 4 \times 3 \times 5 4 × 3 × 5 rectangular prism, and (c) the minimum number of additional unit cubes needed to complete it into a solid cube.

Solution:

Count existing unit cubes ( N existing N_{\text{existing}} N existing ​ ) via height tally:

  • Height 5 5 5 : n 5 = 1 n_5 = 1 n 5 ​ = 1 column ⟹ 5 × 1 = 5 \implies 5 \times 1 = 5 ⟹ 5 × 1 = 5
  • Height 4 4 4 : n 4 = 1 n_4 = 1 n 4 ​ = 1 column ⟹ 4 × 1 = 4 \implies 4 \times 1 = 4 ⟹ 4 × 1 = 4
  • Height 3 3 3 : n 3 = 1 n_3 = 1 n 3 ​ = 1 column ⟹ 3 × 1 = 3 \implies 3 \times 1 = 3 ⟹ 3 × 1 = 3
  • Height 2 2 2 : n 2 = 3 n_2 = 3 n 2 ​ = 3 columns ⟹ 2 × 3 = 6 \implies 2 \times 3 = 6 ⟹ 2 × 3 = 6
  • Height 1 1 1 : n 1 = 5 n_1 = 5 n 1 ​ = 5 columns ⟹ 1 × 5 = 5 \implies 1 \times 5 = 5 ⟹ 1 × 5 = 5

Total existing cubes: N existing = 5 + 4 + 3 + 6 + 5 = 23 N_{\text{existing}} = 5 + 4 + 3 + 6 + 5 = 23 N existing ​ = 5 + 4 + 3 + 6 + 5 = 23 .

(Floor-slice verification: F 1 = 11 , F 2 = 6 , F 3 = 3 , F 4 = 2 , F 5 = 1 ⟹ 11 + 6 + 3 + 2 + 1 = 23 F_1 = 11,\; F_2 = 6,\; F_3 = 3,\; F_4 = 2,\; F_5 = 1 \implies 11 + 6 + 3 + 2 + 1 = 23 F 1 ​ = 11 , F 2 ​ = 6 , F 3 ​ = 3 , F 4 ​ = 2 , F 5 ​ = 1 ⟹ 11 + 6 + 3 + 2 + 1 = 23 .)

Complete to a 4 × 3 × 5 4 \times 3 \times 5 4 × 3 × 5 rectangular prism:

Target prism volume = 4 × 3 × 5 = 60 = 4 \times 3 \times 5 = 60 = 4 × 3 × 5 = 60 .

Missing cubes = 60 − 23 = 37 = 60 - 23 = \mathbf{37} = 60 − 23 = 37 .

Complete to the smallest enclosing cube:

Since the maximum coordinate spans are A = 4 , B = 3 , C = 5 A = 4,\; B = 3,\; C = 5 A = 4 , B = 3 , C = 5 , the smallest cube that can enclose the figure without removing any existing blocks has edge length L = max ⁡ ( 4 , 3 , 5 ) = 5 L = \max(4, 3, 5) = 5 L = max ( 4 , 3 , 5 ) = 5 .

Target cube volume = 5 3 = 125 = 5^3 = 125 = 5 3 = 125 .

Missing cubes = 125 − 23 = 102 = 125 - 23 = \mathbf{102} = 125 − 23 = 102 .

Worked Example 5.1.2 — Painted Cuboid Dissection ( 4 × 6 × 7 4 \times 6 \times 7 4 × 6 × 7 )

Problem: A 4 × 6 × 7 4 \times 6 \times 7 4 × 6 × 7 rectangular wooden prism is painted red on all 6 exterior faces and then sawed into 1 × 1 × 1 1 \times 1 \times 1 1 × 1 × 1 unit cubes. How many unit cubes have (a) exactly 2 red faces, (b) exactly 1 red face, and (c) no red faces?

Solution:

Identify reduced inner dimensions: With a = 4 , b = 6 , c = 7 a = 4,\; b = 6,\; c = 7 a = 4 , b = 6 , c = 7 , subtract 2 2 2 from each edge: a − 2 = 2 , b − 2 = 4 , c − 2 = 5 a - 2 = 2, \qquad b - 2 = 4, \qquad c - 2 = 5 a − 2 = 2 , b − 2 = 4 , c − 2 = 5

(a) Exactly 2 red faces (Edge cubes): N 2 = 4 [ ( a − 2 ) + ( b − 2 ) + ( c − 2 ) ] = 4 ( 2 + 4 + 5 ) = 4 × 11 = 44 N_2 = 4\bigl[(a - 2) + (b - 2) + (c - 2)\bigr] = 4(2 + 4 + 5) = 4 \times 11 = \mathbf{44} N 2 ​ = 4 [ ( a − 2 ) + ( b − 2 ) + ( c − 2 ) ] = 4 ( 2 + 4 + 5 ) = 4 × 11 = 44

(b) Exactly 1 red face (Face-center cubes): N 1 = 2 [ ( 2 ) ( 4 ) + ( 2 ) ( 5 ) + ( 4 ) ( 5 ) ] = 2 ( 8 + 10 + 20 ) = 2 × 38 = 76 N_1 = 2\bigl[(2)(4) + (2)(5) + (4)(5)\bigr] = 2(8 + 10 + 20) = 2 \times 38 = \mathbf{76} N 1 ​ = 2 [ ( 2 ) ( 4 ) + ( 2 ) ( 5 ) + ( 4 ) ( 5 ) ] = 2 ( 8 + 10 + 20 ) = 2 × 38 = 76

(c) Exactly 0 red faces (Interior core cubes): N 0 = ( a − 2 ) ( b − 2 ) ( c − 2 ) = 2 × 4 × 5 = 40 N_0 = (a - 2)(b - 2)(c - 2) = 2 \times 4 \times 5 = \mathbf{40} N 0 ​ = ( a − 2 ) ( b − 2 ) ( c − 2 ) = 2 × 4 × 5 = 40

Sanity Check: Adding the N 3 = 8 N_3 = 8 N 3 ​ = 8 corner cubes gives 8 + 44 + 76 + 40 = 168 = 4 × 6 × 7 8 + 44 + 76 + 40 = 168 = 4 \times 6 \times 7 8 + 44 + 76 + 40 = 168 = 4 × 6 × 7 .

Review the Method

When one exterior face is left unpainted (such as a cube resting on a table), boundary cubes touching that unpainted face lose one painted surface, shifting 4 corners to 2-face, 4 edges to 1-face, and 1 face interior to 0-face.