Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) = n −mr (n), where r is the rational affine dimension of P , and mr (n) is the r-Kruskal-Macaulay fun...