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

 Queue weight possibilities. (Posted on 2007-05-15)
When a problem is being voted on in the Perplexus queue, the journeymen and scholars post comments and vote on the problem. A "thumbs up" (TU) scores +1 point, a "thumbs down" (TD) scores -1, and a comment with no vote scores 0.

Suppose a problem in the queue has A responses and a score of B. Find a formula that gives the number of possible combinations of TU's, TD's and nonvoting comments the problem has received.

Note: For example a problem with 3 responses and a score of +1 has two possibilities: {one TU and two comments} and {two TU's and one TD}

 See The Solution Submitted by Jer No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: solution Comment 3 of 3 |
(In reply to solution by Charlie)

My independent computations are in conformity with Charlie's result.

Let us denote:

c = the value of the score
d =  # responses
f = the  number of possible combinations of TU's, TD's and

After some algebraic manipulations  we arrive as the same result in terms of the previous post, which is:

f = [0.5*(abs(c) + d)] – abs(c) + 1;
where abs(x) = absolute value of x and:
[x]= the greatest integer< = x.

Edited on May 18, 2007, 6:29 am
 Posted by K Sengupta on 2007-05-16 11:44:31

 Search: Search body:
Forums (0)