All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Probability
Probability of constant leading (Posted on 2015-10-05) Difficulty: 3 of 5
Imagine an election between two candidates.
A receives m votes, B receives n votes, and A wins (m>n).

If the ballots are cast one at a time, what is the probability that A will lead all the way throughout the voting process?

See The Solution Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Hints/Tips re: reference....partial spoiler | Comment 4 of 5 |
(In reply to reference by xdog)

Excellent reference, showing several ways to prove it.

It is however a challenge  to show that  (m-n)/(m+n) is a valid answer for m>=n : without going "copy and paste".


  Posted by Ady TZIDON on 2015-10-06 10:54:54
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (4)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information