Put 1, 2, 3 These 100 natural numbers are randomly divided into 50 groups with two numbers in each group. Now, any one of the two numbers in each group is recorded as a and the other as B , which can be substituted into the algebraic formula 1 / 2 (| A-B | + A + b) for calculation, and the results can be obtained. After 50 groups of substitution, 50 values can be obtained, and the maximum value of sum can be obtained

Put 1, 2, 3 These 100 natural numbers are randomly divided into 50 groups with two numbers in each group. Now, any one of the two numbers in each group is recorded as a and the other as B , which can be substituted into the algebraic formula 1 / 2 (| A-B | + A + b) for calculation, and the results can be obtained. After 50 groups of substitution, 50 values can be obtained, and the maximum value of sum can be obtained

The value of 1 / 2 (| A-B | + A + b) is equal to the larger one of a and B
The original problem is to divide 1 ~ 100 into 50 groups and find the maximum sum of the larger one in each group
The biggest is 51 to 100, of course
There's nothing wrong with this problem. It's a little interesting to find the minimum