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

factoring example

Expand Messages
  • Kermit Rose
    Example of numbers factored by good luck by current algorithm I call s2m2. factor by gcd(t,z) 1
    Message 1 of 1 , Jun 23, 2006
    • 0 Attachment
      Example of numbers factored by good luck by current algorithm I call s2m2.

      factor by gcd(t,z) > 1
      [1000000000000000000000000000000000000000000000000000000000000000000000000000
      00000000000
      00000000000000000000000000000000000000000000000000000000000000000000000000000
      00000000000
      000000000000000000000013L,

      93409726447386985017819174285866699538925660195708680096156728465233279236684
      46027794088
      28630285383499636942096532759816213110956463539329045926415843637864578874788
      63740933647
      8937585385481860795759L,

      200,

      96130417597915122005191114716404761296434183100604424190703506682008215495915
      41635599014
      82298979517076147518141710413625298881914858778767438738595982983330525712062
      50242170972
      587030587264930190076403L,

      2251L]


      Found that 10^200 + 13 is divisible by 2251 in 200 iterations.

      I see that this is not significantly better than dividing by primes in
      succession.
    Your message has been successfully submitted and would be delivered to recipients shortly.