Page 2 - Legal Notice
Legal Notice This manual and any examples contained herein are provided “as is” and are subject to change without notice. Hewlett-Packard Company makes no warranty of any kind with regard to this manual, including, but not limited to, the implied warranties of merchantability non-infringement and fi...
Page 3 - Introduction; HP-15C Advanced Functions
3 Introduction Congratulations! Whether you are new to HP calculators or an experienced user, you will find the HP-15C a powerful and valuable calculating tool. The HP-15C provides: 448 bytes of program memory (one or two bytes per instruction) and sophisticated programming capability, including c...
Page 4 - Contents; Section 2: Numeric Functions
4 Contents The HP-15C: A Problem Solver .................................... 12 A Quick Look at v ................................................. 12 Manual Solutions ............................................................ 13 Programmed Solutions ..................................................
Page 10 - Appendix D: A Detailed Look at; Appendix E: A Detailed Look at
10 Contents Appendix A: Error Conditions .................................... 205 Appendix B: Stack Lift and the LAST X Register ............... 209 Digit Entry Termination .................................................... 209 Stack Lift ..............................................................
Page 12 - A Problem Solver; A Quick Look at
12 The HP-15C: A Problem Solver The HP-15C Advanced Programmable Scientific Calculator is a powerful problem solver, convenient to carry and easy to hold. Its continuous memory retains data and program instructions indefinitely until you choose to reset it. Though sophisticated, it requires no prior...
Page 13 - Manual Solutions; To Compute
The HP-15C: A Problem Solver 13 The display format used in this handbook is • 4 (the decimal point is ―fixed‖ to show four decimal places) unless otherwise mentioned. If your calculator does not show four decimal places, you may want to press ´• 4 to match the displays in the examples. Manual Soluti...
Page 14 - Programmed Solutions; Writing the Program.
14 The HP-15C: A Problem Solver The time an object takes to fall to the ground (ignoring air friction) is given by the formula g 2 h t , where t = time in seconds, h = height in meters, g = the acceleration due to gravity, 9.8 m/s 2 . Example: Compute the time taken by a stone falling from the top...
Page 15 - CLEAR; PRGM; Enter the following information to run the; Keystrokes; Height of the Eiffel Tower.
The HP-15C: A Problem Solver 15 Keystrokes Display |¥ 000- Sets HP-15C to Program mode. ( PRGM annunciator on.) ´ CLEAR M 000- Clears program memory. (This step is optional here.) ´bA 001-42,21,11 Label "A" defines the beginning of the program. 2 002- 2 * 003- 20 9 004- 9 The same keys you p...
Page 16 - . Find the time of descent for objects released from heights of
16 The HP-15C: A Problem Solver With this program loaded, you can quickly calculate the time of descent of an object from different heights. Simply key in the height and press ´A . Find the time of descent for objects released from heights of 100 m, 2 m, 275 m, and 2,000 m. The answers are: 4.5175 s...
Page 18 - Section 1; Getting Started; Power On and Off; Primary and Alternate Functions; function itself
18 Section 1 Getting Started Power On and Off The = key turns the HP-15C on and off. * To conserve power, the calculator automatically turns itself off after a few minutes of inactivity. Keyboard Operation Primary and Alternate Functions Most keys on your HP-15C perform one primary and two alternate...
Page 19 - Section 1: Getting Started; Prefix Keys; Changing Signs
Section 1: Getting Started 19 Notice that when you press the ´ or | prefix key, an f or g annunciator appears and remains in the display until a function key is pressed to complete the sequence. Prefix Keys A prefix key is any key which must precede another key to complete the key sequence for a fun...
Page 20 - The “CLEAR” Keys; Clearing; Clearing Sequence
20 Section 1: Getting Started Keystrokes Display 6.6262 6.6262 ‛ 6.6262 00 The 00 prompts you to key in the exponent. 3 6.6262 03 (6.6262×10 3 ). 4 6.6262 34 (6.6262×10 34 ). “ 6.6262 -34 (6.6262×10 -34 ). v 6.6262 -34 Enters number. 50 * 3.3131 -32 Joule-seconds. Note: Decimal digits from the manti...
Page 21 - if digit entry has not; stored as
Section 1: Getting Started 21 Clearing Sequence Effect ´ CLEAR M In Run mode: Repositions program memory to line 000. In Program mode: Deletes all program memory. ´ CLEAR Q Clears all data storage registers. ´ CLEAR u * Clears any prefix from a partially entered key sequence. * Also temporarily disp...
Page 22 - Calculations; One-Number Functions; Two-Number Functions and; Terminating Digit Entry.
22 Section 1: Getting Started Calculations One-Number Functions A one-number function performs an operation using only the number in the display. To use any one-number function, press the function key after the number has been placed in the display. Keystrokes Display 45 45 |o 1.6532 Two-Number Func...
Page 23 - Digit entry terminated.; Try your hand at the following problems. Each time you press
Section 1: Getting Started 23 Example: Calculate (9 + 17 4) ÷ 4. Keystrokes Display 9 v 9.0000 Digit entry terminated. 17 + 26.0000 (9 + 17). 4 - 22.0000 (9 + 17 – 4). 4 ÷ 5.5000 (9 + 17 – 4) ÷ 4. Even more complicated problems are solved in the same manner-using automatic storage and retrieval of...
Page 24 - Section 2; Numeric Functions; Pi
24 Section 2 Numeric Functions This section discusses the numeric functions of the HP-15C (excluding statistics and advanced functions). The nonnumeric functions are discussed separately (digit entry in section 1, stack manipulation in section 3, and display control in section 5). The numeric functi...
Page 25 - General Functions; Factorial and Gamma.
Section 2: Numeric Functions 25 Keystrokes Display 123.4567 |‘ 123.0000 |K “ |‘ -123.0000 Reversing the sign does not alter digits. |K ´q -0.4567 1.23456789 “ |& -1.2346 ´ CLEAR u (release) 1234600000 Temporarily displays all -1.2346 digits in the mantissa. |a 1.2346 One-Number Functions One-num...
Page 26 - Trigonometric Operations; Trigonometric Modes.; Time and Angle Conversions
26 Section 2: Numeric Functions Trigonometric Operations Trigonometric Modes. The trigonometric functions operate in the trigonometric mode you select. Specifying a trigonometric mode does not convert any number already in the calculator to that mode; it merely tells the calculator what unit of meas...
Page 27 - Degrees/Radians Conversions
Section 2: Numeric Functions 27 Hours.Decimal Hours Hours.Minutes Seconds Decimal Seconds (H.h) (H.MMSSs) Degrees.Decimal Hours Degrees.Minutes Seconds Decimal Seconds (D.d) (D.MMSSs) Hours/Degrees-Minutes-Seconds Conversion. Pressing ´ h converts the number in the display from a decimal hours/degre...
Page 28 - Logarithmic Functions
28 Section 2: Numeric Functions Logarithmic Functions Natural Logarithm. Pressing |Z calculates the natural logarithm of the number in the display; that is, the logarithm to the base e. Natural Antilogarithm. Pressing ' calculates the natural antilogarithm of the number in the display; that is, rais...
Page 29 - Two-Number Functions; keying in; The Power Function; To Calculate; Percentages
Section 2: Numeric Functions 29 Two-Number Functions The HP-15C performs two-number math functions using two values entered sequentially into the display. If you are keying in both numbers, remember that they must be separated by v or any other function – like | ‘ or ∕ – that terminates digit entry....
Page 30 - Polar and Rectangular Coordinate Conversions
30 Section 2: Numeric Functions For example, to find the sales tax at 3% and total cost of a $15.76 item: Keystrokes Display 15.76 v 15.7600 Enters the base number (the price). 3 |k 0.4728 Calculates 3% of $15.76 (the tax). + 16.2328 Total cost of item ($15.76 + $0.47). Percent Difference. The ∆ fun...
Page 31 - Rectangular Conversion.; to
Section 2: Numeric Functions 31 Rectangular Conversion. Pressing ´; (rectangular) converts a set of polar coordinates (magnitude r angle θ) into rectangular coordinates (x, y) . θ must be entered first then r. Upon executing ´; , x will be displayed first; press ® to display y . Keystrokes Display |...
Page 32 - Section 3; The Automatic Memory Stack,; between; The Automatic
32 Section 3 The Automatic Memory Stack, LAST X, and Data Storage The Automatic Memory Stack and Stack Manipulation HP operating logic is based on a mathematical logic known as ―Polish Notation,‖ developed by the noted Polish logician Jan Łukasiewicz (Wookashye'veech ) (1878-1956). Conventional alge...
Page 33 - Stack Lift; lost; Stack Drop; Stack Manipulation Functions; Pressing
Section 3: The Memory Stack, LAST X, and Data Storage 33 Any number that is keyed in or results from the execution of a numeric function is placed into the display (X-register). This action will cause numbers already in the stack to lift, remain in the same register, or drop, depending upon both the...
Page 35 - The LAST X Register and; before execution of a numeric operation.; The
Section 3: The Memory Stack, LAST X, and Data Storage 35 The LAST X Register and K The LAST X register, a separate memory register, preserves the value that was last in the display before execution of a numeric operation. * Pressing |K (LAST X) places a copy of the contents of the LAST X register in...
Page 36 - Calculator Functions and the Stack; next; disable
36 Section 3: The Memory Stack, LAST X, and Data Storage Keystrokes Display * 287.0000 Reverses the function that produced the wrong answer. 13.9 + 20.6475 The correct answer. Calculator Functions and the Stack When you want to key in two numbers, one after the other, you press v between entries of ...
Page 37 - Order of Entry and the
Section 3: The Memory Stack, LAST X, and Data Storage 37 lost T z z z z Z z z z z Y y y y y X 7 0 6 y 6 Keys: |` 6 Y Order of Entry and the v Key An important aspect of two-number functions is the positioning of the numbers in the stack. To execute an arithmetic function, the numbers should be posit...
Page 38 - Nested Calculations
38 Section 3: The Memory Stack, LAST X, and Data Storage Nested Calculations The automatic stack lift and stack drop make it possible to do nested calculations without using parentheses or storing intermediate results. A nested calculation is solved simply as a series of one- and two-number operatio...
Page 39 - Arithmetic Calculations With Constants; Load the stack with a constant and operate upon different
Section 3: The Memory Stack, LAST X, and Data Storage 39 T y y y y Z y x y x Y x 13 x 65 X 13 5 65 4 Keys: 5 * 4 T y y y y Z x y x y Y 65 x 69 x X 4 69 3 207 Keys: + 3 * Arithmetic Calculations With Constants There are three ways (without using a storage register) to manipulate the memory stack to p...
Page 40 - Two close stellar neighbors of Earth
40 Section 3: The Memory Stack, LAST X, and Data Storage Example: Two close stellar neighbors of Earth are Rigel Centaurus (4.3 light-years away) and Sirius (8.7 light-years away). Use the speed of light, c (3.0×10 8 meters/second, or 9.5×10 15 meters/year), to figure the distances to these stars in...
Page 41 - Loading the Stack with a Constant.; not
Section 3: The Memory Stack, LAST X, and Data Storage 41 Loading the Stack with a Constant. Because the number in the T-register is replicated when the stack drops, this number can be used as a constant in arithmetic operations. T c c New constant generation. Z c c Y c c Drops to interact with X-reg...
Page 42 - Storage Register Operations; Storing and Recalling Numbers; store
42 Section 3: The Memory Stack, LAST X, and Data Storage Keystrokes Display * 1,150.0000 Population at the end of day 1. * 1,322.5000 Day 2. * 1,520.8750 Day 3. * 1,749.0063 Day 4. Storage Register Operations When numbers are stored or recalled, they are copied between the display (X-register) and t...
Page 43 - Error 3; Clearing Data Storage Registers; Storage and Recall Arithmetic; Storage Arithmetic
Section 3: The Memory Stack, LAST X, and Data Storage 43 The above are stack lift-enabling operations, so the number remaining in the X-register can be used for subsequent calculations. If you address a nonexistent register, the display will show Error 3 . Example: Springtime is coming and you want ...
Page 44 - without lifting the stack,; For recall arithmetic,
44 Section 3: The Memory Stack, LAST X, and Data Storage The number in the register is determined as follows: For storage arithmetic, new contents of register = old contents of register × number in display R 0 r T t R 0 r-x T t Z z Z z Y y Y y X x X x Keys: O-0 Recall Arithmetic . Recall arith...
Page 45 - Overflow and Underflow; Problems
Section 3: The Memory Stack, LAST X, and Data Storage 45 Example: Keep a running count of your newly blooming crocuses for two more days. Keystrokes Display 8 O 0 8.0000 Places the total number of blooms as of day 2 in R 0 . 4 O + 0 4.0000 Day 3: adds four new blooms to those already blooming. 3 O +...
Page 46 - vvv
46 Section 3: The Memory Stack, LAST X, and Data Storage 2. Use arithmetic with constants to calculate the remaining balance of a $1000 loan after six payments of $100 each and an interest rate of 1% (0.01) per payment period. Procedure: Load the stack with (1 + i ), where i = interest rate, and key...
Page 47 - Section 4; Statistics Functions; Probability Calculations; nonnegative integers.; Permutations; arrangements; Combinations; sets; Examples
47 Section 4 Statistics Functions A word about the statistics functions: their use is based on an understanding of memory stack operation (Section 3). You will find that order of entry is important for most statistics calculations. Probability Calculations The input for permutation and combination c...
Page 48 - Section 4: Statistics Functions; y is; Random Number Generator
48 Section 4: Statistics Functions How many different four-card hands can be dealt from a deck of 52 cards? Keystrokes Display 52 v 4 4 Fifty-two ( y ) cards dealt four ( x ) at a time. |c 270,725.0000 Number of different hands possible. The maximum size of x or y is 9,999,999,999. Random Number Gen...
Page 49 - Accumulating Statistics; statistics
Section 4: Statistics Functions 49 Keystrokes Display l´# 0.2809 Recall last random number generated, which is the new seed. (The ´ may be omitted.) Accumulating Statistics The HP-15C performs one- and two-variable statistical calculations. The data is first entered into the Y- and X-registers. Then...
Page 50 - Register; n also
50 Section 4: Statistics Functions In some cases involving x or y data values that differ by a relatively small amount, the calculator cannot compute s, r, linear regression, or ŷ, and will display Error 2 . This will not happen, however, if you normalize the data by keying in only the difference be...
Page 52 - Correcting Accumulated Statistics; both; Example
52 Section 4: Statistics Functions Correcting Accumulated Statistics If you discover that you have entered data incorrectly, the accumulated statistics can be easily corrected. Even if only one value of an ( x, y ) data pair is incorrect, you must delete and re-enter both values. 1. Key the incorrec...
Page 53 - Mean; Standard Deviation; sample
Section 4: Statistics Functions 53 Mean The ’ function computes the arithmetic mean (average) of the x -and y - values using the formulas shown in appendix A and the statistics accumulated in the relevant registers. When you press |’ the contents of the stack lift (two registers if stack lift is ena...
Page 54 - Linear Regression
54 Section 4: Statistics Functions Example: Calculate the standard deviation about the mean calculated above. Keystrokes Display |S 31.62 Standard deviation about the mean nitrogen application, x. ® 1.24 Standard deviation about the mean grain yield, y. Linear Regression Linear regression is a stati...
Page 55 - Linear Estimation and Correlation Coefficient
Section 4: Statistics Functions 55 Example: Find the y -intercept and slope of the linear approximation of the data and compare to the plotted data on the graph below. Keystrokes Display ´L 4.86 y -intercept of the line. ® 0.04 Slope of the line. Linear Estimation and Correlation Coefficient When yo...
Page 56 - Correlation Coefficient.
56 Section 4: Statistics Functions Linear Estimation. With the statistics accumulated, an estimated value for y, denoted ŷ , can be calculated by keying in a proposed value for x and pressing ´j . An Estimated value for x (denoted x ˆ ) can be calculated as follows: 1. Press ´L . 2. Key in the known...
Page 57 - Other Applications; either
Section 4: Statistics Functions 57 Keystrokes Display 70 ´j 7.56 Predicted grain yield in tons/hectare. ® 0.99 The original data closely approximates a straight line. Other Applications Interpolation. Linear interpolation of tabular values, such as in thermodynamics and statistics tables, can be car...
Page 58 - Section 5; The Display; Display Control; Fixed Decimal Display
58 Section 5 The Display and Continuous Memory Display Control The HP-15C has three display formats – • , i , and ^ – that use a given number (0 through 9) to specify display format. The illustration below shows how the number 123,456 would be displayed specified to four places in each possible mode...
Page 59 - Section 5: The Display and Continuous Memory; Scientific Notation Display; undisplayed; Engineering Notation Display; additional
Section 5: The Display and Continuous Memory 59 Scientific Notation Display i (scientific) format displays a number in scientific notation. The sequence ´i n specifies the number of decimal places to be shown. Up to six decimal places can be shown since the exponent display takes three spaces. The d...
Page 60 - Mantissa Display; , regardless of what; Special Displays; Annunciators
60 Section 5: The Display and Continuous Memory Mantissa Display Regardless of the display format, the HP-15C always internally holds each number as a 10-digit mantissa and a two-digit exponent of 10. For example, π is always represented internally as 3.141592654×10 00 , regardless of what is in the...
Page 61 - Digit Separators; Error Display; Error; Overflow; any; Underflow
Section 5: The Display and Continuous Memory 61 Digit Separators The HP-15C is set at power-up so that it separates integral and fractional portions of a number with a period (a decima l point), and separates groups of three digits in the integer portion with a comma. You can reverse this setting to...
Page 62 - Low-Power Indication; Continuous Memory; Status; manually
62 Section 5: The Display and Continuous Memory Low-Power Indication When a flashing asterisk, which indicates low battery power, appears in the lower left-hand side of the display, there is no reason to panic. You still have plenty of calculator time remaining: at least 10 minutes if you continuous...
Page 63 - Resetting Continuous Memory; Pr Error
Section 5: The Display and Continuous Memory 63 Resetting Continuous Memory If at any time you want to reset (entirely clear) the HP-15C Continuous Memory: 1. Turn the calculator off. 2. Press and hold the = key, then press and hold the - key. 3. Release the = key, then the - key. (This convention i...
Page 66 - Section 6; Programming Basics; The Mechanics; Creating a Program; Program Mode; ) to set the calculator to; annunciator on). Functions are stored and not; Switches to Program mode; annunciator and line
66 Section 6 Programming Basics The next five sections are dedicated to explaining aspects of programming the HP-15C. Each of these programming sections will first discuss basic techniques (The Mechanics), then give examples for the implementation of these techniques (Examples), and lastly discuss f...
Page 67 - Section 6: Programming Basics; Location in Program Memory; can; Program Begin; label; Recording a Program
Section 6: Programming Basics 67 Location in Program Memory . Program memory – and therefore the calculator's position in program memory – is demarcated by line numbers. Line 000 marks the beginning of program memory and cannot be used to store an instruction. The first line that contains an instruc...
Page 68 - Keystrokes Display; without; if this is the last; Intermediate Program Stops; pause; one; Running a Program; Run Mode
68 Section 6: Programming Basics Keystrokes Display 2 002- 2 * 003- 20 9 004- 9 Given h in the X-register, lines 002 to 008 calculate . 005- 48 8 006- 8 9 .8 2 h . ÷ 007- 10 ¤ 008- 11 Program End. There are three possible endings for a program: | n (return) will end a program, return to line 000, ...
Page 69 - letter label; running; How to Enter Data
Section 6: Programming Basics 69 Keystrokes Display |¥ Run mode; no PRGM annunciator displayed. (The display will depend on any previous result.) The position in program memory does not change when modes are switched. Should the calculator be shut off, it always ―wakes up‖ in Run mode. Executing a P...
Page 70 - Direct entry; Program Memory; Most
70 Section 6: Programming Basics This is the method used above, where h was placed in the X-register before running the program. No v instruction is necessary because program execution (here: ´A ) both terminates digit entry and enables the stack lift. The above program then multiplied the contents ...
Page 72 - ́bA
72 Section 6: Programming Basics Keystrokes Display ´bA 001-42,21,11 Assigns this program the label ―A‖. O 0 002- 44 0 Stores the contents of X-register into R 0 . r must be in the X- register before running the program. |x 003- 43 11 Squares the contents of the X- register (which will be r ). |$ 00...
Page 74 - Further; Program Instructions; instruction; Instruction Coding; Instruction
74 Section 6: Programming Basics Keystrokes Display 4 4 Enter h of third can. ¦ 254.4690 VOLUME of third can. 240.3318 SURFACE AREA of third can. l 1 133.5177 Sum of BASE AREAS. l 2 939.3362 Sum of VOLUMES. l 3 769.6902 Sum of SURFACE AREAS. The preceding program illustrates the basic techniques of ...
Page 75 - Memory Configuration
Section 6: Programming Basics 75 Keycode 25: second row, fifth key. Memory Configuration Understanding memory configuration is not essential to your use of the HP-15C. It is essential, however, for obtaining maximum efficiency in memory and programming use. The more you program, the more useful this...
Page 76 - and below allocated to data; Initial Memory Configuration
76 Section 6: Programming Basics Memory is reallocated by telling the calculator which data storage register shall be the highest data register; all other registers are left for programming and advanced functions. Keystrokes Display 60 ´ m % * 60.0000 R 60 and below allocated to data storage; five (...
Page 77 - memory status; Program Boundaries; automatic
Section 6: Programming Basics 77 Keystrokes Display 1 ´ m % 1.0000 R 1 and R 0 allocated for data storage; R 2 to R 65 available for programming and advanced functions. 19 ´ m% 19.0000 Original allocation: R 19 (R .9 ) and below for data storage; R 20 , to R 65 for programming and advanced functions...
Page 78 - Unexpected Program Stops; Abbreviated Key Sequences; abbreviated key sequence
78 Section 6: Programming Basics corresponding label. If need be, the search will wrap around at the end of program memory and continue at line 000. When it encounters an appropriate label, the search stops and execution begins. If a label is encountered as part of a running program, it has no effec...
Page 79 - User Mode; LN; Polynomial Expressions and Horner's Method; Ax
Section 6: Programming Basics 79 For example, ´b´A becomes ´bA , ´m´% becomes ´m% , and O´# becomes O# . The removal of the ´ is not ambiguous because the ´ -shifted function is the only logical one in these cases. The keycodes for such instructions do not include the extraneous ´ even if you do key...
Page 80 - Nonprogrammable Functions; cannot
80 Section 6: Programming Basics Example: Write a program for 5 x 4 + 2 x 3 as (((5 x + 2 ) x ) x ) x, then evaluate for x = 7 Keystrokes Display | ¥ 000- Assumes position in memory is line 000. If it is not, clear program memory. ´ b B 001-42,21,12 5 002- 5 * 003- 20 5 x . 2 004- 2 + 005- 40 5 x + ...
Page 81 - ́bC
Section 6: Programming Basics 81 Problems 1. The village of Sonance has installed a 12-o'clock whistle in the firehouse steeple. The sound level at the firehouse door, 3.2 meters from the whistle, is 138 decibels. Write a program to find the sound level at various distances from the whistle. Use the...
Page 82 - Section 7; Program Editing; Moving to a Line in Program Memory; The Go To
82 Section 7 Program Editing There are many reasons to modify a program after you've already stored it: you might want to add or delete an instruction (like O , © , or ¦ ), or you might even find some errors! The HP-15C is equipped with several editing features to make this process as easy as possib...
Page 83 - Section 7: Program Editing; The Back Step; Deleting Program Lines
Section 7: Program Editing 83 The Back Step ( ‚ ) Instruction. To move one line backwards in program memory, press ‚ ( back step ) in Program or Run mode. This function is not programmable. ‚ will scroll (with the key held down) in Program mode. Program instructions are not executed. Deleting Progra...
Page 85 - Changed to; Further Information; Single-Step Operations; If you want to check the contents of a
Section 7: Program Editing 85 Keystrokes Display − 019- 40 Line 020 deleted. | ‚ (hold) 016- 45 4 The next line to edit is line 016 ( l 4). − 015- 20 Line 016 deleted. l 2 016- 45 2 Line 016 changed to l 2. t “ 011 (or hold ‚ ) 011-44,40, 2 Moves to line 011 ( O+ 2). − 010- 42 31 Line 011 deleted. |...
Page 86 - Line Position
86 Section 7: Program Editing you can check the program by executing it stepwise. This is done by pressing  in Run mode. Keystrokes Display | ¥ Run mode. ´ CLEAR Q Clear storage registers. t A Move to first line of program A. 8 O 1 8.0000 Store a can height. 2.5 2.5 Enter a can radius.  (hold) 001...
Page 87 - Insertions and Deletions; Error 4; Initializing Calculator Status; FV
Section 7: Program Editing 87 Insertions and Deletions After an insertion, the display will show the instruction you just added. After a deletion, the display will show the line prior to the deleted (now nonexistent) one. If all space available in memory is occupied, the calculator will not accept a...
Page 88 - PV
88 Section 7: Program Editing Keystrokes Display ´ b . 1 001-42,21,.1 ´ • 2 002-42, 7, 2 1 003- 1 . 004- 48 0 005- 0 Interest . 7 006- 7 5 007- 5 ® 008- 34 y 009- 14 (1 + i ) n * 010- 20 PV (1 + i ) n | n 011- 43 32 Load the program and find the future value of $1,000 invested for 5 years; of $2,300...
Page 90 - Section 8; Program Branching; Branching
90 Section 8 Program Branching and Controls Although the instructions in a program are normally executed sequentially, it is often desirable to transfer execution to a part of the program other than the next line. Branching in the HP-15C may be simple , or it may depend on a certain condition . By b...
Page 91 - Conditional Tests; Another way to alter the sequence of program execution is by a
Section 8: Program Branching and Controls 91 of this loop can be controlled by a conditional branch, an ¦ instruction (written into the loop), or simply by pressing any key during execution (which stops the program). Conditional Tests Another way to alter the sequence of program execution is by a co...
Page 92 - Section 8: Program Branching and Controls; Flags
92 Section 8: Program Branching and Controls Following a conditional test, program execution follows the "Do if True" Rule: it proceeds sequentially if the condition is true, and it skips one instruction if the condition is false. A t instruction is often placed right after a conditional tes...
Page 93 - Example: Branching and Looping
Section 8: Program Branching and Controls 93 Examples Example: Branching and Looping A radiobiology lab wants to predict the diminishing radioactivity of a test amount of 131 I, a radioisotope. Write a program to figure the radioactivity at 3-day intervals until a given limit is reached. The formula...
Page 96 - bB
96 Section 8: Program Branching and Controls Keystrokes Display | ¥ 000- Program mode. ´ bB 001-42,21,12 Start at "B" if payments to be made at the beginning. | " 0 002-43, 5, 0 Flag 0 clear (false); indicates advance payments. t 1 003- 22 1 Go to main routine. ´ b E 004-42,21,15 Start a...
Page 97 - Go to; nnn
Section 8: Program Branching and Controls 97 Now run the program to find the total amount needed in an account from which you want to take $250/month for 48 months. Enter the periodic interest rate as a decimal fraction, that is, 0.005 per month. First find the sum needed if payments will be made at...
Page 98 - Looping; Tests With Complex Numbers and Matrix Descriptors.
98 Section 8: Program Branching and Controls Looping Looping is an application of branching which uses a t instruction to repeat a portion of the program. A loop can continue indefinitely, or may be conditional. A loop is frequently used to repeat a calculation with different variables. At the same ...
Page 99 - The System Flags: Flags 8 and 9; turning on the
Section 8: Program Branching and Controls 99 In this way, a program can accommodate two different modes of input, such as degrees and radians, and make the correct calculation for the mode chosen. You set a flag if a conversion needs to be made, for instance, and clear it if no conversion is needed....
Page 100 - 00 Section 8: Program Branching and Controls
100 Section 8: Program Branching and Controls Flag 9. An overflow condition (described on page 61) automatically sets flag 9. Flag 9 causes the display to blink or, if a program is running, waits until execution is complete and then starts blinking the display. Flag 9 may be cleared in three ways: ...
Page 101 - Section 9; Subroutines; Go To Subroutine and Return; Subroutine Execution
101 Section 9 Subroutines When the same set of instructions needs to be used at more than one point in a program, memory space can be conserved by storing those instructions as a single subroutine. The Mechanics Go To Subroutine and Return The G ( go to subroutine ) instruction is executed in the sa...
Page 102 - 02 Section 9: Subroutines; Subroutine Limits
102 Section 9: Subroutines Subroutine Limits A subroutine can call up another subroutine, and that subroutine can call up yet another subroutine. This ―subroutine nesting‖—the execution of a subroutine within a subroutine—is limited to stack of subroutines seven levels deep (this does not count the ...
Page 103 - Section 9: Subroutines 103; MAIN PROGRAM; SUBROUTINE
Section 9: Subroutines 103 MAIN PROGRAM |¥ ´ CLEAR M (Not programmable.) 000- 001- ´ b 9 Start main program. 002- | R Radians mode. 003- O 0 Stores x 2 in R 0 . 004- ® Brings x 1 into X; x 2 into Y. 005- O - 0 ( x 2 - x 1 ) in R 0 . 006- G .3 Transfer to subroutine ―.3‖ with x 1 . Return from subrou...
Page 105 - Section 9: Subroutines 105; The Subroutine Return; pending return; Nested Subroutines; Error 5
Section 9: Subroutines 105 Further Information The Subroutine Return The pending return condition means that the n instruction occurring subsequent to a G instruction causes a return to the line following the G rather than a return to line 000. This is what makes a subroutine useful and reuseable in...
Page 106 - Direct Versus Indirect Data Storage With the Index Register; number itself
106 Section 10 The Index Register and Loop Control The Index register (R I ) is a powerful tool in advanced programming of the HP-15C. In addition to storage and recall of data the Index register can use an index number to: Count and control loops. Indirectly address storage registers, including...
Page 107 - Section 10: The Index Register and Loop Control 107; Indirect Program Control With the Index Register; other than; Program Loop Control; by any; Index Register Storage and Recall; Indirect Addressing
Section 10: The Index Register and Loop Control 107 Indirect Program Control With the Index Register The V key is used for all forms of indirect program control other than indirect register addressing. Hence, V (not % ) is used for indirect program branching, indirect display format control, and ind...
Page 108 - 08 Section 10: The Index Register and Loop Control; Index Register Arithmetic
108 Section 10: The Index Register and Loop Control Indirect Addressing If R I contains: % will address: t V or GV will transfer to:* 21 R 21 ´ b B 22 R 22 " " C 23 R 23 " " Á 24 R 24 " " E ⋮ ⋮ — 65 R 65 — * For R I 0 only. Index Register Arithmetic Direct. O or l { + , - ,...
Page 109 - Indirect Flag Control With; The Loop Control Number.; nnnnn; xxx
Section 10: The Index Register and Loop Control 109 To Labels. If the R I value is positive , t V and G V will transfer execution to the label which corresponds to the number in the Index register (see the above table). For instance, if the Index register contains 20.00500, then a tV instruction wil...
Page 110 - 10 Section 10: The Index Register and Loop Control; nnnnn x x x y y
110 Section 10: The Index Register and Loop Control For example, the number 0.05002 in a storage register represents: nnnnn x x x y y 0.0 5 0 0 2 Start count at zero. Count by twos. Count up to 50. I and e Operation . Each time a program encounters I or e it increments or decrements nnnnn (the integ...
Page 111 - Examples: Register Operations
Section 10: The Index Register and Loop Control 111 False (nnnnn > xxx) True (nnnnn xxx) instruction ´sV loop t. 1 Instruction exit loop For e : given nnnnn.xxxyy , decrement nnnnn to nnnnn - yy , compare it to xxx, and skip the next program line if the new value satisfies nnnnn ≤ xxx . This al...
Page 112 - Example: Loop Control with
112 Section 10: The Index Register and Loop Control Keystrokes Display l % 2.6458 Indirectly recalls contents of R .2 . ´ X .2 2.6458 Check: same contents recalled by directly addressing R .2 . Exchanging the X-Register Keystrokes Display ´ X V 12.3456 Exchanges contents of R I and X- register. l V ...
Page 114 - 14 Section 10: The Index Register and Loop Control; Example: Display Format Control
114 Section 10: The Index Register and Loop Control Keystrokes Display 15 “ O V ´ A -15.0000 Branch line number. 2.0000 Running program loop counter = 3. 84.0896 5.0000 Loop counter = 2. 64.8420 8.0000 Loop counter = 1. 50.0000 50.0000 Loop counter = 0; program ends. Example: Display Format Control ...
Page 115 - Section 10: The Index Register and Loop Control 115; Index Register Contents
Section 10: The Index Register and Loop Control 115 To display fixed point notation for all possible decimal places on the HP-15C: Keystrokes Display | ¥ Run mode. ´ B 9.000000000 8.00000000 7.0000000 6.000000 5.00000 4.0000 3.000 2.00 1.0 0. Display at ´© instruction. 0. Display when program halts....
Page 116 - 16 Section 10: The Index Register and Loop Control; cannot be zero; Indirect Display Control
116 Section 10: The Index Register and Loop Control I and e For the purpose of loop control, the integer portion (the counter value) of the stored control number can be up to five digits long ( nnnnn.xxxyy ). The counter value ( nnnnn ) is zero if not specified otherwise. xxx, in the decimal portion...
Page 120 - The Complex Stack and Complex Mode; two; Creating the Complex Stack
120 Section 11 Calculating With Complex Numbers The HP-15C enables you to calculate with complex numbers, that is, numbers of the form a + ib , where a is the real part of the complex number, b is the imaginary part of the complex number, and 1 i . As you will see, the beauty of calculating with...
Page 121 - Section 11: Calculating With Complex Numbers 121; real; Deactivating Complex Mode; Complex Numbers and the Stack; Entering Complex Numbers
Section 11: Calculating With Complex Numbers 121 Complex mode is activated 1) automatically, when executing ´ V or ´ } ; or 2) by setting flag 8, the Complex mode flag ( |F 8). When the calculator is in Complex mode, the C annunciator in the display is lit. This tells you that flag 8 is set and the ...
Page 122 - Displays imaginary part
122 Section 11: Calculating With Complex Numbers Example: Add 2 + 3 i and 4 + 5 i . (The operations are illustrated in the stack diagrams following the keystroke listing.) Keystrokes Display ´ • 4 2 v 2.0000 Keys real part of first number into (real) Y-register. 3 3 Keys imaginary part of first numb...
Page 124 - 24 Section 11: Calculating With Complex Numbers; Stack Lift in Complex Mode; real exchange imaginary; Temporary Display of the Imaginary X-Register.
124 Section 11: Calculating With Complex Numbers Stack Lift in Complex Mode Stack lift operates on the imaginary stack as it does on the real stack (the real stack behaves identically in and out of Complex mode). The same functions that enable, disable, or are neutral to lifting of the real stack wi...
Page 125 - Clearing a Complex Number
Section 11: Calculating With Complex Numbers 125 of Complex mode. Instead, you can do either of the following: Multiply by -1. If you don't want to disturb the rest of the stack, press “ ´ } “ ´ } . To find the negative of only one part of a complex number in the X -register: Press “ to negate...
Page 126 - 26 Section 11: Calculating With Complex Numbers; Clearing the Real and Imaginary X-Registers.
126 Section 11: Calculating With Complex Numbers Clearing the Imaginary X-Register. To clear the number in the imaginary X-register, press ´ } , then press − . Press ´ } again to return the zero, or any new number keyed in, to the imaginary X-register. Example: Replace -1 -8 i by -1 + 5 i . Re Im Re...
Page 127 - Section 11: Calculating With Complex Numbers 127; Entering Complex Numbers with
Section 11: Calculating With Complex Numbers 127 Entering Complex Numbers with − . The clearing functions − and ` can also be used with } as an alternative method of entering (and clearing) complex numbers. Using this method, you can enter a complex number using only the X-register, without affectin...
Page 128 - 28 Section 11: Calculating With Complex Numbers; Entering a Real Number
128 Section 11: Calculating With Complex Numbers Re Im Re Im Re Im Re Im T a b a b a b a b Z c d c d c d c d Y e f e f e f e f X 7 8 0 8 9 8 17 144 Keys: − 9 | x Entering a Real Number You have already seen two ways of entering a complex number. There is a shorter way to enter a real number: simply ...
Page 129 - Section 11: Calculating With Complex Numbers 129; Entering a Pure Imaginary Number
Section 11: Calculating With Complex Numbers 129 Entering a Pure Imaginary Number There is a shortcut for entering a pure imaginary number into the X -register when you are already in Complex mode: key in the (imaginary) number and press ´ } Example: Enter 0 + 10 i (assuming the last function execut...
Page 130 - 30 Section 11: Calculating With Complex Numbers; Storing and Recalling Complex Numbers; Operations With Complex Numbers; real numbers
130 Section 11: Calculating With Complex Numbers Storing and Recalling Complex Numbers The O and l functions act on the real X-register only; therefore, the imaginary part of a complex number must be stored or recalled separately. The keystrokes to do this can be entered as part of a program and exe...
Page 131 - Section 11: Calculating With Complex Numbers 131; radians
Section 11: Calculating With Complex Numbers 131 One-Number Functions The following functions operate on both the real and imaginary parts of the number in the X-register, and place the real and imaginary parts of the answer back into those registers. ¤ x N o ∕ @ ' a : ; All trigonometric and hyperb...
Page 132 - 32 Section 11: Calculating With Complex Numbers; complex
132 Section 11: Calculating With Complex Numbers Conditional Tests For programming, the four conditional tests below will work in the complex sense: ~ and T 0 compare the complex number in the (real and imaginary) X-registers to 0 + 0 i , while T 5 and T 6 compare the complex numbers in the (real an...
Page 133 - Section 11: Calculating With Complex Numbers 133; Complex Results from Real Numbers; rectangular
Section 11: Calculating With Complex Numbers 133 Complex Results from Real Numbers In the preceding examples, the entry of complex numbers had ensured the (automatic) activation of Complex mode. There will be times, ho wever, when you will need Complex mode to perform certain operations on real numb...
Page 134 - 34 Section 11: Calculating With Complex Numbers; in Complex mode
134 Section 11: Calculating With Complex Numbers a + ib = r (cos θ + i sin θ) = re iθ (polar) r θ (phasor) ; and : can be used to interconvert the rectangular and polar forms of a complex number. They operate in Complex mode as follows: ´ ; converts the polar (or phasor) form of a complex numbe r ...
Page 135 - annunciator displayed
Section 11: Calculating With Complex Numbers 135 Example: Find the sum 2(cos 65° + i sin 65°) + 3(cos 40° + i sin 40°) and express the result in polar form, (In phasor form, evaluate 2 65° + 3 40°.) Keystrokes Display | D Sets Degrees mode for any polar-rectangular conversions. 2 v 2.0000 65 ´ V...
Page 136 - 36 Section 11: Calculating With Complex Numbers; v v
136 Section 11: Calculating With Complex Numbers Keystrokes Display 2 ´ } 0.0000 2 i . Display shows real part. 8 “ v -8.0000 6 ´ V -8.0000 -8 + 6 i . 3 Y 352.0000 (-8 + 6 i ) 3 . * -1.872.0000 2 i (-8 + 6 i ) 3 . 4 v 4.0000 5 ¤ 2.2361 2 “ * -4.4721 5 2 . ´ V 4.0000 i 5 2 4 . ÷ -295.4551 i i i 5...
Page 137 - Section 11: Calculating With Complex Numbers 137; For Further Information
Section 11: Calculating With Complex Numbers 137 For Further Information The HP-15C Advanced Functions Handbook presents more detailed and technical aspects of using complex numbers in various functions with the HP-15C. Applications are included. The topics include: Accuracy considerations. Prin...
Page 138 - Calculating With Matrices
138 Section 12 Calculating With Matrices The HP-15C enables you to perform matrix calculations, giving you the capability to handle advanced problems with ease. The calculator can work with up to five matrices, which are named A through E since they are accessed using the corresponding A through E k...
Page 139 - Section 12: Calculating with Matrices 139
Section 12: Calculating with Matrices 139 Keystrokes Display | " 8 Deactivates Complex mode. 2 v ´ m A 2.0000 Dimensions matrix A to be 2×2. ´ > 1 2.0000 Prepares for automatic entry of matrix elements in User mode. ´ U 2.0000 (Turns on the USER annunciator.) 3.8 O A A 1,1 Denotes matrix A , ...
Page 140 - 40 Section 12: Calculating with Matrices; Matrix Dimensions
140 Section 12: Calculating with Matrices Keystrokes Display l > B b 2 1 Enters descriptor for B , the 2×1 constant matrix. l > A A 2 2 Enters descriptor for A , the 2×2 coefficient matrix, into the X-register, moving the descriptor for B into the Y-register. ÷ running Temporary display while ...
Page 141 - Section 12: Calculating with Matrices 141; Dimensioning a Matrix; number of
Section 12: Calculating with Matrices 141 Matrix inversion, for example, can be performed on an 8×8 matrix with real elements (or on a 4×4 matrix with complex elements, as described later * ). To conserve memory, all matrices are initially dimensioned as 0×0. When a matrix is dimensioned or redimens...
Page 142 - 42 Section 12: Calculating with Matrices; ́mA; Displaying Matrix Dimensions; Changing Matrix Dimensions
142 Section 12: Calculating with Matrices Example: Dimension matrix A to be a 2×3 matrix. Keystrokes Display 2 v 2.0000 Keys number of rows into Y-register. 3 3 Keys number of columns into X-register. ´mA 3.0000 Dimensions matrix A to be 2×3. Displaying Matrix Dimensions There are two ways you can d...
Page 143 - Section 12: Calculating with Matrices 143; Storing and Recalling Matrix Elements; Storing and Recalling All Elements in Order; automatically
Section 12: Calculating with Matrices 143 If you redimension a matrix to a larger size, elements with the value 0 are added at the end as required by the new dimensions. For example, if the same 2×3 matrix is re dimensioned, to 2×4, then When you have finished calculating with matrices, you'll proba...
Page 144 - 44 Section 12: Calculating with Matrices; null
144 Section 12: Calculating with Matrices To store or recall sequential elements of a matrix: 1. Be sure the matrix is properly dimensioned. 2. Press ´ > 1. This stores 1 in both storage registers R 0 and R 1 , so that elements will be accessed starting at row 1, column 1. 3. Activate User mode b...
Page 145 - Section 12: Calculating with Matrices 145; lA; Checking and Changing Matrix Elements Individually
Section 12: Calculating with Matrices 145 Keystrokes Display ´ > 1 Sets beginning row and column numbers in R 0 and R 1 to 1. (Display shows the previous result.) ´ U Activates User mode. 1 O A A 1,1 Row 1, column 1 of A . (Displayed momentarily while A key held down.) 1.0000 Value of a 11 . 2 O ...
Page 146 - 46 Section 12: Calculating with Matrices; Using R
146 Section 12: Calculating with Matrices Using R 0 and R 1 . To access a particular matrix element, store its row number in R 0 and its column number in R 1 . These numbers won't change automatically (unless the calculator is in User mode). To recall the element value (after storing the row and c...
Page 147 - Section 12: Calculating with Matrices 147; Storing a Number in All Elements of a Matrix; Matrix Operations; Matrix Descriptors; descriptor
Section 12: Calculating with Matrices 147 Example: Recall the element in row 2, column 1 of matrix A from the previous example. Use the stack registers. Keystrokes Display 2 v 1 1 Enters row number into Y-register and column number into X-register. l | A 4.0000 Value of a 21 . Storing a Number in Al...
Page 148 - 48 Section 12: Calculating with Matrices; AX; The Result Matrix
148 Section 12: Calculating with Matrices operate on the matrices whose descriptors are placed in the X-register and (for some operations) the Y-register. Two matrix operations – calculating a determinant and solving the matrix equation AX = B – involve calculating an LU decomposition (also known as...
Page 149 - Section 12: Calculating with Matrices 149; Copying a Matrix; One-Matrix Operations
Section 12: Calculating with Matrices 149 While the key used for any matrix operation that stores a result in the result matrix is held down, the descriptor of the result matrix is displayed. If the key is released within about 3 seconds, the operation is performed, and the descriptor of the result ...
Page 150 - 50 Section 12: Calculating with Matrices; Result in; in
150 Section 12: Calculating with Matrices One-Matrix Operations: Sign Change, Inverse, Transpose, Norms, Determinant Keystroke(s) Result in X-register Effect on Matrix Specified in X-register Effect on Result Matrix “ No change. Changes sign of all elements. None. ‡ ∕ ( ´∕ in User Mode) Descriptor o...
Page 151 - Matrix B (which you can view using; Scalar Operations
Section 12: Calculating with Matrices 151 Example: Calculate the transpose of matrix B . Matrix B was set in preceding examples to . 9 5 4 3 2 1 B Keystrokes Display l > B b 2 3 Displays descriptor of 2×3 matrix B . ´ > 4 b 3 2 Descriptor of 3×2 transpose. Matrix B (which you can...
Page 152 - 52 Section 12: Calculating with Matrices
152 Section 12: Calculating with Matrices Operation Elements of Result Matrix* Matrix in Y-Register Scalar in Y-Register Scalar in X-Register Matrix in X-Register + Adds scalar value to each matrix element. * Multiplies each matrix element by scalar value. - Subtracts scalar value from each matrix e...
Page 153 - Section 12: Calculating with Matrices 153; lB; Arithmetic Operations
Section 12: Calculating with Matrices 153 Keystrokes Display 1 - b 2 3 Subtracts 1 from the elements of matrix B and stores those values in the same elements of B . The result (which you can view using lB in User mode) is 17 9 7 5 3 1 B . Arithmetic Operations With matrix descripto...
Page 154 - 54 Section 12: Calculating with Matrices; Matrix Multiplication
154 Section 12: Calculating with Matrices Keystrokes Display - C 2 3 Calculates B - A and stores values in redimensioned result matrix C . The result is 8 4 3 2 1 0 C Matrix Multiplication With matrix description in both the X- and Y-registers, you can calculate three different matrix ...
Page 156 - 56 Section 12: Calculating with Matrices; Solving the Equation AX = B
156 Section 12: Calculating with Matrices Solving the Equation AX = B The ÷ function is useful for solving matrix equations of the form AX = B , where A is the coefficient matrix, B is the constant matrix, and X is the solution matrix. The descriptor of the constant matrix B should be entered in the...
Page 157 - Section 12: Calculating with Matrices 157; Week
Section 12: Calculating with Matrices 157 Week 1 2 3 Total Weight (kg) 274 233 331 Total Value $120.32 $112.96 $151.36 Silas knows that he received $0.24 per kilogram for his cabbage and $0.86 per kilogram for his broccoli. Use matrix operations to deter mine the weights of cabbage and broccoli he d...
Page 158 - 58 Section 12: Calculating with Matrices
158 Section 12: Calculating with Matrices Keystrokes Display 274 OB 274.0000 Stores b 11 . * 233 OB 233.0000 Stores b 12 . 331 OB 331.0000 Stores b 13 . 120.32 OB 120.3200 Stores b 21 . 112.96 OB 112.9600 Stores b 22 . 151.36 OB 151.3600 Stores b 23 . ´< Á 151.3600 Designates matrix D as result m...
Page 159 - Section 12: Calculating with Matrices 159; Calculating the Residual; R–YX; Functions Handbook
Section 12: Calculating with Matrices 159 Silas' deliveries were: Week 1 2 3 Cabbage (kg) 186 141 215 Broccoli (kg) 88 92 116 Calculating the Residual The HP-15C enables you to calculate the residual, that is, the matrix Residual = R–YX where R is the result matrix and X and Y are the matrices speci...
Page 160 - 60 Section 12: Calculating with Matrices; Using Matrices in; Calculations With Complex Matrices
160 Section 12: Calculating with Matrices Using Matrices in LU Form As noted earlier, two matrix operations (calculating a determinant and solving the matrix equation ( AX = B ) create an LU decomposition of the matrix specified in the X-register. The descriptor of such a matrix has two dashes follo...
Page 161 - Section 12: Calculating with Matrices 161; Storing the Elements of a Complex Matrix; m×n; then
Section 12: Calculating with Matrices 161 Instead, calculations with complex matrices are performed by using real matrices derived from the original complex matrices – in a manner to be described below – and performing certain transformations in addition to the regular matrix operations. These trans...
Page 162 - 62 Section 12: Calculating with Matrices; initially
162 Section 12: Calculating with Matrices Suppose you need to do a calculation with a complex matrix that is not written as the sum of a real matrix and an imaginary matrix – as was the matrix Z in the example above – but rather written with an entire complex number in each element, such as ...
Page 163 - Section 12: Calculating with Matrices 163
Section 12: Calculating with Matrices 163 Example: Store the complex matrix i i i i 8 3 5 1 2 7 3 4 Z in the form Z C , since it is written in a form that shows Z C . Then transform Z C into the form Z P . You can do this by storing the elements of Z C in matrix A and then usin...
Page 164 - 64 Section 12: Calculating with Matrices; The Complex Transformations Between Z
164 Section 12: Calculating with Matrices Matrix A now represents the complex matrix Z in Z P form: P art Imag i n ary P art Real . 8 5 2 3 3 1 7 4 } } P Z A The Complex Transformations Between Z P and Z An additional transformation must be done when you want to cal...
Page 165 - Section 12: Calculating with Matrices 165; Inverting a Complex Matrix
Section 12: Calculating with Matrices 165 Inverting a Complex Matrix You can calculate the inverse of a complex matrix by using the fact that ( ) -1 = ( -1 ). To calculate inverse, Z -1 , of a complex matrix Z : 1. Store the elements of Z in memory, in the form either of Z P or of Z C 2. Recall the ...
Page 166 - 66 Section 12: Calculating with Matrices; Multiplying Complex Matrices; YX
166 Section 12: Calculating with Matrices Keystrokes Display ´ < B A 4 4 Designates B as the result matrix. ∕ b 4 4 Calculates ( ) -1 = ( -1 ) and places the result in matrix B . ´> 3 b 4 2 Transforms ( -1 ) into ( -1 ) P . The representation of Z -1 in partitioned form is contained in matrix ...
Page 167 - Section 12: Calculating with Matrices 167
Section 12: Calculating with Matrices 167 8. Press * to calculate X P = ( YX ) P . The values of these matrix elements are placed in the result matrix, and the descriptor of the result matrix is placed in the X-register. 9. If you want the product in the form ( YX ) C , press |c Note that you don't ...
Page 168 - 68 Section 12: Calculating with Matrices; ZZ; Solving the Complex Equation AX = B
168 Section 12: Calculating with Matrices Writing down the elements of C , P 1 10 11 10 11 11 10 1 0 0 5 0 0 . 1 1 0 0 0 0 0 . 1 1 0 8 0 0 0 . 3 1 0 0 0 0 0 . 1 0 0 0 0 . 1 1 0 0 0 0 0 . 4 1 0 8 5 0 0 . 2 0 0 0 0 . 1 ZZ C , where th...
Page 169 - Section 12: Calculating with Matrices 169
Section 12: Calculating with Matrices 169 4. Recall the descriptor of the matrix representing A into the display. 5. If the elements of A were entered in the form of A C , press ´ p to transform A C into A P . 6. Press ´> 2 to transform A P into à . 7. Designate the result matrix; it must not be ...
Page 170 - 70 Section 12: Calculating with Matrices
170 Section 12: Calculating with Matrices In partitioned form, 0 0 0 5 an d 1 7 0 2 0 0 2 0 0 2 0 0 0 0 0 1 0 B A , where the zero elements correspond to real and imaginary parts with zero value. Keystrokes Display 4 v 2 ´mA 2.0000 Dime...
Page 171 - Section 12: Calculating with Matrices 171; lC
Section 12: Calculating with Matrices 171 Keystrokes Display ´> 2 A 4 4 Transforms A P into à . ´< C A 4 4 Designates matrix C as result matrix. ÷ C 4 1 Calculates X P and stores in C . |c C 2 2 Transforms X P into X C . lC 0.0372 Recalls c 11 . lC 0.1311 Recalls c 12 . lC 0.0437 Recalls c 21 ...
Page 172 - 72 Section 12: Calculating with Matrices
172 Section 12: Calculating with Matrices 1. Store the elements of A in memory, in the form either of A P or of A C . 2. Recall the descriptor of the matrix representing A into the display. 3. If the elements of A were entered in the form A C , press ´ p to transform A C into A P . 4. Press ´> 2 ...
Page 173 - Miscellaneous Operations Involving Matrices; Using a Matrix Element With Register Operations
Section 12: Calculating with Matrices 173 A problem using this procedure is given in the HP-15C Advanced Functions Handbook under Solving a Large System of Complex Equations. Miscellaneous Operations Involving Matrices Using a Matrix Element With Register Operations If a letter key specifying a matr...
Page 174 - Conditional Tests on Matrix Descriptors; between the descriptors themselves, not between the elements; Stack Operation for Matrix Calculations
174 Section 12: Calculating with Matrices Pressing ´mV dimensions the matrix specified in R I according to the dimensions in the X- and Y-registers. Pressing lmV recalls to the X- and Y-registers the dimensions of the matrix specified in R I . Pressing GV or tV has the same result as pressing ...
Page 176 - 76 Section 12: Calculating with Matrices; Using Matrix Operations in a Program
176 Section 12: Calculating with Matrices Using Matrix Operations in a Program If the calculator is in User mode during program entry when you enter a O or l { A through E , % } instruction to store or recall a matrix element, a u replaces the dash usually displayed after the line number. When this ...
Page 177 - Section 12: Calculating with Matrices 177; Summary of Matrix Functions; Results
Section 12: Calculating with Matrices 177 The > 7 (row norm) and > 8 (Frobenius norm) functions also operate as conditional branching instructions in a program. If the X-register contains a matrix descriptor, these functions calculate the norm in the usual manner, and program execution continu...
Page 178 - 78 Section 12: Calculating with Matrices
178 Section 12: Calculating with Matrices Keystroke(s) Results result matrix. ´> 6 Calculates residual in result matrix. ´> 7 Calculates row norm of matrix specified in X-register. ´> 8 Calculates Frobenius or Euclidean norm of matrix specified in X-register. ´> 9 Calculates determinant ...
Page 179 - Section 12: Calculating with Matrices 179
Section 12: Calculating with Matrices 179 Keystroke(s) Results O < Designates matrix specified in X-register as result matrix. ´ U Row and column numbers in R 0 and R 1 are automatically incremented each time O or l { A through E , % } is pressed. ∕ Inverts matrix specified in X-register. Stores ...
Page 180 - Using
180 Section 13 Finding the Roots of an Equation In many applications you need to solve equations of the form f(x)= 0 . * This means finding the values of x that satisfy the equation. Each such value of x is called a root of the equation f(x) = 0 and a zero of the function f(x). These roots (or zeros...
Page 182 - 82 Section 13: Finding the Roots of an Equation
182 Section 13: Finding the Roots of an Equation Keystrokes Display ´ b 0 001–42,21, 0 Begin with b instruction. Subroutine assumes stack loaded with x . 3 002– 3 - 003– 30 Calculate x – 3. * 004– 20 Calculate ( x – 3) x . 1 005– 1 0 006– 0 - 007– 30 Calculate ( x – 3) x – 10. | n 008– 43 32 In Run ...
Page 186 - 86 Section 13: Finding the Roots of an Equation; When No Root Is Found; is
186 Section 13: Finding the Roots of an Equation Fahr's ridget falls to the ground 9.2843 seconds after he hurls it—a remarkable toss. When No Root Is Found You have seen how the _ key estimates and displays a root of an equation of the form f(x) = 0. However, it is possible that an equation has no ...
Page 187 - Section 13: Finding the Roots of an Equation 187; Error 8
Section 13: Finding the Roots of an Equation 187 Because the absolute-value function is minimum near an argument of zero, specify the initial estimates in that region, for instance 1 and -1. Then attempt to find a root. Keystrokes Display | ¥ Run mode. 1 v 1.0000 Initial estimates. 1 “ –1 ´ _ 1 Erro...
Page 188 - 88 Section 13: Finding the Roots of an Equation; Choosing Initial Estimates
188 Section 13: Finding the Roots of an Equation The final case points out a potential deficiency in the subroutine rather than a limitation of the root-finding routine. Improper operations may sometimes be avoided by specifying initial estimates that focus the search in a region where such an outco...
Page 189 - Section 13: Finding the Roots of an Equation 189
Section 13: Finding the Roots of an Equation 189 If you have some knowledge of the behavior of the function f(x) as it varies with different values of x , you are in a position to specify initial estimates in the general vicinity of a zero of the function. You can also avoid the more troublesome ran...
Page 190 - 90 Section 13: Finding the Roots of an Equation; Find the desired height:
190 Section 13: Finding the Roots of an Equation Keystrokes Display - 003– 30 * 004– 20 ( x – 6) x . 8 005– 8 + 005– 40 * 007– 20 (( x – 6) x + 8 ) x. 4 008– 4 * 009– 20 4 (( x – 6) x + 8) x. 7 010– 7 . 011– 48 5 012– 5 - 013– 30 |n 014– 43 32 It seems reasonable that either a tall, narrow box or a ...
Page 192 - 92 Section 13: Finding the Roots of an Equation; Error 5
192 Section 13: Finding the Roots of an Equation Many functions exhibit special behavior when their arguments approach zero. You can check your function to determine values of x for which any argument within your function becomes zero, and then specify estimates at or near those values. Although t...
Page 193 - Section 13: Finding the Roots of an Equation 193; Restriction on the Use of; Error 7; Memory Requirements
Section 13: Finding the Roots of an Equation 193 Restriction on the Use of _ The one restriction regarding the use of _ is that _ cannot be used recursively. That is, you cannot use _ in a subroutine that is called during the execution of _ . If this situation occurs, execution stops and Error 7 is ...
Page 194 - Numerical Integration
194 Section 14 Numerical Integration Many problems in mathematics, science, and engineering require calculating the definite integral of a function. If the function is denoted by f(x) and the interval of integration is a to b, the integral can be expressed mathematically as . ) ( dx x f I b a Th...
Page 195 - Section 14: Numerical Integration 195
Section 14: Numerical Integration 195 In Run mode: 2. Key the lower limit of integration ( a ) into the X-register, then press v to lift it into the Y-register. 3. Key the upper limit of integration ( b ) in to the X-register. 4. Press ´ f followed by the label of your subroutine. Example: Certain p...
Page 196 - 96 Section 14: Numerical Integration
196 Section 14: Numerical Integration Keystrokes Display | ¥ Run mode. 0 v 0.0000 Key lower limit, 0, into Y-register. | $ 3.1416 Key upper limit, π, into X-register. |R 3.1416 Specify Radians mode for trigonometric functions. Now you are ready to press ´f 0 to calculate the integral. When you do so...
Page 198 - 98 Section 14: Numerical Integration
198 Section 14: Numerical Integration Keystrokes Display [ 002– 23 Calculate sin θ . - 003– 30 Since a value of θ will be placed into the Y-register by the f algorithm before it executes this subroutine, the - operation at this point will calculate ( θ – sin θ ). \ 004– 24 Calculate cos ( θ – sin θ ...
Page 199 - Section 14: Numerical Integration 199
Section 14: Numerical Integration 199 Find Si (2). Key in the following subroutine to evaluate the function f(x) = (sin x ) / x . * Keystrokes Display |¥ 000– Program mode. ´ b .2 001–42,21, .2 Begin subroutine with a b instruction. [ 002– 23 Calculate sin x . ® 003– 34 Since a value of x will be pl...
Page 200 - 00 Section 14: Numerical Integration; Accuracy of; no more
200 Section 14: Numerical Integration Accuracy of f The accuracy of the integral of any function depends on the accuracy of the function itself. Therefore, the accuracy of an integral calculated using f is limited by the accuracy of the function calculated by your subroutine. * To specify the accura...
Page 202 - 02 Section 14: Numerical Integration
202 Section 14: Numerical Integration If the uncertainty of an approximation is larger than what you choose to tolerate, you can decrease it by specifying a greater number of digits in the display format and repeating the approximation. * Whenever you want to repeat an approximation, you don't need ...
Page 203 - Error 7
Section 14: Numerical Integration 203 In the preceding example, the uncertainty indicated that the approximation might be correct to only four decimal places. If we temporarily display all 10 digits of the approximation, however, and compare it to the actual value of the integral (actually, an appro...
Page 204 - 04 Section 14: Numerical Integration
204 Section 14: Numerical Integration Memory Requirements f requires 23 registers to operate. (Appendix C explains how they are automatically allocated from memory.) If 23 unoccupied registers are not available, f will not run and Error 10 will be displayed. A routine that combines f and _ also requ...
Page 205 - Appendix A; Error Conditions; Error 0: Improper Mathematics Operation
205 Appendix A Error Conditions If you attempt a calculation containing an improper operation – say division by zero – the display will show Error and a number. To clear an error message, press any one key. This also restores the display prior to the Error display. The HP-15C has the following error...
Page 206 - Error 1: Improper Matrix Operation; Error 2
206 Appendix A: Error Conditions x or y is noninteger; x < 0 or y < 0; x > y ; x or y ≥ 10 10 . Error 1: Improper Matrix Operation Applying an operation other than a matrix operation to a matrix, that is, attempting a nonmatrix operation while a matrix is in the relevant register (w...
Page 207 - Appendix A: Error Conditions 207
Appendix A: Error Conditions 207 Error 3: Improper Register Number or Matrix Element Storage register named is nonexistent or matrix element indicated is nonexistent. Error 4: Improper Line Number or Label Call Line number called for is currently unoccupied or nonexistent (>448); or you have atte...
Page 208 - 08 Appendix A: Error Conditions; Pr Error
208 Appendix A: Error Conditions + or - , where the dimensions are incompatible. * , where: the dimensions are incompatible; or the result is one of the arguments. ∕ , where the matrix is not square. scalar/matrix ÷ , where the matrix is not square. ÷ , where: the matrix in the X-register is n...
Page 209 - Appendix B; Stack Lift and; Digit Entry Termination; The only operations that do; after any operation
209 Appendix B Stack Lift and the LAST X Register The HP-15C calculator has been designed to operate in a natural manner. As you have seen working through this handbook, most calculations do not require you to think about the operation of the automatic memory stack. There are occasions, however – es...
Page 210 - 10 Appendix B: Stack Lift and the LAST X Register; Disabling Operations; does not change; Enabling Operations; stack
210 Appendix B: Stack Lift and the LAST X Register Disabling Operations Stack Lift. There are four stack-disabling operations on the calculator. * These operations disable the stack lift, so that a number keyed in after one of these disabling operations writes over the current number in the displaye...
Page 211 - Neutral Operations
Appendix B: Stack Lift and the LAST X Register 211 T y y y y Z x x x x Y 4.0000 53.1301 53.1301 53.1301 X 3 5.0000 0.0000 7 Keys: |: |` 7 Stack enabled. Stack disabled. No stack lift. Imaginary X-Register. All enabling functions provide for a zero to be placed in the imaginary X-register when the ne...
Page 212 - 12 Appendix B: Stack Lift and the LAST X Register; The following operations save
212 Appendix B: Stack Lift and the LAST X Register LAST X Register The following operations save x in the LAST X register: - x H \ k + [ H ] ∆ * \ h : ÷ ] À ; a , d p * q { r c * ‘ / N z & P[ ' w ∕ P\ o j ! P] @ > 5 through 9 ¤ H[ Y f † * Except when used as a matrix function. † f uses the LA...
Page 213 - Appendix C; Memory Allocation; The Memory Space; availability; Registers; data storage pool
213 Appendix C Memory Allocation The Memory Space Storage registers, program lines, and advanced function execution * all draw on a common memory space in the HP-15C. The availability of memory for a specific purpose depends on the current allocation of memory, as well as on the total memory capacit...
Page 214 - 14 Appendix C: Memory Allocation; Total allocatable; dd
214 Appendix C: Memory Allocation Total allocatable memory: 64 registers, numbered R 2 through R 65 . [( dd – 1) + uu + pp + (matrix elements) + (imaginary stack) + ( _ and f )] = 64. For memory allocation and indirect addressing, data registers R .0 through R .9 are referred to as R 10 through R 19...
Page 215 - Memory Reallocation
Appendix C: Memory Allocation 215 Memory Status ( W ) To view the current memory configuration of the calculator, press | W ( memory ), holding W to retain the display. * The display will be four numbers, dd uu pp-b where: dd = the number of the highest-numbered register in the data storage pool (ma...
Page 216 - cleared program memory; Restrictions on Reallocation
216 Appendix C: Memory Allocation 1. Place dd , the number of the highest data storage register you want allocated, into the display. 1 dd 65. The number of registers in the uncommitted pool (and therefore potentially available for programming) will be (65 – dd ). 2. Press ´ m % . There are two ...
Page 217 - maximum; Automatic Program Memory Reallocation; Conversion of Uncommitted Registers to Program Memory
Appendix C: Memory Allocation 217 When converting registers, note that: You can convert registers from the common pool only if they are uncommitted . If, for example, you try to convert registers which contain program instructions, you will get an Error 10 (insufficient memory). You can convert ...
Page 218 - 18 Appendix C: Memory Allocation; Two-Byte Program Instructions; Memory Requirements for the Advanced Functions; Function
218 Appendix C: Memory Allocation Your very first program instruction will commit R 65 (all seven bytes) from an uncommitted register to a program register. Your eighth program instruction commits R 64 , and so on, until the boundary of the common pool is encountered. Registers from the data storage...
Page 220 - Appendix D; A Detailed Look at; You will be able to use
220 Appendix D A Detailed Look at _ Section 13, Finding the Roots of an Equation, includes the basic information needed for the effective use of the _ algorithm. This appendix presents more advanced, supplemental considerations regarding _ . How _ Works You will be able to use _ most effectively by ...
Page 222 - 22 Appendix D: A Detailed Look at; Accuracy of the Root
222 Appendix D: A Detailed Look at _ The function's graph is either convex everywhere or concave everywhere. The only local minima and maxima of the function's graph occur singly between adjacent zeros of the function. In addition, it is assumed that the _ algorithm will not be interrupted by an...
Page 224 - 24 Appendix D: A Detailed Look at
224 Appendix D: A Detailed Look at _ the root 1.0000 is found for initial estimates of 1 and 2. By recognizing situations in which round-off error may influence the operation of _ , you can evaluate the results accordingly and perhaps rewrite the function to reduce the effects of round-off. In a var...
Page 226 - 26 Appendix D: A Detailed Look at; Interpreting Results
226 Appendix D: A Detailed Look at _ Execute _ again: Keystrokes Display | ¥ Run mode. 0 v 0.0000 Initial estimates. 1 1 ´ v B 4.0681 The desired root. ) 4.0681 A previous estimate of the root. ) 0.0000 Value of modified f(t) at root. After 4.0681 seconds, the ridget is at a height of 107 ± 0.5 mete...
Page 228 - 28 Appendix D: A Detailed Look at
228 Appendix D: A Detailed Look at _ Solution: The equation for the shear stress for x between 0 and 10 is more efficiently programmed after rewriting it using Horner's method: Q = (3 x –45) x 2 + 350 for 0 < x < 10. Keystrokes Display | ¥ 000– Program mode. ´ b 2 001–42,21, 2 1 002– 1 Test fo...
Page 229 - The large stress value at the root points out that the; When no root is found and
Appendix D: A Detailed Look at _ 229 Keystrokes Display | ¥ Run mode. 7 v 7.0000 Initial estimates. 14 14 ´_ 2 10.0000 Possible root. )) 1,000.0000 Stress not zero. The large stress value at the root points out that the _ routine has found a discontinuity. This is a place on the beam where the stres...
Page 232 - 32 Appendix D: A Detailed Look at; single
232 Appendix D: A Detailed Look at _ Keystrokes Display ÷ 017– 10 . 10 / x ' 018– 12 + 019– 40 x e x e x e 2 2 1 0 / . 3 020– 3 + 021– 40 x e x e x e 2 2 1 0 / 3 . |n 022– 43 32 Use _ with the following single initial estimates: 10, 1, and 10 -20 . Keystrokes Display |¥ Run mode. 10 ...
Page 233 - Finding Several Roots
Appendix D: A Detailed Look at _ 233 Keystrokes Display ´ _ .0 Error 8 − 1.0000 –20 Best x -value. ) 1.1250 –20 Previous value. ) 2.0000 Function value. | (| ( 1.0000 –20 Restore the stack. ´ _ .0 Error 8 − 1.1250 –20 Another x -value. ) 1.5626 –16 Previous value. ) 2.0000 Same function value. In ea...
Page 234 - 34 Appendix D: A Detailed Look at
234 Appendix D: A Detailed Look at _ add a few program lines at the end of your function subroutine. These lines should subtract the known root (to 10 significant digits) from the x -value and divide this difference into the function value. In many cases the root will be a simple one, and the new fu...
Page 235 - to find the most negative root.; Stores root for deflation.
Appendix D: A Detailed Look at _ 235 Keystrokes Display - 008– 30 * 009– 20 3 010– 3 0 011– 0 0 012– 0 3 013– 3 + 014– 40 * 015– 20 6 016– 6 1 017– 1 7 018– 7 1 019– 1 + 020– 40 * 021– 20 2 022– 2 8 023– 8 9 024– 9 0 025– 0 - 026– 30 |n 027– 43 32 In Run mode, key in two large, negative initial esti...
Page 236 - 36 Appendix D: A Detailed Look at
236 Appendix D: A Detailed Look at _ Return to Program mode and add instructions to your subroutine to eliminate the root just found. Keystrokes Display |¥ 000- Program mode. | ‚ | ‚ 026– 30 Line before n . ® 027– 34 Brings x into X-register. l 0 028– 45 0 Divides by (x – a ), where a is known root....
Page 238 - 38 Appendix D: A Detailed Look at; Limiting the Estimation Time
238 Appendix D: A Detailed Look at _ Using the same initial estimates each time, you have found four roots for this equation involving a fourth-degree polynomial. However, the last two roots are quite close to each other and are actually one root (with a multiplicity of 2). That is why the root was ...
Page 239 - Counting Iterations; For Advanced Information
Appendix D: A Detailed Look at _ 239 Counting Iterations While searching for a root, _ typically samples your function at least a dozen times. Occasionally, _ may need to sample it one hundred times or more. (However, _ will always stop by itself.) Because your function subroutine is executed once f...
Page 240 - Appendix E
240 Appendix E A Detailed Look at f Section 14, Numerical Integration, presented the basic information you need to use f This appendix discusses more intricate aspects of f that are of interest if you use f often. How f Works The f algorithm calculates the integral of a function f(x) by computing a ...
Page 241 - Accuracy, Uncertainty, and Calculation Time; by just one
Appendix E: A Detailed Look at f 241 The uncertainty of the final approximation is a number derived from the display format, which specifies the uncertainty for the function. * At the end of each iteration, the algorithm compares the approximation calculated during that iteration with the approximat...
Page 242 - 42 Appendix E: A Detailed Look at
242 Appendix E: A Detailed Look at f Calculate the integral in the expression for J 4 (1), 0 ) si n 4 cos( d First, switch to Program mode and key in a subroutine that evaluates the function f(θ) = cos (4 θ – sin θ ). Keystrokes Display |¥ 000- Program mode. ´ CLEAR M 000- ´ b 0 001–42,2...
Page 244 - 44 Appendix E: A Detailed Look at
244 Appendix E: A Detailed Look at f All 10 digits of the approximations in i 2 and i 3 are identical: the accuracy of the approximation in i 3 is no better than the accuracy in i 2 despite the fact that the uncertainty in i 3 is less than the uncertainty in i 2. Why is this? Remember that the accur...
Page 245 - Uncertainty and the Display Format
Appendix E: A Detailed Look at f 245 This approximation took about twice as long as the approximation in i 3 or i 2. In this case, the algorithm had to evaluate the function at about twice as many sample points as before in order to achieve an approximation of acceptable accuracy. Note, however, tha...
Page 246 - 46 Appendix E: A Detailed Look at
246 Appendix E: A Detailed Look at f ) ( δ ) ( ) ( 2 x x f x F , where δ 2 ( x ) is the uncertainty associated with f(x) that is caused by the approximation to the actual physical situation. Since ) ( δ ) ( ˆ ) ( 1 x x f x f , the function you want to integrate is ) ( δ ) ( δ ) ( ˆ ) ( 2 1 x...
Page 248 - 48 Appendix E: A Detailed Look at; relative
248 Appendix E: A Detailed Look at f b a d x x ) δ ( Δ dx b a x m n ] 10 [0.5 ) ( . This integral is calculated using the samples of δ ( x ) in roughly the same ways that the approximation to the integral of the function is calculated using the samples of ) ( ˆ x f . Because Δ is propo...
Page 249 - Conditions That Could Cause Incorrect Results; The possibility of this occurring is
Appendix E: A Detailed Look at f 249 Conditions That Could Cause Incorrect Results Although the f algorithm in the HP-15C is one of the best available, in certain situations it – like nearly all algorithms for numerical integration – might give you an incorrect answer. The possibility of this occurr...
Page 251 - xe
Appendix E: A Detailed Look at f 251 Since you’re evaluating this integral numerically, you might think (naively in this case, as you'll see) that you should represent the upper limit of integration by 10 99 – which is virtually the largest number you can key into the calculator. Try it and see what...
Page 252 - 52 Appendix E: A Detailed Look at
252 Appendix E: A Detailed Look at f The graph is a spike very close to the origin. (Actually, to illustrate f(x) the width of the spike has been considerably exaggerated. Sho wn in actual scale over the interval of integration, the spike would be indistinguishable from the vertical axis of the grap...
Page 254 - 54 Appendix E: A Detailed Look at; Conditions That Prolong Calculation Time
254 Appendix E: A Detailed Look at f In many cases you will be familiar enough with the function you want to integrate that you’ll know whether the function has any quick wiggles relative to the interval of integration. If you're not familiar with the function, and you have reason to suspect that it...
Page 255 - Approximation to integral.
Appendix E: A Detailed Look at f 255 Keystrokes Display 0 v 0.000 00 Keys lower limit into Y-register. ‛ 3 1 03 Keys upper limit into X-register. ´ f 1 1.000 00 Approximation to integral. ® 1.824 -04 Uncertainty of approximation. This is the correct answer, but it took almost 60 seconds. To understa...
Page 258 - 58 Appendix E: A Detailed Look at
258 Appendix E: A Detailed Look at f If any other program line is displayed, return to Run mode and single-step (  ) through the program until you reach a n instruction (keycode 43 32) or line 000 (if there is no n ). (Be sure to hold the  key down long enough to view the program line numbers an...
Page 259 - Appendix F; Batteries; A battery symbol (; Installing New Batteries
259 Appendix F Batteries Batteries The HP-15C is shipped with two 3 Volt CR2032 Lithium batteries. Battery life depends on how the calculator is used. If the calculator is being used to perform operations other than running programs, it uses much less power. Low-Power Indication A battery symbol ( ...
Page 261 - Appendix F: Batteries 261
Appendix F: Batteries 261 Verifying Proper Operation (Self-Tests) If it appears that the calculator will not turn on or otherwise is not operating properly, use the following procedures to access the test system; 1) Turn the calculator off. 2) Press and HOLD the | and v keys (keep both keys held dow...
Page 262 - Function Summary and Index; Complex
262 Function Summary and Index = Turns the calculator's display on and off (page 18) . It is also used in resetting Continuous Memory (page 63) , changing the digit separator (page 61) , and in various tests of the calculator's operation (pages 261) . Complex Functions } Real exchange imaginary. Act...
Page 264 - 64 Function Summary and Index; Mathematics; page; Matrix Functions
264 Function Summary and Index number in display (X-register) (enter y, then x ). Causes the stack to drop (page 29) . Mathematics -+-÷ Arithmetic operators; cause the stack to drop (page 29) . ¤ Computes square root x (page 25) . x Computes the square of x (page 25) . ! Calculates the factorial ( n...
Page 265 - Number Alteration
Function Summary and Index 265 matrices or of one matrix and a scalar. Stores in result matrix (page 152-155) . ÷ For two matrices, multiplies inverse of matrix in X by matrix in Y. For only one matrix, if matrix in Y, divides all elements of matrix by scalar in X; if matrix in X, multiplies each el...
Page 266 - 66 Function Summary and Index; Percentage; Probability
266 Function Summary and Index register) by truncating fractional portion (page 24) . & Rounds mantissa of entire (10-digit) number in X-register to match display format (page 24) . Percentage k Percent. Computes x % (value in display) of number in the Y-register (page 29) . Unlike most two-numb...
Page 267 - Function Summary and Index 267; Statistics; Storage
Function Summary and Index 267 ` Clears contents of display (X-register) to zero (page 21) . − In Run mode: removes the last digit keyed in, or clears the display (if digit entry has been terminated) (page21) . Statistics z Accumulates numbers from X- and Y-registers into storage registers R 2 throu...
Page 268 - 68 Function Summary and Index; Trigonometry
268 Function Summary and Index Trigonometry D Sets decimal Degrees mode for trigonometric functions—indicated by absence of GRAD or RAD annunciator (page 26) . Not operative for complex trigonometry. R Sets Radians mode for trigonometric functions—indicated by RAD annunciator (page 26) . g Sets Grad...
Page 269 - Programming Summary and Index; ABCÁE
269 Programming Summary and Index ¥ Program/Run mode. Sets the calculator to Program mode ( PRGM annunciator on) or Run mode ( PRGM annunciator cleared) (page 66) . W Displays current status of calculator memory (number of registers dedicated to data storage, the common pool, and program memory) (pa...
Page 271 - Subject Index; bold
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 Annuncia...
Page 284 - Federal Communications Commission Notice; Reorient or relocate the receiving antenna.; Modifications
284 Product Regulatory & Environment Information Federal Communications Commission Notice This equipment has been tested and found to comply with the limits for a Class B digital device, pursuant to Part 15 of the FCC Rules. These limits are designed to provide reasonable protection against harm...
Page 285 - Canadian Notice
Declaration of Conformity for Products Marked with FCC Logo, United States Only This device complies with Part 15 of the FCC Rules. Operation is subject to the following two conditions: (1) this device may not cause harmful interference, and (2) this device must accept any interference received, inc...
Page 286 - European Union Regulatory Notice
286 European Union Regulatory Notice Products bearing the CE marking comply with the following EU Directives: • Low Voltage Directive 2006/95/EC • EMC Directive 2004/108/EC • Ecodesign Directive 2009/125/EC, where applicable CE compliance of this product is valid if powered with the correct CE-marke...