Casio FX-9750G User manual

Program Library
1 Prime Factor Analysis
2 Greatest Common Measure
3t-Test Value
4 Circle and Tangents
5 Rotating a Figure
Before using the Program Library
• Be sure to check how many bytes of unused memory is remain-
ing before attempting to perform any programming.
• This Program Library is divided into two sections: a numeric cal-
culation section and a graphics section. Programs in the numeric
calculation section produce results only, while graphics programs
use the entire display area for graphing. Also note that calcula-
tions within graphics programs do not use the multiplication sign
(×) wherever it can be dropped (i.e. in front of open parenthesis).
Chapter
21

376
PROGRAM SHEET
Program for Prime Factor Analysis
Description
Produces prime factors of arbitrary positive integers
For 1 < m< 1010
Prime numbers are produced from the lowest value first. “END” is displayed at the end
of the program.
(Overview)
mis divided by 2 and by all successive odd numbers (d= 3, 5, 7, 9, 11, 13, ....) to check
for divisibility.
Where dis a prime factor, mi= mi–1/dis assumed, and division is repeated until
mi+ 1 <d.
Example [1]
119 = 7 ×17
[2]
440730 = 2 ×3 ×3 ×5 ×59 ×83
[3]
262701 = 3 ×3 ×17 ×17 ×101
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
Step Key operation Display Step Key operation Display
No. 1

377
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
P
Lbl
Lbl
Lbl
Lbl
Lbl
Goto
Lbl
Lbl
Lbl
Lbl
Lbl
R
0
1
2
3
4
6
5
6
7
8
9
M
:
:
:
:
:
:
:
:
:
:
:
"
2
Frac
B
B
A
B
A
"
F
M
^
(
A
I
+
÷
^
^
E
A
"
A
A
+
C
2
B
A
N
C
?
÷
÷
1
⇒
→
×
÷
D
T
→
2
2
→
Goto
B
B
B
"
:
A
=
:
:
Goto
A
A
Goto
A
→
)
C
8
:
–
→
^
Goto
:
0
Frac
4
=
:
0
2
A
⇒
(
:
0
Goto
:
=
Goto
A
⇒
3
1
1
÷
Goto
:
⇒
:
B
7
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
mi
d
mi +1
Goto
3
)
:
9
→
=
Goto
:
B
0
5
:
⇒
:
No. 1
Line Program
File
name
Memory Contents

378
PROGRAM SHEET
Program for Greatest Common Measure
Description
Euclidean general division is used to determine the greatest common measure for two interers
aand b.
For |a|, |b| < 109, positive values are taken as < 1010
(Overview)
n0=max (|a|, |b|)
n1= min (|a|, |b|)
nk–2
nk= nk–2 – ––– nk–1
nk–1
k= 2, 3....
If nk= 0, then the greatest common measure (c) will be nk–1.
Example [1] [2] [3]
When a= 238 a= 23345 a= 522952
b= 374 b= 9135 b= 3208137866
↓↓ ↓
c= 34 c= 1015 c= 998
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
Step Key operation Display Step Key operation Display
No. 2

379
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
C
Lbl
Abs
B
A
Lbl
C
B
Lbl
M
1
A
<
→
2
=
→
3
N
:
→
A
C
:
0
A
:
"
A
⇒
:
( – )
⇒
:
B
F
A
:
Goto
B
(
Goto
C
^
A
"
Abs
2
→
lnt
3
→
Goto
C
?
B
:
A
(
:
B
1
T
→
→
:
A
:
:
:
→
B
2
A
B
C
÷
Goto
"
B
)
:
B
:
×
"
B
?
–
→
A
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
a, n0
b, n1
nk
B
)
:
→C:
No. 2
Line Program
File
name
Memory Contents

380
PROGRAM SHEET
t =(x – m)
xn–1
n
Program for t-Test Value
Description
The mean (sample mean) and sample standard deviation can be used to obtain a t-test value.
x: mean of xdata
xσn–1 : sample standard deviation of xdata
n: number of data items
m: hypothetical population standard deviation (normally repre-
sented by µ , but mis used here because of variable name
limitations)
Example To determine whether the population standard deviation for sample data 55, 54, 51,
55, 53, 53, 54, 52, is 53.
Perform a t-test with a level of significance of 5%.
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
No. 3
Step Key operation Display Step Key operation Display
The above operation produces a t-test value of t(53) = 0.7533708035. According to the t-distribution
table in the next page, a level of significance of 5% and a degree of freedom of 7 (n– 1 = 8 – 1 = 7)
produce a two-sided t-test value of approximately 2.365. Since the calculated t-test value is lower
than the table value, the hypothesis that population mean mequals 53 is accepted.

