http://www.perlmonks.org?node_id=430266


in reply to a close prime number

That's really easy:

sub find_closest_primes
{
    my $number = shift;

    my @close_primes;

    for my $close (find_close_numbers( $number ))
    {
         push @close_primes, $close if is_prime( $close );
    }

    return @close_primes;
}

[download]

All you have to do is fill in the behavior of find_close_numbers() and is_prime()!

Replies are listed 'Best First'.
Re^2: a close prime number
by belden (Friar) on Feb 11, 2005 at 21:12 UTC
[reply]
Re^2: a close prime number
by water (Deacon) on Feb 13, 2005 at 19:33 UTC
    Your solution reminds me of me of a article currently referenced from the Joel on Software homepage, which talks about the the do-magic-here step.

    :)

[reply]

      I don't necessarily think of it as magic; I didn't know what the supplicant would consider a "close" number nor did I know which prime number finding algorithm he might find acceptable.

      It's not really a joke answer. It's how I would divide the problem if I were doing it.

[reply]

In Section Seekers of Perl Wisdom