If x, y, z and n>1 are natural numbers with x^n + y^n = z^n, how can one show that x, y, and z all are larger than n?
Given n real numbers, how can I find two of them, such that the sum |x+y| is minimal for all possible choices of x and y, at a better running time than O(n^2)?