home

hp 41c

the 41c, first introduced in 1979 was another breakthrough for hp. highly programmable, with an extensive and expandable feature set together with alphanumeric display and naming capability.

rather than dot matrix, the display is a segmented lcd with additional segments so as to be able to display letters and a wide range of punctuation and other symbols. programs and functions could be given names and data input and output could be mixed with text. the user mode meant that your own programs could be attached to the keyboard rather than having to be called up by name.

the 41c has 63 registers' worth of storage. registers can be traded with program steps so that between 200 to 400 fully-merged steps are available. the initial setting is 46 program registers and 17 register memories.

the unit is highly expandable. on the top there are four sockets for expansion packs. these packs can have additional memory, rom programs or allow connection of custom peripherals like the card reader and the bar code wand.

programmatically it was excellent. an extensive function catalog, labels (global and local), subroutines (up to 6 deep), a wide selection of conditional branches, loop control (isg, dse), flags, indirect addressing and far easier debugging and editing due to the alphanumeric display of instructions.

the user manual introduces the machine thus,

the hp-41c and hp41-cv calculators represent a totally new concept in the design of hewlett-packard calculators. in fact, because of their advanced capabilities, these calculators can even be called personal computing systems.

with so many kinds of calculator users and applications in the world, we at hewlett-packard decided we could provide a significant contribution by designing and building quality calculators with expandable and flexible capabilities. the alphanumeric hp-41c and hp-41vc calculators are the results of that decision.

program example: sums of reciprocal powers

most people know that 1+1/2+1/3+1/4+... + 1/n diverges as n increases, but the sums of reciprocal squares converges. ie 1+1/(2^2)+1/(3^2)+1/(4^2)+... +1/(n^2) as n increases. the latter series converges to pi^2/6 in the limit.

more generally, we have z(s) = 1/(1^s)+1/(2^s)+1/(3^s)+... + 1/(n^s)
when s > 1, z(s) converges.

here is a program to calculate z(s) for s >= 2.

LBL "Z"
STO 00
1
STO 01
STO 02
STO 05
0
STO 06
STO 07
10
STO 09
STO 08
LBL 00
RCL 01
1/X
RCL 00
Y**X
RCL 02
*
ST+ 06
1
ST+ 01
RCL 02
CHS
STO 02
DSE 08
GTO 00
2
RCL 09
Y**X
STO 03
STO 04
LBL 01
RCL 05
ST- 04
RCL 01
1/X
RCL 00
Y**X
RCL 04
*
RCL 02
*
ST+ 07
1
ST+ 01
RCL 02
CHS
STO 02
RCL 09
RCL 08
-
RCL 08
1
+
STO 08
/
ST* 05
RCL 09
RCL 08
X<Y?
GTO 01
RCL 07
RCL 03
/
RCL 06
+
.5
RCL 00
1
-
Y**X
1
-
CHS
/
END
in particular, we can calculate the sum of reciprocal cubes as follows:

3 ENTER XEQ Z
to give 1.202056903 correct to 10 digits.

no one knows if there is a simple formula (eg in pi^3) for odd powers.

You can run this program yourself without having to have a 41c using the excellent v41 emulator here.