Ch 01 - Patterns in Mathematics6th Ganita Prakash

Mathematics is fundamentally the search for patterns and the explanations as to why those patterns exist.

• These explanations can be applied in contexts far beyond where they were originally discovered.
• Patterns are found in nature, planetary motion, genomes, and daily life.

The branch of Mathematics that strictly studies patterns in whole numbers is called Number Theory.

• It involves analyzing fundamental sequences like prime numbers, odd/even numbers, and Fibonacci (Virahānka) numbers.

Component Anatomy:

• $n$: The position of the term in the sequence.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$ (Strictly positive integers)

Adding the 'All 1s' sequence iteratively generates the Counting Numbers.

Step-by-step Verification:

• $1 = 1$
• $1 + 1 = 2$
• $1 + 1 + 1 = 3$
• $1 + 1 + 1 + 1 = 4$

Component Anatomy:

• $n$: The position of the term in the sequence.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $n$: The position of the term in the sequence.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Adding the counting numbers sequentially generates the Triangular Numbers.

Step-by-step Verification:

• $1 = 1$
• $1 + 2 = 3$
• $1 + 2 + 3 = 6$
• $1 + 2 + 3 + 4 = 10$

Component Anatomy:

• $T_n$: The $n$-th triangular number.
• $n$: The position of the term, corresponding to the number of dots in the base row of the triangle.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $S_n$: The $n$-th square number.
• $n$: The side length of the square grid (measured in dots or units).

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $C_n$: The $n$-th cube number.
• $n$: The dimension of the 3D grid (measured in unit blocks).

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $n$: The total number of consecutive odd numbers being summed.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $n$: The peak (maximum) number in the continuous counting sequence.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $T_n$: The $n$-th triangular number.
• $T_{n-1}$: The immediately preceding triangular number.
• $n^2$: The resulting perfect square.

Boundary Conditions / Domain:

• $n \ge 2$
• $n \in \mathbb{Z}^+$

Context: The number 36 represents an intersection of two geometric number sequences.

• Square Number: It can be arranged as a $6 \times 6$ perfect square ($6^2 = 36$).
• Triangular Number: It can be arranged as a perfect equilateral triangle with a base of 8 dots ($T_8 = 36$).

Component Anatomy:

• $H_n$: The $n$-th hexagonal number.
• $H_{n-1}$: The previous hexagonal number.

Boundary Conditions / Domain:

• Sequence initiation: $H_1 = 1$
• Valid domain for recursion: $n \ge 2$

Component Anatomy:

• $T_n$: The $n$-th triangular number.
• $H_{n+1}$: The $(n+1)$-th hexagonal number.

Boundary Conditions / Domain:

• $n \ge 1$
• Base terms correspond directly: $T_1 = 1 \implies H_2 = 7$, $T_2 = 3 \implies H_3 = 19$, etc.

Component Anatomy:

• $H_i$: The $i$-th hexagonal number.
• $n^3$: The resulting perfect cube number.

Boundary Conditions / Domain:

• $n \ge 1$
• $n \in \mathbb{Z}^+$

Component Anatomy:

• $F_n$: The $n$-th Virahānka (Fibonacci) number.
• $F_{n-1}, F_{n-2}$: The immediate two preceding terms in the sequence.

Boundary Conditions / Domain:

• Sequence base cases start strictly as: $F_1 = 1$, $F_2 = 2$ (Standard Fibonacci often uses $F_1=1, F_2=1$, but the chapter defines the classical Virahānka start).
• Recursive formula applies validly for $n \ge 3$.

Component Anatomy:

• $2^i$: A term representing a power of 2.
• $n$: The highest exponent included in the summation.

Boundary Conditions / Domain:

• $n \ge 0$
• $n \in \mathbb{Z}^+$

The Rule: Starting from an equilateral triangle (3 sides), the rule for forming the next shapes in this geometric sequence is to increase the number of sides by 1 each time.

• Because they are defined as regular polygons, the number of corners (vertices) follows the exact same sequence as the sides (3, 4, 5, 6...).

Component Anatomy:

• $E$: Total number of edges (connecting lines).
• $n$: Total number of vertices (points or nodes).

Boundary Conditions / Domain:

• $n \ge 2$ (A complete graph needs at least 2 points to form a line)
• $n \in \mathbb{Z}^+$

As smaller squares are stacked layer by layer, the cumulative total number of little unit squares accurately maps to the Square Numbers sequence.

• Sequence: 1, 4, 9, 16, 25...
• Why? The overall shape structurally always forms a perfect, larger square grid representing an $n \times n$ area.

Counting the total number of small sub-triangles formed in a stacked larger triangle shape uniquely yields the Square Numbers sequence.

• Sequence: 1, 4, 9, 16, 25...
• Why? Each downward row of the stacked triangle geometrically adds consecutive odd numbers of smaller triangles (Row 1=1, Row 2=3, Row 3=5). Structurally, adding consecutive odd numbers always produces a perfect square.

The Visual Transformation Rule:

1. Base Shape: Begin with an equilateral triangle (3 line segments).
2. Iteration Step: For every single iteration, target every existing straight line segment.
3. Substitution: Replace the middle third of that segment with an outward-pointing 'speed bump' (a smaller equilateral triangle without its base).
4. Outcome: Every 1 original line segment is procedurally broken into 4 smaller line segments.

• Perimeter: Tends towards Infinity. At each iteration, the total boundary length rigorously increases by a factor of 4/3 because straight segments are continually replaced by longer jagged paths.
• Area: Remains Finite. Even with infinite boundary perimeter expansion, the overall mathematical area is rigidly bounded and convergent, never exceeding the area of a circumscribed circle around the original triangle.