Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 exptools 1/6/84; site iwu1d.UUCP Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!ihnp4!iwu1d!tan From: tan@iwu1d.UUCP (William Tanenbaum) Newsgroups: net.puzzle,net.math Subject: Ballot counting problem Message-ID: <180@iwu1d.UUCP> Date: Wed, 29-Feb-84 14:29:19 EST Article-I.D.: iwu1d.180 Posted: Wed Feb 29 14:29:19 1984 Date-Received: Fri, 2-Mar-84 08:33:14 EST Organization: AT&T Bell Labs, Naperville, IL Lines: 14 Here is a well known problem in probability which is difficult to solve by brute force but yields easily to the proper insight: ---Two candidates run for office. The winner receives p votes, the loser receives q votes. (q