Yes.
end enter < 4, closes *ram.spcopr


prog acorncpusr.c2//c1//c23,
IMPORTANT needs basic64.  (SciCalc)  28.02.01  1.03.01 nzdt*.


by don.mcdonald@nzpca.org.nz, 
factorise numbers up to 2^52+1. = 4*10^15.
  Ex. 4E15+7 = 911* 46 8883* 9364339.

may fail if p x (q*r) > 2^15.5 x (2^31).  try random test.
 SET DIR *adfs      dir acorncpusr.donwn*.pi.

PROCoprime2x3x5x7
REM p short coprimes, q +210K%, R% use, s complement
1,  11,  13,  17,  19,  23,  29,  31,  37,  41,  43,  47,  53,  
59,  61,  67,  71,  73,  79,  83,  89,  97,  101,  103,  107,  
109,  113,  121,  127,  131,  137,  139,  143,  149,  151,  157,  
163,  167,  169,  173,  179,  181,  187,  191,  193,  197,  199,  
209,  211,  221,  223,  227,  229,  233,  239,  241,  

PROCgenfactbase, generate factor base, R%()
copy Q%() = P%(),  K%=0. R% = 23# * 9.
  continue any key.


211 421 631 841 1051 1271 1471 1681 1891 2111 2311 2521 2731 
2953 3151 3361 3571 3793 4001 4201 4421 4621 4831 5041 5251 5461 
5671 5881 6091 6301 6521 6731 6931 7141 7351 7561 7781 7981 8191 
8401 8611 8821 9041 9241 9461 9661 9871 10091 10291 10501 10711 
10921 11131 11351 11551 11771 11971 12191 12391 12601 12811 13021 
13231 13441 13667 13861 14071 14281 14491 14701 14921 15121 15331 
15541 15761 15971 16171 16381 16591 16801 17011 17231 17431 17653 
17851 18061 18281 18481 18691 18901 19111 19321 19531 19751 19951 
20161 20381 20591 20803 21001 21211 21421 21631 21841 22051 22261 
22471 22681 22901 23113 23311 23521 23741 23941 24151 24371 24571 
24781 24991 25217 25411 25621 25841 26041 26251 26461 26671 26881 
27091 27301 27527 27733 27941 28141 28351 28571 28771 28981 29191 
29401 29611 29831 30031 30241 30451 30661 30871 31081 31301 31511 
31721 31921 32141 32341 32551 32761 32971 33181 33391 33601 33811 
34031 34231 34451 34651 34861 35081 35281 35491 35713 35911 36121 
36331 36541 36761 36961 37171 37381 37591 37801 38011 38221 38431 
38651 38851 39071 39271 39493 39701 39901 40111 40321 40531 40741 
40951 41161 41381 41581 41791 42001 42221 42421 42631 42841 43051 
43261 43471 43691 43891 44101 44311 44521 44731 44951 45151 45361 
45571 45791 46001 46201 
need to calc product of 2 primes also,
have done.. p3 to sqr(2^31) and then higher    46340.95

Now ready to FIND FACTORS.

demo = 4000000000000027  Repeat n1.  Time speed,  sec = 48.730000000000004

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?n1
n1 = 4.000E15   ****
n1 = 4000000000000027 ****
PROCtest.
= 2^ 51.8289214233104474
factor  1.3E14    *3.1E1   
factor  129032258064517  *31
31 = prime factor.
***
factor  4.2E12    *3.1E1   
factor  4162330905307  *31
31 = prime factor.
***
factor  3.0E10    *1.4E2   
factor  30381977411  *137
137 = prime factor.
***
factor  1.2E6     *2.5E4   
factor  1220699  *24889
24889 = prime factor.
***
1220699 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
n1 = 4000000000000027  Repeat n1.  Time speed,  sec = 27.5899999999999999

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 3.741E13   ****
 RND(2^15.5)*RND(2^31-1) = 37411350214350 ****
