hardtest.
02.03.01  08:45

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.

continue enter.

prog c21 (only fails) for numbers up to 2^52 if
1 prime factor exceeds 46,000 and the portion remaining is q > 2e9.
I hope to work on that.
results are UNRELIABLE  /  raise warning/  if no. > 2e9 contains
a fractional (i.e. decimal) part.  e.g. 2e9*sqr2.
fix is remove the decimal part.
numbers < 2e9, regarded as integers, may be dealt to very quickly.

method. basic64 cannot test if n/ 2 is an integer when
n = bignum > 2^32.  so this is what don does..
test highest common factor hcf(n, primorial 19#), e.g. 19# =
2*3*5*7*11*13*17*19 =  (17.19)(3)(7.11.13)(2.5) = 323*3*1001*10 = 9699690.

intended help / advanced
bigfactors, factorcred.itcardnos, primorlfac.
increase level of difficulty, currently 0/4.

0 primary < 100 = 10*10 = 2*5*2*5.
1 secondary < 46,000,    rnd(19)*30*77+prime
2 loto  < 2e9    rnd(200)* 30 030*323 + prime.
3 university  < 46 000 * 2e9.
4 king, number theory,  4.26*10^15  (16 DIGITS)    RND(606)*37#+PRIME.
6 datum,  (2^48, 4e15)  for future --..
+,-   offset  +-3.  or (n1+-x)
<esc>  quit.
enter ,  8  shuffle. give me different nos of similar magnitude
RND(-9999)   seed, personalise your random nos. e.g. (password.)

continue enter

10    suggest/ choose/ demo /  is prime?  _____    (levels 3,4,5 2^..)
11
12
13.
14 summary problems,  formula , factors, seconds time.
15 or enter number expression.

 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.


9 21 32 43 55 67 83 102 120 138 156 173 192 210 227 245 263 282 
300 318 336 353 371 389 407 425 444 462 480 498 517 535 552 570 
588 606 624 642 660 678 695 714 732 750 769 786 805 822 842 859 
877 895 913 930 947 965 984 1003 1019 1038 1055 1074 1092 1110 
1128 1146 1163 1181 1200 1216 1237 1253 1273 1290 1309 1327 1344 
1362 1381 1398 1415 1434 1451 1470 1487 1505 1523 1541 1558 1576 
1595 1613 1631 1648 1667 1685 1704 1721 1739 1756 1774 1792 1811 
1829 1846 1863 1882 1900 1919 1938 1953 1972 1991 2009 2028 2044 
2063 2080 2098 2116 2133 2152 2171 2187 2205 2224 2242 2261 2278 
2296 2315 2331 2349 2368 2385 2404 2422 2439 2458 2475 2493 2510 
2528 2546 2563 2581 2600 2618 2636 2653 2672 2690 2708 2725 2742 
2761 2780 2796 2815 2833 2852 2869 2887 2907 2924 2942 2961 2978 
2995 3014 3031 3050 3068 3085 3103 3121 3140 3159 3177 3195 3212 
3229 3248 3265 3283 3301 3319 3337 3354 3372 3390 3409 3426 3444 
3462 3480 3499 3516 3535 3552 3571 3588 3606 3625 3644 3660 3677 
3695 3713 3731 3750 3768 3785 3806 3822 3841 3858 3877 3893 3911 

need to calc product of 2 primes also,
have done.. p3 to sqr(2^31) and then higher    46340.95

3925  Primorials order 2.14744194E9
Now ready to FIND FACTORS.

problem # =1.   demo = 4000000000000027  Repeat n1.
  Time speed,  sec = 11.5700000000000003

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 39220424865882

2 )hard 2359794726869747

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?2
this may take minutes because you asked for hard.
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2.360E15   ****
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2359794726869747 ****
PROCtest.
= 2^ 51.0675827916233089
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    48577718.4197626486   
cofactor too big.
  n, n/Q%(1) > t = 2359794726869747  51076702384.5749435
Unknown or missing variable at erl. 1900
problem # =2.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2359794726869747  Repeat n1.
  Time speed,  sec = 31.0800000000000019

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 6404348445992

