Pyramid question?

Start A

Row 1 B C

Row 2 D E F

Row 3 G H I J

A path is a sequence of letters that leads from A to a letter in a different row. Each step in the path must take you down one row. If you can only move diagonally, left, or right, how many ways are there from A to H?

Update:

THE LETTERS ARE LIKE A PYRAMID!!!!

3 Answers

Relevance
  • 1 decade ago
    Favorite Answer

    There are 3 paths to H from A:

    ABDH

    ABEH

    ACEH

    Hope this helps! :)

  • 1 decade ago

    abdh

    abeh

    acdh

    aceh

    acfh

    there are only five ways beacuse if you need to move down one row for every move you only have bc to work with in the start so that limits the number of combos

  • 1 decade ago

    Just write it out and draw lines across

Still have questions? Get your answers by asking now.