Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

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()!


Comment on Re: a close prime number
Select or Download Code
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?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://430266]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2014-12-18 04:50 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (41 votes), past polls