1. a. Can one use this section's formulas that indicate the complexity equivalence of multiplication and squaring of integers to show the complexity equivalence of multiplication and squaring of square matrices?
b. Show that multiplication of two matrices of order n can be reduced to squaring a matrix of order 2n.
2. Find a tight lower-bound class for the problem of finding two closest numbers among n real numbers x1, x2,...,xn.