No need to go through the whole range [m, n] either, since after 2 only odd numbers can be prime.

your function isPrime looks slightly overkill, because there is only one even prime, two, and, therefore, you could save some processor time just checking is the i = 2 separately and use i+=2, not i++