You have 50 red marbles, 50 blue marbles and 2 jars.
Your friend will be randomly grabbing one marble from one of the jars. You must place all 100 marbles in the two jars however you'd like (you must use all 100 marbles and both jars). How would you maximize the chance that your friend will draw a red marble?
is phrased vaguely, and consequently there are at least three different ways to interpret it:
1. Your friend will choose a jar uniformly at random, then choose a marble from that jar uniformly at random.
We want the average of the percentages of red marbles in both jars to be maximized. If one jar contains more red than blue marbles, then the other jar contains more blue than red marbles. Call these jars the "red jar" and the "blue jar," respectively . Among all arrangements, the greatest possible probability that you draw a red marble from the red jar is 100%, realized in cases when there are no blue marbles in the red jar. Among all arrangements, the greatest possible probability that you draw a red marble from the blue jar is 49/99, realized in the case when there are 49 red and 50 blue marbles in that jar.
Since the arrangement with one red marble in one jar and all the others in the other jar maximizes BOTH of the probabilities we're trying to maximize, it's optimal. 
2. Your friend will examine the two jars, select a jar, and then take a marble uniformly at random from that jar, hoping to get a blue marble.(注意理解这种情况：你希望朋友取得红球的概率最大，然而朋友却希望取得蓝球，两个人的目标并不相同，真是坑朋友啊！！！)
In this case, if one jar has more red marbles than blue marbles, then the other has more blue marbles than red marbles, so you want to put equal numbers of red and blue marbles in each jar.
3. Your friend will examine the two jars, select a jar, and then take a marble at random from that jar, hoping to get a red marble.
This is the easiest case: just arrange it so that one of the jars doesn't have any blue marbles in it.
 If you want to be completely formal, let's say that if both jars have the same number of red and blue marbles then we assign the labels "red jar" and "blue jar" arbitrarily.
 This is of course the same as , which was posted while I was typing this up. and come to the same conclusion, but I like this version of the argument better. Of course, I only appreciate it because I understand their brute-force and more generalizable solutions to the problem; for someone who didn't, this might not be the best place to start. In general in such a problem you won't be able to maximize both probabilities simultaneously, so you'd have to do something more like the other solutions.