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

9016Re: Largest Ordinary Prime?

Expand Messages
  • David Broadhurst
    Oct 1, 2002

      > What I meant is that we cannot call
      > 2^64695-2^15-1 a "3-bit prime".
      > Because of the minus signs, it
      > has 63951 bits set to 1, not just 3.

      Err, it seems to me that it has all bits but
      one set to 1:

      ? b=binary(2^64695-2^15-1);
      ? print(sum(k=1,64695,b[k]))

      It is a "base-2 near repunit",
      just one bit-change
      away from being a Mersenne.

    • Show all 22 messages in this topic