Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^2: a close prime number

by water (Deacon)
on Feb 13, 2005 at 19:33 UTC ( #430615=note: print w/replies, xml ) Need Help??


in reply to Re: a close prime number
in thread a close prime number

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.

:)

Replies are listed 'Best First'.
Re^3: a close prime number
by chromatic (Archbishop) on Feb 13, 2005 at 21:41 UTC

    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://430615]
help
Chatterbox?
[Eily]: I just wrote a oneliner to solve a (non perl) colleague's problem, and it worked on the first try
[Eily]: and he wasn't impressed
1nickt adds gingersnaps to the platter on the sideboard.
[Eily]: sure it was a pretty standard one liner (of the $h{$1} = $2 if /regex/; END { pp \%h; } variety), but he's not supposed to know that!
[Eily]: what's the point of writing perl if people aren't impressed :P

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (10)
As of 2017-04-26 15:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I'm a fool:











    Results (482 votes). Check out past polls.