Suppose that a and b are odd integers with a ≠ b. Show there is a unique integer c such that |a ‒ c| = |b ‒ c|.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.