2 )hard 4244662213111447

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?2
this may take minutes because you asked for hard.
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4.245E15   ****
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4244662213111447 ****
PROCtest.
= 2^ 51.9145711731172739
factor  2.4E13    *1.8E2   
factor  23713196721293  *179
179 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    4869619.77173711173   
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  13084cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,928411  23238cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1373611  33028cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1818811  42670cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2264011  52787cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2709211  62889cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,3154411  72423cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,3599611  81501cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,4044811  90576cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,4490011  99644cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
23713196721293 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
problem # =3.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4244662213111447  Repeat n1.
  Time speed,  sec = 1091.67000000000007

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 42951026083152

2 )hard 4200137784302531

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?1
 RND(2^15.5)*RND(2^31-1) = 4.295E13   ****
 RND(2^15.5)*RND(2^31-1) = 42951026083152 ****
PROCtest.
= 2^ 45.2877578307293121
factor  3.3E11    *1.3E2   
factor  325386561236  *132
2 ^2 = 4 * 33
3 pri *11
11 = prime factor.
***
factor  7.4E9     *4.4E1   
factor  7395149119  *44
2 ^2 = 4 * 11
11 = prime factor.
***
factor  4.5E7     *1.6E2   
factor  45369013  *163
163 = prime factor.
***
4231 pri *10723
10723 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =4.    RND(2^15.5)*RND(2^31-1) = 42951026083152  Repeat n1.
  Time speed,  sec = 0.70000000000000007

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?2E9*SQR2
2E9*SQR2 = 2.828E9    ****
2E9*SQR2 = 2828427124.74619007 ****
PROCtest.
= 2^ 31.3973528539862592
factor  7.1E8     *4.0E0   
factor  707106781.186547518  *4
2 ^2 = 4 * 1
***
1499 pri *471719
471719 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =5.   2E9*SQR2 = 2828427124.74619007  Repeat n1.
  Time speed,  sec = 0.25

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 32806232624554

2 )hard 526872407571521

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?1
 RND(2^15.5)*RND(2^31-1) = 3.281E13   ****
 RND(2^15.5)*RND(2^31-1) = 32806232624554 ****
PROCtest.
= 2^ 44.8990351618650365
factor  7.1E11    *4.6E1   
factor  713178970099  *46
2 ^1 = 2 * 23
23 = prime factor.
***
factor  2.3E10    *3.1E1   
factor  23005773229  *31
31 = prime factor.
***
factor  4.3E8     *5.3E1   
factor  434071193  *53
53 = prime factor.
***
349 pri *1243757
773 pri *1609
1609 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =6.    RND(2^15.5)*RND(2^31-1) = 32806232624554  Repeat n1.
  Time speed,  sec = 0.23000000000000001

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 56131807623438

2 )hard 1009220386334231

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?

1 )easy 10878156001683

2 )hard 3962674163988779

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?

1 )easy 19734570196390

2 )hard 949854481255697

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?-25
seed s1 =        -25

1 )easy 30002229076247

2 )hard 1536092793905827

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?1
 RND(2^15.5)*RND(2^31-1) = 3.000E13   ****
 RND(2^15.5)*RND(2^31-1) = 30002229076247 ****
PROCtest.
= 2^ 44.7701349261828412
factor  2.3E11    *1.3E2   
factor  229024649437  *131
131 = prime factor.
***
factor  1.4E9     *1.6E2   
factor  1405059199  *163
163 = prime factor.
***
29173 pri *48163
48163 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =7.    RND(2^15.5)*RND(2^31-1) = 30002229076247  Repeat n1.
  Time speed,  sec = 3.89999999999999991

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 60160672133386

2 )hard 1751294199815309

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?2
this may take minutes because you asked for hard.
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1.751E15   ****
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1751294199815309 ****
PROCtest.
= 2^ 50.6373428857008108
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    41848467.1142839938   
cofactor too big.
  n, n/Q%(1) > t = 1751294199815309  37905980386.0372925
Unknown or missing variable at erl. 1900
problem # =8.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1751294199815309  Repeat n1.
  Time speed,  sec = 31.0300000000000011

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%)
 random test (hard) =r. ?r
generate random no.

1 )easy 12857343277440

2 )hard 304250263527397

o.k.?  enter choice 1 or 2, change = enter,
  or seed new random sequence     enter repeatable no. minus integer?2
this may take minutes because you asked for hard.
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3.043E14   ****
 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 304250263527397 ****
