Computer Science, asked by 1234568872, 11 months ago

How many paths from (1, 0) to (7, 6) without crossing the diagonal?

Answers

Answered by stefangonzalez246
0

make a paths without the diagonal

The given below pictures show the diagram for draw(1,0) to (7,6)

     To draw a triangle with all the points from (1,0) to (7,6) below the diagonal drawn on it.

    It will start form (1,0) to (7,6) below diagonal drawn on it. stating from (1,0) mark the total number of possible paths that points can be reached from origin.

   This will be shown and given diagram below, the values will be increased by the addition of the cross word number of the diagonal values.

     The answer is 429. This would be doubled if you want to consider the similar case for the upper triangle.

To Learn More...

  • brainly.in/question/15293808
  • brainly.in/question/7234292

Attachments:
Similar questions