Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: RSA Factoring challenge

by Nitsuj (Hermit)
on Jul 26, 2001 at 15:44 UTC ( #99949=note: print w/replies, xml ) Need Help??


in reply to RSA Factoring challenge

Well, you only need one number since the RSA numbers are factors of 2 primes.
Oh Yeah, and you only need every other number, since you know that it isn't prime if it's even.
Also, you don't need to count for 2, because you can check to see if the last number is even, and then the challenge wouldn't be very hard.

$p=<the number>;$r=3;while((p%r)!=0)r+=2; <==Unreadably

**READABLY**
$p=<the number>;
$r=3;
while((p%r)!=0)r+=2;
**READABLY**


Not such a bad solution character count wise.

Just Another Perl Backpacker

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (3)
As of 2022-05-18 14:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you prefer to work remotely?



    Results (71 votes). Check out past polls.

    Notices?