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

Query

Expand Messages
  • mistermac39
    Dear Group, Seeing that there are so few posts this month, I am wondering whether anyone interested wishes to answer the following, What is the full
    Message 1 of 6 , Mar 26 11:52 PM
    • 0 Attachment
      Dear Group,
      Seeing that there are so few posts this month, I am wondering whether
      anyone interested wishes to answer the following,

      What is the full factorisation of
      (a) 2^1093+1
      (b) 2^3511+1

      If there are no takers, because it is a big ask, I will understand.

      Alternatively, can someone at least tell me if (a) has more than four
      factors, or point me in the right direction to search out the answer.

      Best wishes,

      John McNamara
    • Mikael Klasson
      ... 3.306041.149076457.P315
      Message 2 of 6 , Mar 27 12:09 AM
      • 0 Attachment
        > What is the full factorisation of
        > (a) 2^1093+1

        3.306041.149076457.P315

        [P315=775309902635364881556328081709560033340899914713343298788222763555845496121751135840855081911255797039523816675957639538204352523982931845105652930547765889021733861178541326435214398367275527174643585660578896930155527258216600218442697602089139283393183797246794047468615602440282788647026739035063140565569055563]

        http://www.cerias.purdue.edu/homes/ssw/cun/prime.php

        > (b) 2^3511+1

        P( 3511 )C: 3
        P( 3511 )C: 1537819
        P( 3511 )C: 6151273
        P( 3511 )C: 7615213345961363
        plus more unknown(?) factors.

        http://www.euronet.nl/users/bota/medium-p.htm

        Mikael
      • elevensmooth
        ... Will Edgington is the source for latest information on Mersenne Factors. He will list factors for this under M(7022).
        Message 3 of 6 , Mar 27 7:21 AM
        • 0 Attachment
          --- In primenumbers@yahoogroups.com, "mistermac39" <mistermac39@h...>
          wrote:

          > (b) 2^3511+1

          Will Edgington is the source for latest information on Mersenne
          Factors. He will list factors for this under M(7022).
          http://www.garlic.com/~wedgingt/mersenne.html

          Dario Alpern usually has the recent information in his Java applet.
          Note that the smaller factors are not stored, so you need to let it
          run a few curves to find them.
          http://www.alpertron.com.ar/ECM.HTM

          3 x 1537819 x 6151273 x 7615213345961363 x C1028
          ====================
          ElevenSmooth: Distributed Factoring of 2^3326400-1
          http://ElevenSmooth.com
        • elevensmooth
          ... ... How interested are you in the finding more factors? I ve put the 1028 digit composite into an ECM server that also has other
          Message 4 of 6 , Mar 27 3:46 PM
          • 0 Attachment
            > --- In primenumbers@yahoogroups.com, "mistermac39"
            <mistermac39@h...>
            > wrote:
            >
            > > (b) 2^3511+1

            > 3 x 1537819 x 6151273 x 7615213345961363 x C1028

            How interested are you in the finding more factors? I've put the 1028
            digit composite into an ECM server that also has other numbers from
            ElevenSmooth. Soon it will have finished looking for 30 digit factors
            and start looking for 35 digit factors. If you contribute to the
            search, I'll keep the number in; otherwise I'll dump it in a few days
            when I grow bored.

            The ecm server is at elevensmooth.no-ip.com, Port 8196. If you don't
            already have the ecmclient program, you can download it from
            http://ElevenSmooth.com/ElevenDown.html

            William
            ==================================
            ElevenSmooth: Distributed Factoring of 2^3326400-1
            http://ElevenSmooth.com
          • elevensmooth
            ... The search is nearly finished for 35 digit factors (B1=1M). A special thank-you to the person that contributed two machines for few days. I m going to
            Message 5 of 6 , Apr 1, 2004
            • 0 Attachment
              > I've put the 1028 digit composite from 2^3511+1 into
              > an ECM server that also has other numbers from ElevenSmooth.
              >
              > The ecm server is at elevensmooth.no-ip.com, Port 8196.

              The search is nearly finished for 35 digit factors (B1=1M).
              A special thank-you to the person that contributed two machines
              for few days. I'm going to complete the 35 digit search and perhaps
              100 curves of the 40 digit search. At that time I'll dump
              the number unless other people have joined the search.

              William
              ==================================
              ElevenSmooth: Distributed Factoring of 2^3326400-1
              http://ElevenSmooth.com
            • mistermac39
              Message 6 of 6 , Apr 5, 2004
              • 0 Attachment
                --- In primenumbers@yahoogroups.com, "elevensmooth"
                <elevensmooth@y...> wrote:
                > --- In primenumbers@yahoogroups.com, "mistermac39" <mistermac39@h...>
                > wrote:
                >
                > > (b) 2^3511+1
                >
                > Will Edgington is the source for latest information on Mersenne
                > Factors. He will list factors for this under M(7022).
                > http://www.garlic.com/~wedgingt/mersenne.html
                >
                > Dario Alpern usually has the recent information in his Java applet.
                > Note that the smaller factors are not stored, so you need to let it
                > run a few curves to find them.
                > http://www.alpertron.com.ar/ECM.HTM
                >
                > 3 x 1537819 x 6151273 x 7615213345961363 x C1028
                > ====================
                > ElevenSmooth: Distributed Factoring of 2^3326400-1
                > http://ElevenSmooth.com
              Your message has been successfully submitted and would be delivered to recipients shortly.