Fx Plus Chapter22

download Fx Plus Chapter22

of 18

Transcript of Fx Plus Chapter22

  • 8/10/2019 Fx Plus Chapter22

    1/18

    Program Library1 Prime Factor Analysis

    2 Greatest Common Measure

    3 t-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

    calculation section and a graphics section. Programs in thenumeric calculation section produce results only, while graphics

    programs use the entire display area for graphing. Also note

    that calculations within graphics programs do not use the

    multiplication sign () wherever it can be dropped (i.e. in front of

    open parenthesis).

    Chapter

    22

  • 8/10/2019 Fx Plus Chapter22

    2/18

    412

    PROGRAM SHEET

    Program forPrime 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= mi1/dis assumed, and division is repeated untilmi+ 1

  • 8/10/2019 Fx Plus Chapter22

    3/18

    413

    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

    LblLbl

    Lbl

    Lbl

    Lbl

    Goto

    Lbl

    Lbl

    LblLbl

    Lbl

    R

    01

    2

    3

    4

    6

    5

    6

    78

    9

    M

    ::

    :

    :

    :

    :

    :

    :

    ::

    :

    "2

    Frac

    B

    B

    A

    BA

    "

    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

    2A

    (

    :

    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

    Filename

    Memory

    Contents

  • 8/10/2019 Fx Plus Chapter22

    4/18

    414

    PROGRAM SHEET

    Program for

    Greatest Common Measure

    Description

    Euclidean general division is used to determine the greatest common measure for two

    interers aandb.For |a|, |b| < 109, positive values are taken as < 1010

    (Overview)

    n0 =max(|a|, |b|)n1 = min (|a|, |b|)

    nk2nk = nk2 nk1nk1

    k= 2, 3....

    If nk= 0, then the greatest common measure (c) will be nk1.

    Example [1] [2] [3]

    When a= 238 a= 23345 a= 522952b= 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

  • 8/10/2019 Fx Plus Chapter22

    5/18

    415

    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

    LblAbs

    B

    A

    Lbl

    C

    B

    Lbl

    M

    1A