Problem 46551. Solve a ballot counting problem

ChrisR

13 solvers

2 likes

Solve

Solve Later

Candidate X and Candidate O receive the same number (n) of votes in an election. Write a function to determine the number of ways the ballots can be counted such that X is never behind O. For example, for n = 3 there are five ways:
   XXXOOO
   XXOXOO  
   XXOOXO
   XOXXOO
   XOXOXO
 Optional: Identify the connection between this problem and Cody Problem 42821. 

Solve

Solution Stats

23 Solutions

Last Solution submitted on Apr 01, 2023

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers13

Suggested Problems

Determine if a Given Number is a Triangle Number

398 Solvers
Roll the Dice!

10709 Solvers
Find Index of maximum Value and maximum Value of a vector

167 Solvers
Detect a number and replace with two NaN's

199 Solvers
Volume of a sphere given its surface area

153 Solvers

More from this Author321

Convert a number from factorial notation to base 10

10 Solvers
Determine the Zeckendorf expansion of a number

14 Solvers
Characterize the final state of the digit inventory sequence

18 Solvers
Compute the antisigma function

8 Solvers
List the first of three consecutive square-free numbers

5 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!