HP 15c Manual

							  
 
271 
Subject Index 
Page numbers in bold type indicate primary references; page numbers in 
regular type indicate secondary references. 
A ___________________________________________  
Abbreviated key sequences, 78 
Absolute value (a ), 24 
Allocating memory, 42, 213-219 
Altering program lines, 83 
Annunciators, 
complex, 121 
list of, 60 
PRGM, 32, 66 
trigonometric, 26 
Antilogarithms, common and natural, 28 
Arithmetic operation, 29, 37 
Asymptotes, horizontal, 230 
Automatic incrementing of row and column numbers, 143 
B ___________________________________________  
Back-stepping (‚), 83 
Bacterial population example, 41 
Battery life, 259 
Battery replacement, 260, 259-260 
Bessel functions, 195, 197 
Branching, 
conditional, 91, 98, 177, 192 
indirect, 108-109, 112-114, 115 
simple, 90 
C ___________________________________________  
C annunciator, 99, 121 
Can volume and area example, 70-74 
Chain calculations, 22-23, 38 
Changing signs, 19 
in Complex mode, 124-125  
						

							272 Subject Index 
 
in matrices, 177 
“, 19 
Clearing 
blinking in display, 100 
complex numbers, 125-127 
display, 21 
memory, 63 
operations, 20-21 
overflow condition, 45, 61 
prefix keys, 19 
statistics registers, 49 
Coefficient matrix, 156 
Combinations function (c), 47 
Common pool, 213 
Complex arithmetic example, 132 
Complex conjugate, forming, 125 
Complex matrix, 
inverting, 162, 164, 165 
multiplying, 162, 164, 166 
storing elements, 161 
transforming, 162, 164 
Complex mode, 120-121 
activating, 99, 120-121, 133 
deactivating, 121 
mathematics functions in, 131 
stack lift in, 124 
Complex numbers, 
clearing, 125-127 
converting polar and rectangular forms, 133-135 
entering, 121, 127, 128-129 
storing and recalling, 130 
Conditionals, indirect, 109-111, 112, 116 
Conditional tests, 91, 98, 192 
in Complex mode, 132 
with matrix descriptors, 174 
Constant matrix, 156 
Constants, 
calculations with, 39-42 
using in arithmetic calculations, 35, 39-42  
						

							 Subject Index 273 
 
 
