Yes.

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



prog acorncpusr.c2//c1//c23,// copr2p15.

IMPORTANT needs basic64.  (SciCalc)   1.03.01 23;06 2.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.  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 # =91.   demo = 4000000000000027  Repeat n1.

0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 0nothing 

  Time speed,  sec = 11.6300000000000008


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 1150244993166


2 )hard 1476726888827251


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) = 1.150E12   ****

 RND(2^15.5)*RND(2^31-1) = 1150244993166 ****

PROCtest.

= 2^ 40.065078315280509

factor  1.9E11    *6.0E0   

factor  191707498861  *6

2 ^1 = 2 * 3

3 pri *1

***

factor  4.2E6     *4.6E4   

factor  4154999  *46139

29 pri *1591

37 pri *43

43 = prime factor.

***

4154999 = prime factor.

***

 complete.


Unknown or missing variable at erl. 1680

problem # =92.    RND(2^15.5)*RND(2^31-1) = 1150244993166  Repeat n1.

1150244993166=2^1*3*1*29*37*43*4154999*complete.

  Time speed,  sec = 0.41999999999999998


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 27454341891690


2 )hard 4103668188549983


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) = 2.745E13   ****

 RND(2^15.5)*RND(2^31-1) = 27454341891690 ****

PROCtest.

= 2^ 44.6420995623748098

factor  4.4E10    *6.3E2   

factor  43578320463  *630

2 ^1 = 2 * 315

3 pri *105

3 pri *35

5 pri *7

7 = prime factor.

***

factor  4.8E9     *9.0E0   

factor  4842035607  *9

3 pri *3

3 pri *1

***

factor  1.6E9     *3.0E0   

factor  1614011869  *3

3 pri *1

***

31 pri *52064899

1621 pri *32119

32119 = prime factor.

***

 complete.


Unknown or missing variable at erl. 1680

problem # =93.    RND(2^15.5)*RND(2^31-1) = 27454341891690  Repeat n1.

27454341891690=2^1*3*3*5*7*3*3*1*3*1*31*1621*32119*complete.

  Time speed,  sec = 0.38


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 15684321548552


2 )hard 727232337211531


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)) = 7.272E14   ****

 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 727232337211531 ****

PROCtest.

= 2^ 49.3694096804543534

,,,,,factor  1.0E11    *7.0E3   

factor  103875494531  *7001

7001 = prime factor.

***

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,

> pmax. continue using test, to INT sqrn = 46201 - 322297   

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,

103875494531 ( is prime), repeat last factor enter n

(5 beepsx 5sec.)

problem # =94.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 727232337211531  Repeat n1.

727232337211531=7001*103875494531

  Time speed,  sec = 102.930000000000007


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 694087631383


2 )hard 1016641124469179


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.017E15   ****

 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1016641124469179 ****

PROCtest.

= 2^ 49.8527319192996643

factor  4.9E12    *2.1E2   

factor  4864311600331  *209

11 pri *19

19 = prime factor.

***

factor  7.6E9     *6.4E2   

factor  7565025817  *643

643 = prime factor.

***

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,

> pmax. continue using test, to INT sqrn = 46201 - 86977    

,,,,,

7565025817 ( is prime), repeat last factor enter n

(5 beepsx 5sec.)

problem # =95.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1016641124469179  Repeat n1.

1016641124469179=11*19*643*7565025817

  Time speed,  sec = 50.230000000000004


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 5981057201106


2 )hard 3658423900461391


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.658E15   ****

 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3658423900461391 ****

PROCtest.

= 2^ 51.7001436727167842

,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,

> pmax. continue using test, to INT sqrn = 46201 - 60484906 

cofactor too big.

  n, n/Q%(1) > t = 3658423900461391  79184950552.182663

Unknown or missing variable at erl. 1900

problem # =96.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3658423900461391  Repeat n1.

3658423900461391=

  Time speed,  sec = 31.370000000000001

 used (  96)  problems  max. Pse save or overwrite.


enter problem # 1-95 to overwrite from onwards 

or (*)  spool = ram.sumryfact

- n (negative integ), quit.

?94

re enter /  bug //   to  confirm problem(s) to overwrite?94


Type mismatch: number needed at erl. 3073

problem # =95.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 3658423900461391  Repeat n1.

3658423900461391=

  Time speed,  sec = 73.0799999999999983


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.    or simple <CR> ?

generate random no. <CR>  by simple return? yes** 


1 )easy 1862212260480


2 )hard 1855184533702739


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.855E15   ****

 RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1855184533702739 ****

PROCtest.

= 2^ 50.7204841210011281

factor  1.6E12    *1.2E3   

factor  1570859046319  *1181

1181 = prime factor.

***

,,,,factor  2.6E8     *6.1E3   

factor  256132243  *6133

6133 = prime factor.

***

13217 pri *19379

19379 = prime factor.

***

 complete.


Unknown or missing variable at erl. 1680

problem # =96.    RND(606)*2*3*5*7*11*13*17*19*23*29*31*37+P%(RND(56)) = 1855184533702739  Repeat n1.

1855184533702739=1181*6133*13217*19379*complete.

  Time speed,  sec = 5.98000000000000043

 used (  96)  problems  max. Pse save or overwrite.


enter problem # 1-95 to overwrite from onwards 

or (*)  spool = ram.sumryfact

- n (negative integ), quit.

?*

spool. 1 = yes

