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

Remove all the words that end with "ain"

2703 Solvers
Distance walked 2D

319 Solvers
Arrange Vector in descending order

13769 Solvers
Specific Element Count

948 Solvers
Create logical matrix with a specific row and column sums

349 Solvers

More from this Author326

List numbers such that every sum of consecutive positive integers ending in those numbers is not prime

9 Solvers
List the erauqs

31 Solvers
Solve an ODE: concentrations predicted by the cells-in-series model

4 Solvers
Determine whether a number is a Gaussian prime

9 Solvers
Determine aquifer properties: unsteady pump test in a confined aquifer

5 Solvers

Problem Tags

Community Treasure Hunt

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

Start Hunting!