Let n≥3 be a natural number. A set of real numbers {x1,x2,…,xn} is called summable if \sum_{i\equal{}1}^n \frac{1}{x_i}\equal{}1. Prove that for every n≥3 there always exists a summable set which consists of n elements such that the biggest element is:
a) bigger than 2^{2n\minus{}2}
b) smaller than n2 inductionalgebra proposedalgebra