Problem 46551. Solve a ballot counting problem

ChrisR

14 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

24 Solutions

Last Solution submitted on May 30, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers14

Suggested Problems

Renaming a field in a structure array

1581 Solvers
First non-zero element in each column

957 Solvers
2 b | ~ 2 b

410 Solvers
System of equations

415 Solvers
What is the distance from point P(x,y) to the line Ax + By + C = 0?

560 Solvers

More from this Author325

Compute the unitary totient of a number

8 Solvers
List the dihedral primes

13 Solvers
Factor a number into Fermi-Dirac primes

10 Solvers
Check a scheme to dewater a construction area

4 Solvers
Compute the nth term from the golden sieve

20 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!