Prime factorization. Outputs factors to alpha register. It's a very
naive algoritm (tries every number, not just primes) and will not be
efficient for large numbers.
A previous version of this progam changed display mode to ALL to
append integers. Then I learned about AIP. Learning is good.
Input:
X: number to factor
Output:
Alpha: space separated list of prime factors
LASTX: input number
Registers:
00: input number
01: current number to factor
02: current test factor
00 { 57-Byte Prgm }
01 LBL "PFCTR"
02 STO 00
03 STO 01
04 CLA
05 2
06 STO 02
07 LBL A
08 MOD
09 X=0?
10 GTO B
11 GTO C
12 LBL B
13 RCL 01
14 RCL 02
15 AIP
16 |-" "
17 /
18 STO 01
19 GTO D
20 LBL C
21 1
22 STO+ 02
23 LBL D
24 RCL 01
25 RCL 02
26 X<=Y?
27 GTO A
28 RCL 00
29 STO ST L
30 AVIEW
31 END
