First, suppose R=Mn(k). Then R is simple, and the matrix with 1's on the line above the diagonal and 0's elsewhere has minimal polynomial xn. Conversely, suppose R is simple and has an element r whose minimal polynomial over k is (x−a1)⋯(x−an), where a1,…,an∈k. Then we have a strictly descending chain of left ideals
(#)R⊃R(r−a1)⊃R(r−a1)(r−a2)⊃⋯⊃R(r−a1)⋯(r−an)=0.
For, if R(r−a)⋯(r−ai)=R(r−a1)⋯(r−ai+1) for some i, right multiplication by (r−ai+2)⋯(r−an) would give (r−a1)⋯(r−ai)(r−ai+2)⋯(r−an)=0∈R, which is impossible. Now, express R in the form Mm(D) where D is a division k-algebra of, say, dimension d. Then n2=m2d, and RR has composition length m. Appealing to (#), we have m2≥n2=m2d, so d=1, n=m, and R∼Mn(k).