## Sunday, December 24, 2023

### TI-73 (Explorer): Percents and Random Fractions

TI-73 (Explorer):  Percents and Random Fractions

TI-73 Program:  PERCENT

TAX+:  Appropriately add a percent to a number.   Application:  Sales Tax

TAX-:   Appropriately subtract a percent from a number.  Application:  Discount

% CHANGE:  Percent change from the old number to new number.  Additional application:  Percent Markup (OLD = cost, NEW = selling price)

%TOT:  Finds the percentage portion of a total number

% MARGIN:  Given an item's cost and selling price, calculate the item's percent margin.

Code:

"EWS 2023-12-02"     // (comment)

Lbl 0

"% CHANGE",3,"%TOT",4,"% MARGIN",5,

"EXIT",E)

Lbl 1

Prompt N

Input "X% ",X

N*(1+X%)→Y

Pause Y

Goto 0

Lbl 2

Prompt N

Input "X% ",X

N*(1-X%)→Y

Pause Y

Goto 0

Lbl 3

Input "OLD=",O

Input "NEW=",N

(N-O)*100/O→Y

Disp "% CHANGE="

Pause Y

Goto 0

Lbl 4

Input "PART=",P

Input "WHOLE=",W

100*P/W→Y

Disp "%"

Pause Y

Goto 0

Lbl 5

Input "COST=",C

Input "SELL PRICE=",S

(S-C)/S*100→Y

Disp "% MARGIN="

Pause Y

Goto 0

Lbl E

Disp "BYE"

Pause

Note:   Results that are to be displayed need to be followed or accompanied by a Pause command, unless the results will not show.  This wrinkle is unique to the TI-73.

TI-73  Program:  RANDFRAC

Generate a number of fractions with randomized numerators and denominators.

T = number of fractions to be generator

L = upper limit that the numerator and denominator can take.  The numbers range from 1 to L

The result is returned in three parts:

numerator

denominator

fraction

For example:

5

7

5/7

Simplification rules are set through the MODE key.

Code:

"EWS 2023-12-02"     // (comment)

Disp "NO. FRACTIONS"

Prompt T

Disp "UPPER LIMIT"

Prompt L

For(I,1,T)

randInt(1,L)→N

randInt(1,L)→D

N ⁄ D→F     // N [ b/c ] D [ STO> ] F

Disp N,D,F

Pause

End

Note:  The fraction symbol pressed by [ b/c ], symbolized by  ⁄, shows on the screen as a thick division slash.

For those of you who are celebrating, Merry Christmas!

Eddie

All original content copyright, © 2011-2023.  Edward Shore.   Unauthorized use and/or unauthorized distribution for commercial purposes without express and written permission from the author is strictly prohibited.  This blog entry may be distributed for noncommercial purposes, provided that full credit is given to the author.

### TI 30Xa Algorithms: Greatest Common Divisor

TI 30Xa Algorithms: Greatest Common Divisor To find the greatest common divisor between two positive integers U and V: Let U ≥ V. ...