Loading ...
Sorry, an error occurred while loading the content.

pseudo-free numbers

Expand Messages
  • Bill Bouris
    I believe that the following class of numbers is pseudo-free... Let R = k * b^n +(b-1) where k is odd positive, b is a small prime base, n is a larger prime
    Message 1 of 5 , Aug 1, 2009
    • 0 Attachment
      I believe that the following class of numbers is pseudo-free...

      Let R = k * b^n +(b-1) where k is odd positive, b is a small prime base,
      n is a larger prime number and k is restricted to be <= b^n +(b-1).

      when tested against the base 'b', iff b^(R-1) ==1 (mod R), then 'R' is
      prime, never a pseudo-prime number.

      Bill

      can anyone refute this ???
    Your message has been successfully submitted and would be delivered to recipients shortly.