For a positive integer n>1, let f(n) be the largest real number such that for every n×n diagonal matrix M with positive diagonal entries, if tr(M)<f(n), then M-J is invertible. Determine f(n). (The matrix J is the square matrix with all entries 1.)

(Due to a mistake, the problem is fixed at 3:30PM Friday.)