HP Forums / HP Software Libraries / General Software Library v / (11C) Greatest Common Divisor

Post Reply 
(11C) Greatest Common Divisor
12-31-2017, 05:14 AM (This post was last modified: 12-31-2017 07:04 AM by Gamo.)
Post: #1
Gamo Offline
Senior Member
 		Posts: 728
Joined: Dec 2016
(11C) Greatest Common Divisor
Quick and Simple program to find GCD of two integers.

Code:

01  LBL A
02  -
03  LSTx
04  X<>Y
05  ABS
06  X≠Y  ( for 15C [g TEST 6] )
07  GTO A
08  R/S

Example: GCD (256, 656) is 16 --> 256 ENTER 656 A

GCD (9119, 1991) is 11 --> 9119 ENTER 1991 A

Gamo
Find all posts by this user
Quote this message in a reply
Post Reply 


Messages In This Thread
(11C) Greatest Common Divisor - Gamo - 12-31-2017 05:14 AM
RE: (11C) Greatest Common Divisor - Gamo - 01-08-2018, 01:29 AM



User(s) browsing this thread: 1 Guest(s)

Contact Us | The Museum of HP Calculators | Return to Top | Return to Content | Lite (Archive) Mode | RSS Syndication