Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re: a close prime number

by chromatic (Archbishop)
on Feb 11, 2005 at 20:48 UTC ( #430266=note: print w/replies, xml ) Need Help??

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; }

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
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.


      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.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://430266]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (4)
As of 2018-06-23 14:37 GMT
Find Nodes?
    Voting Booth?
    Should cpanminus be part of the standard Perl release?

    Results (125 votes). Check out past polls.