Nineteenth century roots of quasideterminants

In this expository paper I provide a complete record of the nineteenth century publications that bear on the development of quasideterminants in the twentieth century. Two important recursive feasible algorithms, Sylvester’s from 1851 and Dodgson’s from 1866 are discussed, and the antecedents of both are traced back to work by Jacobi.