Continuous Memory, 
duration of, 62 
resetting (clearing), 63 
what it retains, 43, 48, 58, 61, 62 
Conventions, handbook, 18 
Conversions, 
degrees and radians, 27 
polar and rectangular coordinates, 30-31 
time and angle, 26-27 
Correcting accumulated statistics data, 52 
Correlation coefficient, find the (j), 55-56 
\,{, 26 
Counters in program loops, 98, 112-114 
Crocus example, 43 
Cumulative calculations, 41 
D ___________________________________________  
Data storage, 42 
Data storage pool, 213-214 
Debt payment example, 95 
Decimal point, 22 
Decimal point display, 61 
Deflation, 233, 234, 237 
D, 26 
Determinant, 150 
Digit entry, 22 
in Complex mode, 121, 125, 127, 128-129 
termination, 22, 36, 209 
Digit separator display, 61 
m, 76-77, 215-217 
Disabling stack lift, 36 
Display (See also X-register), 
blinking, 100 
clearing, 21 
error messages, 61 
full mantissa, 60 
in Complex mode, 121 
Display format, 58-59, 61 
effect on ´ 200, 241, 244, 245-249 
Do if True rule, 92, 192  
						

							274 Subject Index 
 
s 109-111, 112, 116 
E ___________________________________________  
‛, 19 
Electrical circuit example, 169-171 
Enabling stack lift, 36 
^, 59 
Engineering notation, 59 
v, 12, 33-34, 36 
effect on digit entry, 22, 29 
effect on stack movement, 37, 41 
Entering data for statistical analysis, 49 
Error 
conditions, 205-208 
display, 61 
stops, 78 
Errors, 
with f, 203-204 
with _, 187, 192, 193 
Euclidean norm (See Frobenius norm) 
Exchanging the real and imaginary stacks, 124 
Exponential function (See Power function) 
Exponents, 19, 20 
F ____________________________________________  
´, 18 
Factorial function (!), 25 
Falling stone example, 14 
•, 58 
Fixed decimal notation, 58 
Flag tests, 92, 98 
Flag 8, 99 
Flag 9, 100 
Format, handbook, 2, 18 
Fractional portion (q), 24 
Frobenius norm, 150, 177 
Functions, nonprogrammable, 80 
Functions, one-number, 22, 25 
Functions, primary and alternate, 18 
Functions, two-number, 22, 29  
						

							 Subject Index 275 
 
 
G ___________________________________________  
|, 18 
Gamma function (!), 25 
g, 26 
G, 101 
t, 90, 97, 98 
t “, 82 
H ___________________________________________  
Horners Method, 79, 181 Hyperbolic 
functions, 28 
I ____________________________________________  
Imaginary stack, 
clearing the, 124 
creation of, 121-123, 133 
display of, 124 
stack lift of, 124 
Index register 
arithmetic, 108, 112 
display format control, 109, 114, 115, 116 
exchange with X-register, 108, 112 
flag control, 109, 115 
loop control, 107, 109-111 
storage and recall, 107, 111, 115 
Indirect addressing, 106-108, 115 
Initialization, 87 
Instructions, 74 
Integer portion (‘), 24 
Integrate function (f), 194-204 
accuracy of, 200-203, 240, 241-245 
algorithm for, 196, 240-241, 249-251, 255-256 
display format with, 245-249 
execution time for, 196, 200, 244, 245, 254-256 
memory usage, 204 
obtaining an approximation for, 257-258 
problems with erratic functions, 249-254 
programmed, 203-204 
recursive use of, 203 
subroutines for, 194-195  
						

							276 Subject Index 
 
uncertainty in, 202-203, 240-244, 245-249 
Interchanging functions (See User mode) 
Interference, radio and television, 271 
Intermediate results, 22, 38 
Interpolation, using j, 57 
I, 109-111, 116 
Iterations using I and s, 111 
K ___________________________________________  
Keycodes, 74-75 
Keying in 
chain calculations, 22 
exponents, 19-20 
one-number functions, 22 
two-number functions, 22, 29 
L ____________________________________________  
Labels, 67, 77, 90, 97 
LAST X register, 35 
in matrix functions, 174-176 
operations saved by, 212 
putting constants in, 39-40 
to correct statistics data, 52 
Linear equations, solving with matrices, 138, 156 
Linear estimation (j), 55-56 
Linear regression (L), 54 
Loading the stack with constants, 39, 41 
Logarithmic functions, common and natural, 28 
Loop control number, 109, 116 
Looping, 90, 98 
Low-power indication, 62, 259 
LU decomposition, 148, 155, 156, 160 
Łukasiewicz, Jan, 32 
M ___________________________________________  
Mantissa, displaying full 10 digits, 60 
Matrix 
complex, 160-163 
copying, 149 
descriptors, 139, 147, 160, in RI, 173-174  
						

							 Subject Index 277 
 
 
dimensioning, 140, 142, 142, 174 
dimensions, displaying, 142, 147 
equation, complex, 168 
memory, 140, 171 
name (See Matrix descriptors) 
partitioned, 161, 164 
Matrix elements, 
accessing individually, 145-147 
displaying, 144 
storing and recalling, 143-144, 147, 149, 176 
Matrix functions, 
using RI, 173-174 
using registers, 173 
arithmetic, 153 
conditional, 177 
inverse, 150, 154 
multiplication, 154 
one-matrix, 149-151 
programmed, 176-177 
reciprocal, 150 
residual, 159 
row norm, 150, 177 
summary, 177-179 
transpose, 150, 151, 154 
Mean (’). 53 
W, 215 
Memory 
allocation, 76, 215-217 
availability, 75-77, 213, 215 
configuration, initial, 75-76 
distribution, 75, 213-214 
limitations, 75, 77, 217 
requirements for advanced functions, 218-219 
requirements for programming, 218 
stack (See Stack) 
status display, 215 
registers in, 213-215 
Metal box dimensions example, 189-191 
Minima, finding with _, 230 
Modes, trigonometric, 26  
						

							278 Subject Index 
 
Multiple roots, 234 
N ___________________________________________  
Negative numbers, 19 
in Complex mode, 124-125 
Nested calculations, 38 
Neutral operations, 211 
Nonprogrammable functions, 80 
Normalizing statistics data, 50 
null display, 144, 149 
Numerical integration, 194-204 
O ___________________________________________  
=, 
and off, 18 
to reset Continuous Memory, 63 
to set decimal point display, 61 
Overflow condition, 45, 61, 100 
P____________________________________________  
¥, 66, 68 
Pause (©), 68 
Percent difference (∆), 29 
Percentage functions, 29-30 
Permutations function (p), 47 
Phasor notation, 133 
Pi, 24 
Polar coordinates, 30, in Complex mode, 133-135 
Power function (y), 29 
Prefix keys, 19 
PRGM annunciator, 66, 82 
Program 
control, indirect, 107, 109-111 
data entry techniques, 69-70 
end, 68, 77 
entering, 66-68 
labels, 67, 77 
loading, 66 
loop counters, 109, 112-114, 116 
mode, 66, 68, 86  
						

							 Subject Index 279 
 
 
position, changing, 82, 86 
running, 68-69 
starting, 69 
stops, 68, 78 
Program execution, 69 
after G, 101 
after t, 97 
after overflow, 100 
after test, 92 
from or through labels, 78-79 
Program lines (instructions), 67, 74 
deleting, 83, 86 
inserting, 83, 86 
Program memory, 67, 70, 75, 217-219 
automatic real location, 217-218 
clearing, 67 
moving in, 67 
Q ___________________________________________  
Quadratic equation, solving, 181 
R ___________________________________________  
R0 and R1, using to access matrix elements, 143, 146, 176 
R, 26 
Radioisotope example, 93-94 
Random number generator (#), 48 
Random number storage and recall, 48 
Recall arithmetic, 44 
Recalling accumulated statistics data, 50 
Recalling numbers (l), 42, 44, with matrices, 144, 149, 176 
Reciprocal (∕), 25, with matrix, 150 
Rectangular coordinates, 31, in Complex mode, 133-135 
Registers, converting, 215-217 
Reset Continuous Memory, 63 
Residual, 159 
Result matrix, 147, 148, 150, 152 
Return (n), 68, 77 
Returns, pending, 101, 105, 192, 204 
Reverse Polish Notation, 32 
} 124, 127  
						

							280 Subject Index 
 
Rice yield example, 50-56 
Ridget hurling example, 184-186, 224-226 
Roll down, 34 
Roll up, 34 
Roots, eliminating, 233, 234, 237 
Roots, meaningless, 188, 191 
Rounding (&), 24 
Rounding in the display, 59 
Round-off errors, 52, 60, with _, 223, 237 
Row norm, 150, 177 
Run/Stop (¦), 68, 91 
running display, 69, 147, 182 
S ___________________________________________  
Scalar operations, 151-153 
i, 58 
Scientific notation, 58 
Scrolling, 82 
Secant line calculation example, 102 
Self-tests, 261 
Service information, 267-270 
Shear stress example, 227-228 
[, ,, 26 
Sine integral example, 198-199 
Single-stepping (Â), 82, 85 
Skip if True rule, 110 
Slope, finding the, 54 
_, 180-181 
accuracy, 222-226, specifying, 238 
algorithm, 182, 187-188, 220-222, 230-231 
conditions necessary for, 221-222 
constant function value with, 187, 189 
execution time, 238 
illegal math routine with, 187-188 
initial estimates with, 181, 188-192, 221, 233, 237 
memory usage, 193 
nonzero minimum of function with, 187 
programmed, 192 
recursive use of, 193 
restrictions on, 193