https://github.com/fernancelot/ti-calc-python-app-standard-euclidean-algorithm

Standard Euclidean Algorithm PYTHON application for the TI-84 PLUS CE PYTHON edition calculator
https://github.com/fernancelot/ti-calc-python-app-standard-euclidean-algorithm

micropython ti-84 ti-84-plus-ce ti-84-plus-ce-t-python ti-84-programs

Last synced: about 5 hours ago
JSON representation

Standard Euclidean Algorithm PYTHON application for the TI-84 PLUS CE PYTHON edition calculator

• Host: GitHub
• URL: https://github.com/fernancelot/ti-calc-python-app-standard-euclidean-algorithm
• Owner: Fernancelot
• Created: 2024-07-27T03:48:51.000Z (5 months ago)
• Default Branch: main
• Last Pushed: 2024-07-27T03:58:31.000Z (5 months ago)
• Last Synced: 2024-12-25T12:21:32.110Z (about 5 hours ago)
• Topics: micropython, ti-84, ti-84-plus-ce, ti-84-plus-ce-t-python, ti-84-programs
• Language: Python
• Homepage:
• Size: 7.81 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
**Standard Euclidean Algorithm PYTHON application for the TI-84 PLUS CE PYTHON edition calculator**

• This is a simple implementation of the Euclidean Algorithm to calculate the Greatest Common Divisor (GCD) of two integers.

• The program takes two integers as input and calculates the GCD using the Euclidean Algorithm.

• It also displays the steps involved in the calculation of the GCD.

• The main function takes user input for the two integers and calls the euclidean_algorithm function to display the results.

• The program can be run and tested with different input values to verify the correctness of the Euclidean Algorithm.

• The Euclidean Algorithm is an efficient method for finding the greatest common divisor (GCD) of two integers.

• The algorithm works by repeatedly applying the division algorithm to find the remainder of the division of two integers.

• The GCD is the last non-zero remainder obtained in the process.