Digital Raven (digitalraven) wrote,
Digital Raven

  • Mood:
  • Music:

On the offchance that any of you reading this is a secret genius

Please tell me if you know of any method to implement the Miller-Rabin Primality Test (a common test used to check if a number is a prime number or not) without iterating though k from 1 to log2(n-1) when trying to formulate n-1 as the product of 2km, K being an integer and m being an odd integer? A shortcut would be very nice, as the current method seems insanely clunky but I can't think of another way to do it.

Oh, and official question, even though I've asked a nontrivial amount of the audience already: Go look at this picture and tell me whether I look sexy, all fucked up on some illegal substance, ugly as sin, or any combination of the above. Those that have already answered don't have to, of course.

100 comments, all from the second paragraph.
  • Post a new comment


    Comments allowed for friends only

    Anonymous comments are disabled in this journal

    default userpic

    Your reply will be screened

    Your IP address will be recorded