Yes.
end enter:  0,q,Q, closes *ram.spcopr


prog acorncpusr.c2//c1//c23,// copr2p15.
IMPORTANT needs basic64.  (SciCalc)   1.03.01 23;06 nzdt*.


by don.mcdonald@nzpca.org.nz, 
factorise numbers up to 2^52+1. = 4*10^15.
  Ex. 4E15+7 = 911* 46 8883* 9364339.  Ex. 2^52+3. =373* 1207 399 363 9063.
difficult test = 2^16^3+1. beeps.

may fail if p x (q*r) > 46,200 x (2^31).  try random test.  = r.
 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 = 31.3500000000000014

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
Enter   n$  n  n1=repeat  P%(J%) random test=r. ?2^16^3+1
2^16^3+1 = 2.815E14   ****
2^16^3+1 = 281474976710657 ****
PROCtest.
= 2^ 48.0000000000000071
factor  1.5E12    *1.9E2   
factor  1458419568449  *193
193 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    1207650.43305130303   
,,,
65537 = prime factor.
***

22253377 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
2^16^3+1 = 281474976710657  Repeat n1.  Time speed,  sec = 67.1500000000000057

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 = 2.815E14   ****
n1+2 = 281474976710659 ****
PROCtest.
= 2^ 48.0000000000000213
factor  3.3E11    *8.5E2   
factor  329982387703  *853
853 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    574440.934912372031   
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  15126cs. <esc>
,,,,,,,,,,
329982387703 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
n1+2 = 281474976710659  Repeat n1.  Time speed,  sec = 181.879999999999996

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 = 2.815E14   ****
n1+2 = 281474976710661 ****
PROCtest.
= 2^ 48.0000000000000284
factor  9.4E13    *3.0E0   
factor  93824992236887  *3
3 pri *1
***
factor  1.4E12    *6.7E1   
factor  1400373018461  *67
67 = prime factor.
***
,,factor  4.7E8     *3.0E3   
factor  466635461  *3001
3001 = prime factor.
***
3203 pri *145687
145687 = prime factor.
***
 complete.

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

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 = 2.815E14   ****
n1+2 = 281474976710663 ****
PROCtest.
= 2^ 48.0000000000000355
factor  1.2E13    *2.3E1   
factor  12238042465681  *23
23 = prime factor.
***
factor  6.2E10    *2.0E2   
factor  62122042973  *197
197 = prime factor.
***
factor  7.6E7     *8.2E2   
factor  75666313  *821
821 = prime factor.
***
75666313 = prime factor.
***
 complete.

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

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 = 2.815E14   ****
n1+2 = 281474976710665 ****
PROCtest.
= 2^ 48.0000000000000497
factor  5.6E13    *5.0E0   
factor  56294995342133  *5
5 = prime factor.
***
,,,,,,,,,factor  5.1E9     *1.1E4   
factor  5085824857  *11069
11069 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    71314.9693753001629   
,,,
5085824857 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
n1+2 = 281474976710665  Repeat n1.  Time speed,  sec = 68.460000000000008

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