Demands visual figure-ground discrimination and combinatorial geometric analysis to spot embedded components and count composite geometric shapes without omissions.
Core Skills & Cognitive Modules
Key cognitive competencies and question patterns assessed under Embedded Figures & Geometric Counting.
1
Hidden Sub-Figure Identification
Isolate and identify the exact non-verbal target sub-figure embedded within complex background line art, respecting orientation and rotation constraints.
Focus: Planar subgraph matching, figure-ground discrimination, and orientation verification
Universal high frequency in SSC CGL, CHSL, MTS & RRB NTPC
2
Combinatorial Triangle Counting
Systematically enumerate total triangles in symmetric and asymmetric geometric figures using base formulas, diagonal sector multipliers, and bridge triangle counts.
Focus: Base summation formulas, diagonal square multipliers, and composite seam triangles
Universal high-yield topic in SSC CGL Tier 1, Railways & State PSCs
3
Square & Rectangle Counting Formulas
Compute total squares and rectangles in m x n grids and overlapping polygonal meshes using combinatorial algebraic formulas.
Focus: Sum of squares formula n(n+1)(2n+1)/6, m x n rectangular grid products, and square exclusion
Standard staple topic in SSC CGL, RRB NTPC & State Civil Services
4
Minimum Straight Line Enumeration
Determine the absolute minimum number of straight lines required to construct a complex geometric figure by classifying lines into horizontal, vertical, and diagonal sets.
Theoretical foundations, question formats, and high-scoring exam techniques.
Conceptual Foundations of Embedded Figures & Geometric Counting
Embedded Figures & Geometric Counting evaluates visual figure-ground discrimination, planar graph analysis, and combinatorial geometry. Candidates must detect camouflaged geometric motifs within noisy line networks and enumerate complex shapes (triangles, squares, straight lines) without omission or duplication.
The 5-Stage Combinatorial Counting Protocol
Decompose Figure into Autonomous Blocks: Break the complex master diagram into standard elementary sub-units (e.g., apex-base triangles, diagonal-divided squares, rectangular grids).
Apply Exact Combinatorial Formulas to Blocks: Apply n*(n+1)/2 for base triangles, 2*k for diagonal squares, and sum(m-k)(n-k) for grids to count internal shapes within each block.
Enumerate Joint & Bridging Shapes: Carefully inspect shared seams where two blocks fuse. Count all new macro-shapes formed across the interface that utilize vertices from both blocks.
Classify Minimum Straight Lines by Orientation: For straight line problems, execute 4 independent directional passes: count all continuous Horizontal lines, then Vertical, then Slant-Left, then Slant-Right.
Verify Embedded Figure Constraints: For hidden figures, verify that target lines exist in the candidate option with exact angle and vertex valence. Check if rotation is allowed or forbidden.
Foundational Principles of Embedded Figures & Geometric Counting
1. The Combinatorial Base LemmaA triangle divided by n base segments forms combinations of adjacent segments: sum_{i=1}^n i = n(n+1)/2.
Key Formula: Triangles = n(n+1)/2 per horizontal tier.
2. The 2k Diagonal Square MultiplierA central point in a quadrilateral with 2k radiating rays generates 2k triangles (k small single-sector + k large two-sector).
Counting formulas, bridging invariants, and straight-line classifications.
Triangle Apex-Base Rule
A triangle with base divided into n segments contains n*(n + 1)/2 triangles. For h horizontal levels: Total = h * [n*(n + 1)/2].
Condition: Triangles radiating from a single apex to a segmented base.
Watch out: Counting only the individual small triangles and missing the compound two-unit and three-unit triangles.
Diagonal Square Multiplier Rule
Count the number of small triangular sectors k inside a square divided by intersecting diagonals. Total Triangles = 2 * k.
Condition: Squares or rectangles with intersecting diagonals (k = 4, 6, or 8).
Watch out: Counting only 4 small triangles and forgetting the 4 large triangles formed by pairs of sectors.
Two-Square Joint Bridge Rule
Two diagonal squares joined side-by-side contribute: 8 (left) + 8 (right) + 2 (bridge triangles spanning the joint) = 18 triangles.
Condition: Two 8-triangle squares sharing a common vertical or horizontal edge.
Watch out: Stopping at 16 and missing the 2 large triangles that use the shared seam as their median.
Total Squares in m x n Grid Rule
Total Squares = (m * n) + (m - 1)*(n - 1) + (m - 2)*(n - 2) + ... until one factor reaches 1.
Condition: Any rectangular or square grid of unit blocks.
Watch out: Multiplying m * n and forgetting that 2x2, 3x3, etc. squares exist.
Total Rectangles in m x n Grid Rule
Total Rectangles = [m*(m + 1)/2] * [n*(n + 1)/2]. Rectangles ONLY (excluding squares) = Total Rectangles - Total Squares.
Condition: Rectangular grids of dimension m x n.
Watch out: Conflating 'Total Rectangles' with 'Rectangles that are not squares'.
Straight Lines H-V-S Categorization Rule
Count straight lines by scanning in 4 strict passes: (1) Horizontal lines (H); (2) Vertical lines (V); (3) Slant lines leaning right (S1); (4) Slant lines leaning left (S2). Total = H + V + S1 + S2.
Condition: Counting minimum straight lines in any planar figure.
Watch out: Counting short line segments between intersections as separate lines.
Combinatorial Geometry & Figure Counting Models
Median-partitioned triangle lattices, crossed quadrilateral invariants, and grid square/rectangle sum formulas.
Model 1: Combinatorial Triangle Counting
Median Base Sum: A triangle with n base divisions has n(n+1)/2 triangles per horizontal tier. Crossed Box 2n Rule: Any quadrilateral with both diagonals and bisectors dividing into n triangular pieces contains exactly 2 × n total triangles. Fused Joint Extra: When two crossed boxes share a common edge, exactly 2 large junction triangles emerge across the seam.
Model 2: Grid Square & Rectangle Invariants
Rectangles Include Squares: By geometric definition, every square is a rectangle. Total rectangles = [m(m+1)/2] × [n(n+1)/2]. Descending Step Product: Squares in an m × n grid decrement both dimensions until one becomes 1: (m·n) + (m-1)(n-1) + .... Pure Rectangles: If a question asks for "rectangles other than squares", subtract total squares from total rectangles.
Modeled Problem Walkthroughs: Embedded Figures & Geometric Counting
Step-by-step cognitive deduction showing how to isolate governing rules before timed practice.
4 Modeled Walkthroughs
Exemplar Problem Statement
Identify which of the four answer figures (A, B, C, D) contains the given 'Z-shaped' question figure embedded within it, where rotation is strictly NOT allowed.
AAnswer Figure A (contains the exact horizontal Z-shape without rotation)Correct Answer
BAnswer Figure B (contains the Z-shape rotated by 90°)
CAnswer Figure C (contains a mirrored S-shape)
DAnswer Figure D (contains an incomplete Z-shape missing the lower horizontal arm)
Step-by-Step Cognitive Deduction
Step 1Step 1: Analyze the Question Figure: The figure consists of an exact 'Z' shape: a top horizontal line from left to right, a diagonal line descending from top-right to bottom-left, and a bottom horizontal line extending to the right.
Step 2Step 2: Note the crucial constraint: 'Rotation is strictly NOT allowed'. The embedded figure must match the exact orientation of the question figure.
Step 3Step 3: Evaluate Option B: Contains the figure rotated 90° clockwise (resembling an 'N'). Discarded due to rotation constraint.
Step 4Step 4: Evaluate Option C: Contains a mirrored version (resembling an 'S'). Discarded due to reflection.
Step 5Step 5: Evaluate Option D: Missing the bottom horizontal segment. Discarded due to incomplete geometry.
Step 6Step 6: Evaluate Option A: The line network of Figure A contains the exact Z-shape in identical orientation and proportions.
Step 7Step 7: Option A is correct.
Decisive Deduction Factor:Figure A contains the exact unrotated Z-figure embedded within its continuous line structure, perfectly satisfying the zero-rotation constraint.
Answer Figure A (Option A)
Exam Insight: When rotation is forbidden, instantly eliminate any candidate figure that features rotated or mirrored variants.
Featured Practice Set (10 Balanced MCQs)
Work through these representative solved questions covering diverse difficulty tiers and cognitive patterns. Select an option to test your deduction with instant feedback and pedagogical explanations.
10 Curated Questions
Question 1easy
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a right-angled Z-hook comprising a horizontal top bar running right, a diagonal segment sloping down-left at 45 degrees, and a horizontal bottom bar extending right with a downward terminal pip.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 2easy
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a semicircular dome resting flat on a horizontal diameter line, supported from beneath by two parallel vertical legs extending downward from the diameter endpoints.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 3easy
Combinatorial Triangle Counting
Geometric Counting Problem (Systematic Shape Enumeration)
Vector Graphic (High-DPI)
Carefully analyze the line network and combinatorial intersections to count all target geometric figures without omission.
Triangle Counting Problem:
[ Geometric Figure ]: A triangle with one vertical line from the apex to the base (2 segments) and two horizontal partition lines dividing it into three tiers.
How many triangles are there in the given figure?
Question 4medium
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a double-chevron nested arrow with a central vertical spine that passes continuously through both apex vertices and projects downward past the lower chevron.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 5medium
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a semicircular arch with a keystone wedge, formed by a semicircular arc resting on a horizontal chord, containing a trapezoidal keystone wedge at its highest midpoint that projects slightly above the arc.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 6medium
Combinatorial Triangle Counting
Geometric Counting Problem (Systematic Shape Enumeration)
Vector Graphic (High-DPI)
Carefully analyze the line network and combinatorial intersections to count all target geometric figures without omission.
Triangle Counting Problem:
[ Geometric Figure ]: A large triangle with four concentric nested inverted triangles connecting the midpoints of sides sequentially.
How many triangles are there in the given figure?
Question 7medium
Combinatorial Triangle Counting
Geometric Counting Problem (Systematic Shape Enumeration)
Vector Graphic (High-DPI)
Carefully analyze the line network and combinatorial intersections to count all target geometric figures without omission.
Triangle Counting Problem:
[ Geometric Figure ]: A triangle with two cevian lines from apex A (3 base segments) and one cevian line from vertex B (2 side segments) intersecting internally.
How many triangles are there in the given figure?
Question 8hard
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a five-pointed star arm assembly formed by two intersecting acute triangles that create a 5-pointed star fragment, containing a central pentagonal core boundary and two outer radiating triangular points pointing upward and rightward.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 9hard
Hidden Sub-Figure Identification
Embedded Figure Problem (Hidden Sub-Figure Identification)
Vector Graphic (High-DPI)
Identify which candidate complex line network contains the given problem figure as an embedded sub-component.
Embedded Figure Problem:
[ Problem Figure (X) ]: A target geometric motif is given: a multi-barbed harpoon with offset fins, consisting of a long vertical central spine with three backward-pointing 45-degree diagonal barbs on the left side and two staggered diagonal barbs on the right side, tipped with a triangular point.
In which of the following candidate figures is Figure (X) embedded as a hidden sub-component without rotation or distortion?
Question 10hard
Combinatorial Triangle Counting
Geometric Counting Problem (Systematic Shape Enumeration)
Vector Graphic (High-DPI)
Carefully analyze the line network and combinatorial intersections to count all target geometric figures without omission.
Triangle Counting Problem:
[ Geometric Figure ]: An equilateral triangle divided into a triangular lattice grid of four rows (N = 4).
How many triangles are there in the given figure?
Ready to practice all 500 questions?Configure customizable practice drills by difficulty or test your pacing with a timed mock test.
Frequently Asked Questions & Preparation Strategy
When an apex connects to a base divided into n segments, the number of triangles is given by the triangular number formula: T = n * (n + 1) / 2. If the triangle is also divided horizontally into h levels by parallel lines, multiply by h: Total T = h * [n * (n + 1) / 2].