I think it might be useful to some to see how the formula Matt posted was derived.
$$\frac{2f_h}{n+1}<f_s<\frac{2f_l}{n}\tag{1},\quad n=0,1,\ldots$$
I was inspired by this website and I am not 100% sure if my proof is rigorous enough but here goes,

When the bandpass signal (with $f_l$ being the lowest and $f
_h$ being the highest frequency in it's spectra, it's fourier transform is given at the bottom right of the image above) is sampled at $f_s < 2f_h$, aliasing causes copies to be set up at $nf_s$ as shown in the right top image.
Depending on how large $f_l$ is, a larger multiple of $f_s$ is needed for the mirror image of the original spectra to be shifted enough to overlap.
The edge case is when the mirror image of the original spectra ($-f_h$ to $-f_l$) has a right shifted $n^{th}$ alias ($-f_h+nf_s$ to $-f_l +nf_s$) which manages to just fit inside the gap between the original spectra ($f_l$ to $f_h$) and it's immediate left alias ($f_l-f_s$ to $f_h-f_s$).
So now there are two conditions, one condition such that the left side of the $n^{th}$ alias does not overlap with the immediate left alias,
$$f_h - f_s < -f_h +nf_s$$
$$\frac{2f_h}{n+1} < f_s$$
and the right side of the $n^{th}$ alias does not overlap with the original,
$$-f_l + nf_s < f_l $$
$$f_s < \frac{2f_l}{n}$$
So for the largest value of $n$ such that this inequality is satisfied,
we can find the range of sampling frequencies at which the aliases created are mutually exclusive and the original continuous function, or a frequency-shifted version of it, can be recovered.
From the inequality $(1)$,
$$\frac{f_h}{f_l} < 1 + \frac{1}{n}$$
$$\frac{f_h - f_l}{f_l} < \frac{1}{n}$$
$$n < \frac{f_l}{B}$$
Where $B = f_h - f_l$ is the the bandwidth. The largest value $n$ can take is $n_{max}=\left\lfloor\frac{f_l}{B}\right\rfloor$ just as Matt has given.