The Daily Static
  The Daily Static
UF Archives
Register
UF Membership
Ad Free Site
Postcards
Community
Geekfinder
UFie Gear
Advertise on UF
Forum Rules
& FAQ

Username

Password


Create a New Account

  
 

Back to UserFriendly Strip Comments Index
hardcore Math Ufies by dennismv 2009-02-10 23:25:56
Is it easier to factor a number, knowing that it is a product of two primes ?

Or is it just as hard ?

i.e. given a, and you know that it is a product of primes p and q, where each p and q are in a bounded set of primes {2, ... some large prime}

One way is to try dividing a by each prime, i.e. a/2, a/3, a/5, a/7, ... a/[prime up to and including sqrt(a)] to figure out if a is a composite.... but is there a better way ?
[ Reply ]
  Not as far as is publicly known. by nix2009-02-10 23:31:51
  Planning a little RSA cracking, are we? (n/t) by Sharku2009-02-10 23:32:48
    heh, no .. by dennismv2009-02-10 23:46:38
      Trust me, a *lot* of really smart people by nix2009-02-11 00:03:29
  It's generally likely to be harder by archnerd2009-02-10 23:42:55
    A proof by archnerd2009-02-10 23:56:16

 

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)