PROCtest.
= 2^ 45.0885412687212934
factor  1.8E11    *2.1E2   
factor  178149286735  *210
2 ^1 = 2 * 105
3 pri *35
5 pri *7
7 = prime factor.
***
factor  5.1E9     *3.5E1   
factor  5089979621  *35
5 pri *7
7 = prime factor.
***
factor  1.6E8     *3.1E1   
factor  164192891  *31
31 = prime factor.
***
107 pri *1534513
1534513 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 37411350214350  Repeat n1.  Time speed,  sec = 0.28999999999999998

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 7.931E13   ****
 RND(2^15.5)*RND(2^31-1) = 79306623558974 ****
PROCtest.
= 2^ 46.1725065960177048
factor  5.7E12    *1.4E1   
factor  5664758825641  *14
2 ^1 = 2 * 7
7 = prime factor.
***
factor  2.0E11    *2.9E1   
factor  195336511229  *29
29 = prime factor.
***
factor  3.2E9     *6.1E1   
factor  3202237889  *61
61 = prime factor.
***
factor  3.6E7     *8.9E1   
factor  35980201  *89
89 = prime factor.
***
35980201 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 79306623558974  Repeat n1.  Time speed,  sec = 0.95000000000000007

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 1.224E13   ****
 RND(2^15.5)*RND(2^31-1) = 12241639150416 ****
PROCtest.
= 2^ 43.4768619807694563
factor  1.7E10    *7.0E2   
factor  17438232408  *702
2 ^1 = 2 * 351
3 pri *117
3 pri *39
3 pri *13
13 = prime factor.
***
factor  2.9E9     *6.0E0   
factor  2906372068  *6
2 ^1 = 2 * 3
3 pri *1
***
factor  1.5E9     *2.0E0   
factor  1453186034  *2
2 ^1 = 2 * 1
***
2 ^1 = 2 * 726593017
73 pri *9953329
157 pri *63397
63397 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 12241639150416  Repeat n1.  Time speed,  sec = 0.16

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 5.688E12   ****
 RND(2^15.5)*RND(2^31-1) = 5687699840248 ****
PROCtest.
= 2^ 42.3709824695670037
factor  2.8E12    *2.0E0   
factor  2843849920124  *2
2 ^1 = 2 * 1
***
factor  1.4E12    *2.0E0   
factor  1421924960062  *2
2 ^1 = 2 * 1
***
factor  7.1E11    *2.0E0   
factor  710962480031  *2
2 ^1 = 2 * 1
***
factor  1.9E10    *3.7E1   
factor  19215202163  *37
37 = prime factor.
***
factor  5.3E6     *3.6E3   
factor  5318351  *3613
3613 = prime factor.
***
5318351 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 5687699840248  Repeat n1.  Time speed,  sec = 3.77000000000000002

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 8.328E13   ****
 RND(2^15.5)*RND(2^31-1) = 83275084347858 ****
PROCtest.
= 2^ 46.2429501437163353
factor  1.2E11    *7.0E2   
factor  118625476279  *702
2 ^1 = 2 * 351
3 pri *117
3 pri *39
3 pri *13
13 = prime factor.
***
factor  1.9E9     *6.1E1   
factor  1944679939  *61
61 = prime factor.
***
61 pri *31879999
199 pri *160201
160201 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 83275084347858  Repeat n1.  Time speed,  sec = 0.17999999999999999

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 6.575E13   ****
 RND(2^15.5)*RND(2^31-1) = 65745936219150 ****
PROCtest.
= 2^ 45.9019669571776632
factor  2.9E9     *2.3E4   
factor  2887392895  *22770
2 ^1 = 2 * 11385
3 pri *3795
3 pri *1265
5 pri *253
11 pri *23
23 = prime factor.
***
factor  5.8E8     *5.0E0   
factor  577478579  *5
5 = prime factor.
***
577478579 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 65745936219150  Repeat n1.  Time speed,  sec = 3.18000000000000016

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 1.770E13   ****
 RND(2^15.5)*RND(2^31-1) = 17702107796338 ****
