Problem 50073. Number Puzzles - 021

• Created by Doddy Kastanya

×

Like (2)

Difficulty:

(23)

Rate

• Solve Later   
• Add To GroupÂ

Borrowing the idea from Pascal Triangle, the following operation can be performed. Starting with an array of the first N odd numbers (where N is greater than 1), the following upside-down triangle of numbers can be formed where starting from the second row, the number is determined by adding the two neighboring numbers in the previous row.

Given N, determine the last number at the bottom of the triangle (i.e., the red number in the illustration above).

Solve

Solution Stats

83.87% Correct | 16.13% Incorrect

• 31 Solutions
• 25 Solvers

Last Solution submitted on Dec 15, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers25

Suggested Problems

• Remove the two elements next to NaN value

  659 Solvers

• Set the array elements whose value is 13 to 0

  1381 Solvers

• Find out sum and carry of Binary adder

  1542 Solvers

• Number Puzzles - 020

  27 Solvers

• Sum of series IX

  1048 Solvers

More from this Author180

• Number Puzzle - 024

  24 Solvers

• Number Puzzle - 097

  22 Solvers

• Number Puzzle - 098

  22 Solvers

• Simple Income Tax

  16 Solvers

• Splitting Circle

  36 Solvers