I'd recommend having some larger values of n and m in the test cases to avoid a brute force approach.

this code doesn't account for primary numbers, can be quickly corrected by checking for ns smaller than 0 and returning false as no negative numbers are prime, a.s - given an integer -n for n as any positive integer -n is always divisible by n which is a divisor other than one and itself