PROCtest.
= 2^ 44.008986386288953
factor  1.3E12    *1.4E1   
factor  1264436271167  *14
2 ^1 = 2 * 7
7 = prime factor.
***
factor  1.2E10    *1.1E2   
factor  11600332763  *109
109 = prime factor.
***
factor  4.1E7     *2.8E2   
factor  41282323  *281
281 = prime factor.
***
641 pri *64403
64403 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 17702107796338  Repeat n1.  Time speed,  sec = 0.39000000000000001

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2^52
2^52 = 4.504E15   ****
2^52 = 4503599627370496 ****
PROCtest.
= 2^ 52
power of 2
2^52 = 4503599627370496  Repeat n1.  Time speed,  sec = 0.01

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2^52+1
2^52+1 = 4.504E15   ****
2^52+1 = 4503599627370497 ****
PROCtest.
= 2^ 52
factor  2.6E14    *1.7E1   
factor  264917625139441  *17
17 = prime factor.
***
> pmax. continue using test, to sqrn =      46201 16276290.2757182661 
cofactor too big.
  n, n/Q%(1) > t = 264917625139441  5734023617.22562313
Unknown or missing variable at erl. 1900
2^52+1 = 4503599627370497  Repeat n1.  Time speed,  sec = 50.9399999999999977

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?n1+2
n1+2 = 4.504E15   ****
n1+2 = 4503599627370499 ****
PROCtest.
= 2^ 52
factor  1.2E13    *3.7E2   
factor  12073993639063  *373
373 = prime factor.
***
> pmax. continue using test, to sqrn =      46201 3474765.26387941791 
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  15014cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,928411  25102cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1373611  35124cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1818811  45151cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2264011  55168cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2709211  65088cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,3154411  75091cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
12073993639063 ( is prime), repeat last factor enter n
n1+2 = 4503599627370499  Repeat n1.  Time speed,  sec = 822.930000000000064

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?1
1 = 1.000E0    ****
1 = 1 ****
***
 complete.
Unknown or missing variable at erl. 1480
1 = 1  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2
2 = 2.000E0    ****
2 = 2 ****
2 ^1 = 2 * 1
***
 complete.
Unknown or missing variable at erl. 1480
2 = 2  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?3
3 = 3.000E0    ****
3 = 3 ****
3 pri *1
***
 complete.
Unknown or missing variable at erl. 1480
3 = 3  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?4
4 = 4.000E0    ****
4 = 4 ****
2 ^2 = 4 * 1
***
 complete.
Unknown or missing variable at erl. 1480
4 = 4  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?5
5 = 5.000E0    ****
5 = 5 ****
5 = prime factor.
***
 complete.
Unknown or missing variable at erl. 1480
5 = 5  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?6
6 = 6.000E0    ****
6 = 6 ****
2 ^1 = 2 * 3
3 pri *1
***
 complete.
Unknown or missing variable at erl. 1480
6 = 6  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?7
7 = 7.000E0    ****
7 = 7 ****
7 = prime factor.
***
 complete.
Unknown or missing variable at erl. 1480
7 = 7  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?8
8 = 8.000E0    ****
8 = 8 ****
2 ^3 = 8 * 1
***
 complete.
Unknown or missing variable at erl. 1480
8 = 8  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?9
9 = 9.000E0    ****
9 = 9 ****
3 pri *3
3 pri *1
***
 complete.
Unknown or missing variable at erl. 1480
9 = 9  Repeat n1.  Time speed,  sec = 0.03

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2^31
2^31 = 2.147E9    ****
2^31 = 2147483648 ****
PROCtest.
= 2^ 31.0000000000000036
power of 2
2^31 = 2147483648  Repeat n1.  Time speed,  sec = 0.01

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2^30
2^30 = 1.074E9    ****
2^30 = 1073741824 ****
2 ^30 = 1073741824 * 1
***
 complete.