PROCtest.
= 2^ 48.1122518409578177
factor  1.6E12    *1.9E2   
factor  1627006756831  *187
11 pri *17
17 = prime factor.
***
factor  2.8E10    *5.9E1   
factor  27576385709  *59
59 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    166061.391385836585   
,,,,,,,,,,,,,,,
27576385709 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
problem # =9.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 304250263527397  Repeat n1.
  Time speed,  sec = 67.4500000000000028

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


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.

continue enter.

prog c21 (only fails) for numbers up to 2^52 if
1 prime factor exceeds 46,000 and the portion remaining is q > 2e9.
I hope to work on that.
results are UNRELIABLE  /  raise warning/  if no. > 2e9 contains
a fractional (i.e. decimal) part.  e.g. 2e9*sqr2.
fix is remove the decimal part.
numbers < 2e9, regarded as integers, may be dealt to very quickly.

method. basic64 cannot test if n/ 2 is an integer when
n = bignum > 2^32.  so this is what don does..
test highest common factor hcf(n, primorial 19#), e.g. 19# =
2*3*5*7*11*13*17*19 =  (17.19)(3)(7.11.13)(2.5) = 323*3*1001*10 = 9699690.

intended help / advanced
bigfactors, factorcred.itcardnos, primorlfac.
increase level of difficulty, currently 0/4.

0 primary < 100 = 10*10 = 2*5*2*5.
1 secondary < 46,000,    rnd(19)*30*77+prime
2 loto  < 2e9    rnd(200)* 30 030*323 + prime.
3 university  < 46 000 * 2e9.
4 king, number theory,  4.26*10^15  (16 DIGITS)    RND(606)*37#+PRIME.
6 datum,  (2^48, 4e15)  for future --..
+,-   offset  +-3.  or (n1+-x)
<esc>  quit.
enter ,  8  shuffle. give me different nos of similar magnitude
RND(-9999)   seed, personalise your random nos. e.g. (password.)

continue enter

10    suggest/ choose/ demo /  is prime?  _____    (levels 3,4,5 2^..)
11
12
13.
14 summary problems,  formula , factors, seconds time.
15 or enter number expression.

 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.


9 21 32 43 55 67 83 102 120 138 156 173 192 210 227 245 263 282 
300 318 336 353 371 389 407 425 444 462 480 498 517 535 552 570 
588 606 624 642 660 678 695 714 732 750 769 786 805 822 842 859 
877 895 913 930 947 965 984 1003 1019 1038 1055 1074 1092 1110 
1128 1146 1163 1181 1200 1216 1237 1253 1273 1290 1309 1327 1344 
1362 1381 1398 1415 1434 1451 1470 1487 1505 1523 1541 1558 1576 
1595 1613 1631 1648 1667 1685 1704 1721 1739 1756 1774 1792 1811 
1829 1846 1863 1882 1900 1919 1938 1953 1972 1991 2009 2028 2044 
2063 2080 2098 2116 2133 2152 2171 2187 2205 2224 2242 2261 2278 
2296 2315 2331 2349 2368 2385 2404 2422 2439 2458 2475 2493 2510 
2528 2546 2563 2581 2600 2618 2636 2653 2672 2690 2708 2725 2742 
2761 2780 2796 2815 2833 2852 2869 2887 2907 2924 2942 2961 2978 
2995 3014 3031 3050 3068 3085 3103 3121 3140 3159 3177 3195 3212 
3229 3248 3265 3283 3301 3319 3337 3354 3372 3390 3409 3426 3444 
3462 3480 3499 3516 3535 3552 3571 3588 3606 3625 3644 3660 3677 
3695 3713 3731 3750 3768 3785 3806 3822 3841 3858 3877 3893 3911 

need to calc product of 2 primes also,
have done.. p3 to sqr(2^31) and then higher    46340.95

3925  Primorials order 2.14744194E9
Now ready to FIND FACTORS.

problem # =1.   demo = 4000000000000027  Repeat n1.
  Time speed,  sec = 25.7199999999999989

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  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
problem # =2.   n1 = 4000000000000027  Repeat n1.
  Time speed,  sec = 16.6000000000000014

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?r

37411350214350

o.k.?  enter 1, change = enter,  or seed new random sequence
 enter repeatable no. minus integer?1
 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
problem # =3.    RND(2^15.5)*RND(2^31-1) = 37411350214350  Repeat n1.
  Time speed,  sec = 0.27000000000000002

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?r

79306623558974

o.k.?  enter 1, change = enter,  or seed new random sequence
 enter repeatable no. minus integer?1
 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
problem # =4.    RND(2^15.5)*RND(2^31-1) = 79306623558974  Repeat n1.
  Time speed,  sec = 0.91000000000000003

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3.339E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3339332160664541 ****
PROCtest.
= 2^ 51.5684810275558974
factor  2.5E12    *1.4E3   
factor  2453587186381  *1361
1361 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    1566393.0497742258    
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  12863cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,928411  22832cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1373611  32696cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,
2453587186381 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
problem # =5.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3339332160664541  Repeat n1.
  Time speed,  sec = 379.990000000000009

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?0
enter = close ,  or <ESC> resume.?
Escape at erl. 1182
problem # =6.   0 = 3339332160664541  Repeat n1.
  Time speed,  sec = 422.019999999999982

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?r

5687699840248

o.k.?  enter 1, change = enter,  or seed new random sequence
 enter repeatable no. minus integer?
Escape at erl. 1192
problem # =7.    RND(2^15.5)*RND(2^31-1) = 3339332160664541  Repeat n1.
  Time speed,  sec = 451.350000000000023

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?  RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4.156E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4155613355493823 ****
PROCtest.
= 2^ 51.8839828532838965
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    64464046.9990352318   
cofactor too big.
  n, n/Q%(1) > t = 4155613355493823  89946394136.3568573
Unknown or missing variable at erl. 1900
problem # =8.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 4155613355493823  Repeat n1.
  Time speed,  sec = 30.6099999999999994

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?n$

Type mismatch: number needed at erl. 1196
problem # =9.   n$ = 4155613355493823  Repeat n1.
  Time speed,  sec = 83.2999999999999972

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3.688E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3688106853000767 ****
PROCtest.
= 2^ 51.711801877901209
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    60729785.5504262969   
cofactor too big.
  n, n/Q%(1) > t = 3688106853000767  79827424796.0166931
Unknown or missing variable at erl. 1900
problem # =10.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3688106853000767  Repeat n1.
  Time speed,  sec = 30.6000000000000014

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2.976E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2975715992058877 ****
PROCtest.
= 2^ 51.4021582627938045
factor  2.6E13    *1.1E2   
factor  26333769841229  *113
113 = prime factor.
***
factor  1.7E11    *1.6E2   
factor  167731018097  *157
157 = prime factor.
***
factor  7.0E8     *2.4E2   
factor  701803423  *239
239 = prime factor.
***
701803423 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =11.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2975715992058877  Repeat n1.
  Time speed,  sec = 3.53000000000000025

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
?  RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3.043E14   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 304250263527289 ****
PROCtest.
= 2^ 48.1122518409573061
factor  3.0E12    *1.0E2   
factor  2953886053663  *103
103 = prime factor.
***
factor  8.2E9     *3.6E2   
factor  8228094857  *359
359 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    90708.8466303039313   
,,,,,,
8228094857 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
problem # =12.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 304250263527289  Repeat n1.
  Time speed,  sec = 49.6799999999999997

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
? RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3.911E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3910728997045091 ****
PROCtest.
= 2^ 51.7963589879761415
factor  1.8E13    *2.2E2   
factor  17695606321471  *221
13 pri *17
17 = prime factor.
***
factor  1.4E12    *1.3E1   
factor  1361200486267  *13
13 = prime factor.
***
,,,,,,factor  1.6E8     *8.6E3   
factor  158297533  *8599
8599 = prime factor.
***
158297533 = prime factor.
***
 complete.

Unknown or missing variable at erl. 1680
problem # =13.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3910728997045091  Repeat n1.
  Time speed,  sec = 7.0600000000000005

factor no. expression, max 2^52 = 4E15   0, q.uit. + next
PLEASE ENTER) numeric expression/no. or  n$  n  n1=repeat  P%(J%) random test=r. 
? RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56))
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2.597E15   ****
RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2597258347183727 ****
PROCtest.
= 2^ 51.2059109481713008
factor  9.4E12    *2.8E2   
factor  9376383924851  *277
277 = prime factor.
***
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
> pmax. continue using test, to sqrn = 46201    3062088.16412117705   
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,483211  12861cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,928411  22843cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1373611  32521cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,1818811  41464cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2264011  51088cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,2709211  61171cs. <esc>
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
9376383924851 ( is prime), repeat last factor enter n
(5 beepsx 5sec.)
problem # =14.   RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 2597258347183727  Repeat n1.
  Time speed,  sec = 701.75

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