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

Sierpinski problem with prime powers

Expand Messages
  • David Broadhurst <d.broadhurst@open.ac.u
    http://listserv.nodak.edu/scripts/wa.exe?A2=ind0301&L=nmbrthry&P=R2 has an interesting variant on the Sierpinski problem from Sun Zhi-Wei (of Wall-Sun-Sun
    Message 1 of 2 , Jan 2, 2003
    • 0 Attachment
      http://listserv.nodak.edu/scripts/wa.exe?A2=ind0301&L=nmbrthry&P=R2
      has an interesting variant on the Sierpinski problem
      from Sun Zhi-Wei (of Wall-Sun-Sun fame).
    • David Broadhurst <d.broadhurst@open.ac.u
      Comment: Since Payam s PrP 19249+2^551542 is effectively unprovable, Prof. Sun Zhi-Wei s appeal is essentially directed at SoB, telling them that if/when
      Message 2 of 2 , Jan 2, 2003
      • 0 Attachment
        Comment: Since Payam's PrP 19249+2^551542
        is effectively unprovable, Prof. Sun Zhi-Wei's
        appeal is essentially directed at SoB,
        telling them that if/when k*2^n+1 is cracked for both
        k=19249 and k=67607 then the person contributing
        the last relevant SoB cycle gets a publication, I guess?

        But then the second author might be anonymous, as in

        http://www.utm.edu/research/primes/bios/codes/SB3.html
      Your message has been successfully submitted and would be delivered to recipients shortly.