Awesome q2a theme
0 votes
23 views
In how many ways can one arrange five 1’s and five -1’s so that all ten partial sums (starting with the first summand) are nonnegative?
in Combinatory by (10 points) | 23 views
0

When n=4 then we can draw like this,

Number of Leaves = Total Arrangement = 5

If you draw a Tree like this for n=5, then you will get 14.

I am not sure but this looks like Catalan Number i.e. if $n=4$ then Catalan Number $C_3=5$ and for $n=5$ $C_4=14$

0
The answer is 42 which maps to $C_{5}$. But why $C_{5}$?

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
9,105 questions
3,156 answers
14,593 comments
95,955 users