Problem 46551. Solve a ballot counting problem

ChrisR

16 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

26 Solutions

Last Solution submitted on Jul 14, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers16

Suggested Problems

Angle between two vectors

797 Solvers
"Low : High - Low : High - Turn around " -- Create a subindices vector

589 Solvers
Compute a dot product of two vectors x and y

1056 Solvers
Create a matrix from a cell

75 Solvers
Generalized Laguerre polynomials

66 Solvers

More from this Author328

List ways to make a sum in Killer Sudoku

4 Solvers
Solve the arithmetic differential equation D(n) = n

13 Solvers
Iterate the sum of divisors and totient

18 Solvers
Evaluate the gamma function

21 Solvers
Set the Euler-Mascheroni constant with an identity using available MATLAB functions

20 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!