Unknown or missing variable at erl. 1480
2^30 = 1073741824  Repeat n1.  Time speed,  sec = 0.02

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 2.184E12   ****
 RND(2^15.5)*RND(2^31-1) = 2183707050248 ****
PROCtest.
= 2^ 40.989916466745818
factor  1.1E12    *2.0E0   
factor  1091853525124  *2
2 ^1 = 2 * 1
***
factor  5.5E11    *2.0E0   
factor  545926762562  *2
2 ^1 = 2 * 1
***
factor  2.7E11    *2.0E0   
factor  272963381281  *2
2 ^1 = 2 * 1
***
factor  9.4E9     *2.9E1   
factor  9412530389  *29
29 = prime factor.
***
factor  1.8E8     *5.3E1   
factor  177594913  *53
53 = prime factor.
***
2591 pri *68543
68543 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 2183707050248  Repeat n1.  Time speed,  sec = 0.53000000000000003

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?r
 RND(2^15.5)*RND(2^31-1) = 7.689E13   ****
 RND(2^15.5)*RND(2^31-1) = 76893909031467 ****
PROCtest.
= 2^ 46.1279345565846555
factor  2.6E11    *3.0E2   
factor  258902050611  *297
3 pri *99
3 pri *33
3 pri *11
11 = prime factor.
***
factor  8.6E10    *3.0E0   
factor  86300683537  *3
3 pri *1
***
factor  6.4E6     *1.3E4   
factor  6435067  *13411
13411 = prime factor.
***
6435067 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
 RND(2^15.5)*RND(2^31-1) = 76893909031467  Repeat n1.  Time speed,  sec = 14.8300000000000001

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?q
enter = close ,  or <ESC> resume.?
e n d. close *spool



Yes.
end enter < 4, closes *ram.spcopr


prog acorncpusr.c2//c1//c23,
IMPORTANT needs basic64.  (SciCalc)  28.02.01  14;10   21;25 nzdt*.


by don.mcdonald@nzpca.org.nz, 26.02.01
factorise numbers up to 2^52+1. = 4*10^15.
  Ex. 4E15+7 = 911*46 888 3*9364339.

 SET DIR *adfs      dir acorncpusr.donwn*.pi.

PROCoprime2x3x5x7
REM p short coprimes, q +210K%, R% use, s complement
1,  11,  13,  17,  19,  23,  29,  31,  37,  41,  43,  47,  53,  
59,  61,  67,  71,  73,  79,  83,  89,  97,  101,  103,  107,  
109,  113,  121,  127,  131,  137,  139,  143,  149,  151,  157,  
163,  167,  169,  173,  179,  181,  187,  191,  193,  197,  199,  
209,  211,  221,  223,  227,  229,  233,  239,  241,  

PROCgenfactbase, generate factor base, R%()
copy Q%() = P%(),  K%=0. R% = 23# * 9.
  continue any key.


