Example 1
Question: The first three Virahāṅka-Fibonacci numbers starting from 2 and 3 are 2, 3, and 5. Now consider the next three Virahāṅka-Fibonacci numbers: 5, 8, and 13. Place these three numbers in the bottom row of a three-row number pyramid (left to right). Using the pyramid rule — each cell equals the sum of the two cells directly below it — fill in the second row and then the top. Write all the numbers that appear in the pyramid and state which of them are Virahāṅka-Fibonacci numbers.
Solution: Step 1 — Identify the bottom row. The three chosen consecutive Virahāṅka-Fibonacci numbers are 5, 8, and 13 (placed left to right in Row 1). Step 2 — Build the Virahāṅka-Fibonacci sequence for reference. Starting from 1, 1: the sequence is 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … Step 3 — Fill Row 2 (middle row, two cells). Left cell of Row 2 = left cell + middle cell of Row 1: \[ 5 + 8 = 13 \] Right cell of Row 2 = middle cell + right cell of Row 1: \[ 8 + 13 = 21 \] So Row 2 is: 13, 21. Step 4 — Fill Row 3 (top, one cell). Top cell = left cell + right cell of Row 2: \[ 13 + 21 = 34 \] Step 5 — List all numbers in the pyramid. Row 1 (bottom): 5, 8, 13. Row 2 (middle): 13, 21. Row 3 (top): 34. All numbers: 5, 8, 13, 13, 21, 34. Step 6 — Check which are Virahāṅka-Fibonacci numbers. From the sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 … 5 — yes, 8 — yes, 13 — yes, 13 — yes, 21 — yes, 34 — yes. All six numbers that appear in the pyramid are Virahāṅka-Fibonacci numbers.
Answer: Row 1 (bottom): 5, 8, 13. Row 2 (middle): 13, 21. Top: 34. All numbers in the pyramid are Virahāṅka-Fibonacci numbers.
Example 2
Question: Consider a four-row number pyramid. The bottom row contains the four consecutive Virahāṅka-Fibonacci numbers 3, 5, 8, and 13 (placed left to right). Using the pyramid rule — each cell equals the sum of the two cells directly below it — fill in all the rows above the bottom row. List every number that appears in the pyramid and check whether each one is a Virahāṅka-Fibonacci number.
Solution: Step 1 — Write the Virahāṅka-Fibonacci sequence for reference. 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, … Step 2 — Bottom row (Row 1, four cells). 3, 5, 8, 13. Step 3 — Row 2 (three cells), each cell = sum of two cells below it. Left: \( 3 + 5 = 8 \) Middle: \( 5 + 8 = 13 \) Right: \( 8 + 13 = 21 \) Row 2: 8, 13, 21. Step 4 — Row 3 (two cells). Left: \( 8 + 13 = 21 \) Right: \( 13 + 21 = 34 \) Row 3: 21, 34. Step 5 — Row 4 (top, one cell). \[ 21 + 34 = 55 \] Top: 55. Step 6 — List all numbers in the pyramid. Row 1: 3, 5, 8, 13. Row 2: 8, 13, 21. Row 3: 21, 34. Row 4 (top): 55. Step 7 — Check each against the Virahāṅka-Fibonacci sequence. From the sequence: …3, 5, 8, 13, 21, 34, 55… 3 — yes, 5 — yes, 8 — yes, 13 — yes, 8 — yes, 13 — yes, 21 — yes, 21 — yes, 34 — yes, 55 — yes. Every single number appearing in the pyramid is a Virahāṅka-Fibonacci number.
Answer: Row 1: 3, 5, 8, 13. Row 2: 8, 13, 21. Row 3: 21, 34. Top: 55. All numbers in the pyramid are Virahāṅka-Fibonacci numbers.