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

Function composition - harder

108 Solvers
Getting the absolute index from a matrix

259 Solvers
Unique values without using UNIQUE function

456 Solvers
Guess Cipher

472 Solvers
Replace multiples of 5 with NaN

472 Solvers

More from this Author329

Create a sequence of primes p such that p > n π(p)

15 Solvers
Count the ways to draw non-intersecting chords between points on a circle

13 Solvers
Factor a number into Fermi-Dirac primes

10 Solvers
Count trailing zeros in a primorial

84 Solvers
Determine whether one vector is a subset of another

16 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!