(12C) Slicing Right Triangles

[Eddie W. Shore]

HP 12C Slicing a Right Triangle

The program finds slices a right triangle into equal parts. Using similar triangles, the bases and heights of similar triangles are found.

STEP; KEY; CODE NUMBER
01; RCL 0; 45, 0
02; RCL 2; 45, 2
03; ÷; 10
04; INTG; 43, 25
05; STO 3; 44, 3
06; 1; 1
07; STO 4; 44, 4
08; RCL 0; 45, 0
09; RCL 3; 45, 3
10; RCL 4; 45, 4
11; *; 20
12; -; 30
13; R/S; 31
14; RCL 1; 45, 1
15; *; 20
16; RCL 0; 45, 0
17; ÷; 10
18; R/S; 31
19; 1; 1
20; STO+ 4; 44, 40, 4
21; RCL 2; 45, 2
22; RCL 4; 45, 4
23; X≤Y; 43, 34
24; GTO 08; 43, 33, 08
25; GTO 00; 43, 33, 00

Input: Pre-store the following values:
Run in Register 0 (R0)
Rise in Register 1 (R1)
Number of partitions in Register (R2)

Output: Loop:
Base of the smaller triangle (x), press [ R/S ]
Height of the smaller triangle (y), press [ R/S ]
Loop ends after n pairs

Example: Run = 5 (R0), Height = 3 (R1), Number of Partitions = 5 (R2)

Output:
X 4.00 3.00 2.00 1.00 0.00
Y 2.40 1.80 1.20 0.60 0.00