If a candidate is not a prime, it must have a divisor that's less than the square root of the candidate (proof left as an exercise to the reader).

for my $each_num (2 .. sqrt $prime_candidate) {
    if ($prime_candidate % $each_num == 0) {
        say ...
[download]

For another speed-up, skip all the even numbers but 2.