04-06-2008, 02:33 PM
I'm not the most efficient programmer in the box. I've written a little program to calculate the partial sums of the function stored in F, iterated as K goes from A to B. Is this about as efficient (minimal steps) the program can get?
Partial SumsThanks for any suggestions,F001 LBL F
F002 1 ÷ K^2
F003 RTN
A001 LBL A
A002 0
A003 STO S
A004 INPUT A
A005 INPUT B
A006 1000
A007 ÷
A008 STO+ A
A009 RCL A
A010 INTG
A011 STO K
A012 XEQ F001
A013 STO+ S
A014 ISG A
A015 GTO A009
A016 VIEW S
A017 RTN
CHUCK