Random matrices with integer entries

Many classical arithmetic problems ranging from the elementary ones such as the density of square-free numbers to more difficult such as the density of primes, can be extended to integer matrices. Arithmetic problems over higher dimensions are typically much more difficult. Indeed, the Bateman-Horn conjecture predicting the density of numbers giving prime values of multivariate polynomials is very much open. In this talk I give an overview of the unfortunately brief history of integer random matrices.