I think a really down to earth application was in the 2005 Hanke-Bhargava Theorem.
The proof showed that if a positive definite quadratic form with integral entries represents the first 290 positive integers, then it represents all of them.
A quadratic form might be able to "represent a number" (has integral solutions) in multiple ways: $Q(\vec{x})=n$ may have multiple solutions, which we will count, calling them "representation number," denoted $r_{Q}(n)$.
The proof essentially considers a "theta series," which is a generating function with $r_Q(n)$ as the fourier coefficients:
$$1+\sum_{n=1}^{\infty} r_Q(k) e^{2 \pi i k z}.$$
However, unlike the usual sense of a generating function, it is not so important that this is a formal algebraic object, but viewed analytically, it is a modular form!
Using the theory, we know that the space of modular forms (the full modular group) decomposes into the space of Eisenstein series and Cusp forms (with respect to a technical inner product.)
The point here, is that Eisenstein series are increasing and nonnegative, while the cusp series can be negative (but vanishes as $n \to \infty$.)
Using the theory of Siegel, Deligne, Hanke, and many others, we have ways to compute the Eisenstein series efficiently, and bound the cusp form.
In other words, we can decompose our representation number in the following sense:
$$r_Q(n)=r_{E}(n)+r_{C}(n),$$
so if we can show that this value is nonnegative for sufficiently large $n$, we will be done. The theory allows us to show this via modular form decomposition.
Other relevant papers using similar methods:
http://www.fen.bilkent.edu.tr/~franz/mat/15.pdf
https://arxiv.org/abs/1111.0979
https://arxiv.org/abs/1608.01656
Here is a more detailed exposition (in slide form):
http://college.wfu.edu/mathreu/wp-content/uploads/AMS_slides.pdf