There are two players, player with data set and elements and player with data set and elements . The arithmetic mean of each data set is 10 and 20, respectively.
A "game" is played in which each is compared to its corresponding with the same base. If the element from set is less than its corresponding element from set , then player is awarded 1 point and visa versa with player .
What is the probability that player has more points than player
You may manipulate the following or exclude them if they are not necessary. This is to either a) make this problem easier, or b) to make the problem possible.
A) The range of the data in both sets. (Make this if possible)
B) The number of elements in each set. Notes:
• The number of elements in sets and must be the same
• The number of elements in set determines the number of matches.
• I don't think the number of elements matters, but it might
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
So many possibilities here, depending on the particular distributions. A "game theory" question could go like this: Suppose player A must choose N (positive integral) scores with the only stipulation that they have a mean of μA, and player B must similarly choose N (positive integral) scores that have a mean of μB. The scores are then ordered by each players and compared, in order, to those of the other player with the tally system you have indicated. What is the best strategy for the two players to achieve the maximum respective tally? Given that the two play optimally, what is the likely final tally as a function of N,μA and μB? I know that this isn't quite what you had in mind, but I thought I'd just throw it out there, anyway. :)
Log in to reply
Yes, this is a much more feasible task. That turns this from more of a computer science problem into a combinatorics/NT problem.
Assuming that the number of elements in each set is the same and knowing the fact that the arithmetic mean from B is two times as the arithmetic mean from A, I think the probabilitiy is 1/2