211 421 631 841 1051 1271 1471 1681 1891 2111 2311 2521 2731 
2953 3151 3361 3571 3793 4001 4201 4421 4621 4831 5041 5251 5461 
5671 5881 6091 6301 6521 6731 6931 7141 7351 7561 7781 7981 8191 
8401 8611 8821 9041 9241 9461 9661 9871 10091 10291 10501 10711 
10921 11131 11351 11551 11771 11971 12191 12391 12601 12811 13021 
13231 13441 13667 13861 14071 14281 14491 14701 14921 15121 15331 
15541 15761 15971 16171 16381 16591 16801 17011 17231 17431 17653 
17851 18061 18281 18481 18691 18901 19111 19321 19531 19751 19951 
20161 20381 20591 20803 21001 21211 21421 21631 21841 22051 22261 
22471 22681 22901 23113 23311 23521 23741 23941 24151 24371 24571 
24781 24991 25217 25411 25621 25841 26041 26251 26461 26671 26881 
27091 27301 27527 27733 27941 28141 28351 28571 28771 28981 29191 
29401 29611 29831 30031 30241 30451 30661 30871 31081 31301 31511 
31721 31921 32141 32341 32551 32761 32971 33181 33391 33601 33811 
34031 34231 34451 34651 34861 35081 35281 35491 35713 35911 36121 
36331 36541 36761 36961 37171 37381 37591 37801 38011 38221 38431 
38651 38851 39071 39271 39493 39701 39901 40111 40321 40531 40741 
40951 41161 41381 41581 41791 42001 42221 42421 42631 42841 43051 
43261 43471 43691 43891 44101 44311 44521 44731 44951 45151 45361 
45571 45791 46001 46201 
need to calc product of 2 primes also,
have done.. p3 to sqr(2^31) and then higher    46340.95

Now ready to FIND FACTORS.

demo = 4000000000000007  Repeat n1.  Time speed,  sec = 12.6600000000000001

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) ?4E15+25
4E15+25 = 4.000E15   ****
4E15+25 = 4000000000000025 ****
PROCtest.
= 2^ 51.8289214233104474
factor  6.0E12    *6.7E2   
factor  6015037593985  *665
5 pri *133
7 pri *19
19 = prime factor.
***
factor  1.7E11    *3.5E1   
factor  171858216971  *35
5 pri *7
7 = prime factor.
***
factor  2.5E10    *7.0E0   
factor  24551173853  *7
7 = prime factor.
***
factor  5.9E7     *4.2E2   
factor  58594687  *419
419 = prime factor.
***
997 pri *58771
58771 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
4E15+25 = 4000000000000025  Repeat n1.  Time speed,  sec = 0.54000000000000004

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) ?n1+2
n1+2 = 4.000E15   ****
n1+2 = 4000000000000027 ****
PROCtest.
= 2^ 51.8289214233104474
factor  1.3E14    *3.1E1   
factor  129032258064517  *31
31 = prime factor.
***
factor  4.2E12    *3.1E1   
factor  4162330905307  *31
31 = prime factor.
***
factor  3.0E10    *1.4E2   
factor  30381977411  *137
137 = prime factor.
***
factor  1.2E6     *2.5E4   
factor  1220699  *24889
24889 = prime factor.
***
1220699 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
n1+2 = 4000000000000027  Repeat n1.  Time speed,  sec = 27.4800000000000004

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) ?+
next add, n1+ 1.+ = 4.000E15   ****
+ = 4000000000000028 ****
PROCtest.
= 2^ 51.8289214233104474
factor  2.0E15    *2.0E0   
factor  2000000000000014  *2
2 ^1 = 2 * 1
***
factor  1.0E15    *2.0E0   
factor  1000000000000007  *2
2 ^1 = 2 * 1
***
factor  3.6E11    *2.8E3   
factor  360620266859  *2773
47 pri *59
59 = prime factor.
***
> pmax. continue using test, to sqrn =      46201 600516.666595524177 
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  14807cs. <esc>
,,,,,,,,,,,,,
360620266859 ( is prime), repeat last factor enter n
+ = 4000000000000028  Repeat n1.  Time speed,  sec = 174.300000000000011

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) ?+
next add, n1+ 1.+ = 4.000E15   ****
+ = 4000000000000029 ****
PROCtest.
= 2^ 51.8289214233104474
factor  1.3E15    *3.0E0   
factor  1333333333333343  *3
3 pri *1
***
> pmax. continue using test, to sqrn =      46201 36514837.1670112088 
cofactor too big.
  n, n/Q%(1) > t = 1333333333333343  28859404197.6005516
Unknown or missing variable at erl. 1900
+ = 4000000000000029  Repeat n1.  Time speed,  sec = 50.6799999999999997

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) ?0
e n d. close *spool
