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

Re: fermat mod mersenne 2^n+1 mod 2^m-1

Expand Messages
  • Mark
    ... Remember that Fermat numbers are of the form 2^(2^a) + 1 . But if you want any positive exponent n (not of the form 2^a), then (2^1 + 1) mod (2^2 - 1) = 0
    Message 1 of 2 , May 24 8:10 AM
      --- In primenumbers@yahoogroups.com, "rach" <maths_forall@...> wrote:
      >
      >
      > m integer >1
      >
      > 2^n+1 mod 2^m-1
      >
      > the only solution is : 2^3+1 Mod 2^2-1
      >
      > 9 Mod 3
      >
      > 9 = 0 Mod 3
      > thanks
      >

      Remember that Fermat numbers are of the form 2^(2^a) + 1 .

      But if you want any positive exponent n (not of the form 2^a), then


      (2^1 + 1) mod (2^2 - 1) = 0

      (2^3 + 1) mod (2^2 - 1) = 0 (yours)

      (2^5 + 1) mod (2^2 - 1) = 0

      etc.


      Mark
    Your message has been successfully submitted and would be delivered to recipients shortly.