pgms.maths.bignum ... 2p51+26p2 //13oddigfac

22.11.01  17:32

============

bugss   h.help


YES  *spooling.  *ram. sumryfact

Thu,22 Nov 2001.17:27:05

from program c24, (factor credit card nos.)


prob  #  ,  value,    FACTORS  ,  (centi)seconds.  ()

---   ---   ---   ---   ---   ---   ---   ---   ---   

2  n1..=4000000000000027= 31*31*137*24889*1220699*all  4s.

3  2^51..=2251799813685248= 2^51.0000000000000071*  1cs


2^51+prob^2.

4  d+1..=2251799813685249= 3*3*307*2857*6529*43691*all  77cs

5  d+9..=2251799813685257= 11*17*73*164954934707prime  50s.

6  d+25..=2251799813685273= 3*750599937895091? >46201^3 cofactor?  9s.

7  d+49..=2251799813685297= 3*1427*83267*6317011prime  22s.

8  d+prob^2..=2251799813685312= 2^4*3*11*19*2^2*3*3*331*18837001*all  25cs

9  d+prob^2..=2251799813685329= 2251799813685329? >46201^3 cofactor?  9s.

10  d+prob^2..=2251799813685348= 2^2*3*3*137*456569305289prime  1mn

11  d+prob^2..=2251799813685369= 3*19*1091*1993*18168659*all  50cs

12  d+prob^2..=2251799813685392= 2^4*140737488355337? >46201^3 cofactor?  9s.

13  d+prob^2..=2251799813685417= 3*750599937895139? >46201^3 cofactor?  9s.

13x odd digits in factor xx******

2^51+13^2.************


14  d+prob^2..=2251799813685444= 2^2*3*11*17*1003475852801prime  1mn

15  d+prob^2..=2251799813685473= 28649*78599595577prime  39s.

10x odd digits in factor;


16  d+prob^2..=2251799813685504= 2^4*3*2^4*2932031007403prime  2mn

17  d+prob^2..=2251799813685537= 3*3*41*59*103431161347prime  43s.

18  d+prob^2..=2251799813685572= 2^2*562949953421393? >46201^3 cofactor?  9s.

19  d+prob^2..=2251799813685609= 3*11*3*3*401*419*2579*17497*all  19cs

20  d+prob^2..=2251799813685648= 2^4*3*17*27691*99655433*all  5s.

21  d+prob^2..=2251799813685689= 8761*257025432449prime  59s.

continu.

22  h..=257025432449= 257025432449prime  59s.


25  d+prob^2..=2251799813685873= 3*11*113*281*7219*297683*all  1s.

26  d+prob^2..=2251799813685924= 2^2*3*3*3465731*18048139prime  5mn

contin.

2^51+26^2 = 0123 4567 89.*************



*  bug?  until false.



problem # =27.   * = 18048139  Repeat n1.


d+prob^2..=2251799813685924= 2^2*3*3*3465731*18048139prime

  Time speed,  sec = 428.060000000000002

>>27  d+prob^2..=2251799813685924= 2^2*3*3*3465731*18048139prime  7mn


factor no. expression     0, q.uit. +, datum   h,  help  *, display


PLEASE ENTER) numeric expression/no. 

n,n1,d (may refer to last factor n/test n1/ or Datum, d)

 e.g. n1+30.   r.andom test =r,  or

<CR>,  very easy (a)gain,  repeat similar formula.?0

enter = close ,  or <ESC> resume.?

e n d. close *spool



             GP/PARI CALCULATOR Version 1.36

                 (Archimedes version)


    Authors: C. Batut, D. Bernardi, H. Cohen and M. Olivier


Type \d, \c, \t, or ?command for help, \q to exit, # for timing


\precision      = 28

\serieslength   = 16

\format         = g0.28

\prompt         = ? 

stacksize = 1000000, prime limit = 200000, buffersize = 30000

? #

    timer on

? smallfact(2^51+26^2)

time = 670 ms

%1 = 

|2 2 |


|3 2 |


|62549994824609 1 |



? isprime(62549994824609)

time = 10 ms

%2 = 0

? factor(62549994824609)   

time = 10,450 ms

%3 = 

|3465731 1 |


|18048139 1 |



? smallfact(2^51+15^2)

time = 680 ms

%4 = 

|28649 1 |


|78599595577 1 |


xx 10x odd digits factor.


? isprime(78599595577)

time = 70 ms

%5 = 1


? smallfact(2^51+13^2)

time = 850 ms

%6 = 

|3 1 |


|750599937895139 1 |



? isprime(750599937895139)

time = 120 ms

%7 = 1


13x odd digits factor.


? smallfact(2^51+26^2)

time = 670 ms

%8 = 

|2 2 |


|3 2 |


|62549994824609 1 |



? isprime(62549994824609)

time = 10 ms

%9 = 0

? factor(62549994824609) 

time = 11,940 ms

%10 = 

|3465731 1 |


|18048139 1 |



? \q.

*sp.