381
1
2
3
4
5
6
7
8
9
10
15
20
25
30
35
40
45
50
60
80
120
240
∞
0.2
3.078
1.886
1.638
1.533
1.476
1.440
1.415
1.397
1.383
1.372
1.341
1.325
1.316
1.310
1.306
1.303
1.301
1.299
1.296
1.292
1.289
1.285
1.282
0.1
6.314
2.920
2.353
2.132
2.015
1.943
1.895
1.860
1.833
1.812
1.753
1.725
1.708
1.697
1.690
1.684
1.679
1.676
1.671
1.664
1.658
1.651
1.645
12.706
4.303
3.182
2.776
2.571
2.447
2.365
2.306
2.262
2.228
2.131
2.086
2.060
2.042
2.030
2.021
2.014
2.009
2.000
1.990
1.980
1.970
1.960
63.657
9.925
5.841
4.604
4.032
3.707
3.499
3.355
3.250
3.169
2.947
2.845
2.787
2.750
2.724
2.704
2.690
2.678
2.660
2.639
2.617
2.596
2.576
0.05 0.01
1
2
3
4
5
6
7
T
{
5
l-Var
Lbl
(
"
Goto
5
4
List
0
x
T
0
T
5
,
1
:
–
=
E
,
5
,
"
M
"
S
5
2
1
M
)
:
T
4
}
_
"
÷
T
,
→
?
(
^
5
List
→
xσn–1
,
_
_
1
1
M
÷
5
n
5
)
,
→
5
T
3
_
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
mt
,53,
P (Probability)
Degree
of Freedom
No. 3
Line Program
•t-distribution table
The values in the top row of the table show the probability (two-sided
probability) that the absolute value of tis greater than the table values
for a given degree of freedom.
Memory Contents
File
name
M:aM
T:aT

382
PROGRAM SHEET
Program for Circle and Tangents
Description
Formula for circle:
x2+ y2= r2
Formula for tangent line passing
through point A (x', y'):
y– y' = m(x– x')
*mrepresents the slope of the
tangent line
With this program, slope mand intercept b(= y' – mx') are obtained for lines drawn from point
A (x', y') and are tangent to a circle with a radius ofr. The trace function is used to read out the
coordinates at the points of tangency, and factor zoom is used to enlarge the graph.
Example
To determine mand bfor the following values:
r= 1
x'= 3
y'= 2
Notes
• The point plotted for A cannot be moved. Even if it is moved on the graph, the calculation is
performed using the original value.
• An error (Ma ERROR) occurs when r= x'.
• Be sure to always perform a trace operation whenever you select trace and the message
TRACE is on the display.
Preparation and operation
• Store the program written on the next page.
• Execute the program as shown below.
No. 4
0X
YA(x',y')
r
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Memory Contents

383
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
T
Prog
"
R
Prog
"
X
"
Plot
R
(
Lbl
Graph Y=
"
"
Lbl
"
Y
N
1
Z
Lbl
(
Graph Y=
"
"
Lbl
"
Y
N
2
Z
Lbl
"
"
A
"
X
=
"
(
=
Y
A
x2
6
M
M
B
0
T
E
O
→
=
2
(–)
N
M
B
5
T
E
O
→
=
1
T
Factor
N
W
x2
"
C
X
"
=
,
(
P
_
(
=
=
_
R
S
⇒
S
0
_
A
(
=
=
_
R
S
⇒
S
0
_
R
N
G
I
+
?
I
,
?
"
B
A
–
X
"
"
A
⇒
0
:
⇒
B
X
"
"
A
⇒
0
:
⇒
A
:
E
N
Y
→
R
Y
→
?
^
x2
A
–
:
:
C
1
"
Z
Goto
–
–
:
:
C
1
"
Z
Goto
C
N
N
D
x2
R
C
)
A
→
+
B
A
M
B
E
_
:
=
2
A
N
B
E
_
:
=
3
E
=
T
O
=
_
L
_
_
B
B
)
)
^
–
?
?
1
:
P
)
^
–
?
?
1
:
"
"
W
R
E
_
x2
(
+
M
_
→
⇒
Goto
)
+
N
_
→
⇒
Goto
^
?
_
_
^
R
x2
^
^
_
1
_
R
^
^
_
1
_
F
"
x2
"
–
R
B
A
Z
Goto
0
(
B
A
Z
Goto
5
→
x2
–) A→ x2P )
_
x–1
_
_
:
x2–
Factor
A











F
x2











_
)
→
x–1
M
→
_
N_
No. 4
Line Program
File
name

384
View
Window
35
36
37
38
39
40
41
42
43
44
1
2
1
2
Prog
S
Graph Y=
Goto
Lbl
Graph Y=
Prog
:
Lbl
"
W
1
C
Graph Y=
Graph Y=
"
=
N
3
9
M
"
Goto
3
E
I
(–)
,
I
(–)
C
2
(
_
_
(
W
6
_
N
N
6
1
R
(
I
⇒
X
X
I
_
D
D
.
C
R
(
R
Graph Y=
–
–
N
"
O
3
L
x2
R
C
M
A
A
D
W
,
E
–
x2
L
(
)
)
O
6
X
–
E
X
+
+
W
.
x2
X
:
A
^
^
:
,
_
)
"
–
B
B
"
3
)
x2
S
)
Prog
1
=
+
"
,
1
B
C
(–)
⇒
_
I
3
Goto
R
.
9
C
1
_
L
,
E
3
"
.
No. 4
Line Program
File
name
File
name