Skip to content

Implementation of the results of my proofs of the Euclidean Algorithm's greatest common divisor and the lowest common multiple into Python.

Notifications You must be signed in to change notification settings

faycalki/Euclidean_Algorithm_for_two_or_more_numbers

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 

Repository files navigation

Logo of the project

The Euclidean Algorithm implementation with the LCM

This program coded entirely in Python version 3.9 is built upon the deductive logic of two declarative statements I've proven before: the Euclidean Algorithm's highest common factor and the LCM. With this program I demonstrate the capability of those results by providing my implementation of the results into this program.

This is an implementation of an inductive euclidean algorithm such that it allows you to compute the HCF and LCM of any n number of integers.

Also features extended euclidean algorithm, which outputs Bezout's Identity, with a patch to make it only output positive coefficient of the smaller integer in Bezout's Identity.

Installing / Getting started

Python Interpreter 3+ is required in order to compile the code, you may build this into an executable through other means if you wish. Standard compilation is all that is needed.

python Euclidean_Algorithm_for_2_or_more_numbers_main.py

Once the code is executed, you will be provided with a prompt asking you the number of integers you'd like to compute the HCF and LCM of, as well as the integers themselves. For Bezout's Identity you'll need to call upon it by making your own script.

Developing

git clone https://github.com/faycalki/Euclidean_Algorithm_for_2_or_more_numbers.git

Features

  • Efficiently computes the greatest common divisor of any n number of integers, as well as their lowest common multiple.
  • Minimal dependencies.
  • Can be implemented as a fully modular program with minimal editing.
  • Extended euclidean algorithm, which outputs Bezout's Identity, with a patch to make it only output positive coefficient of the smaller integer in Bezout's Identity.

Contributing

If you'd like to contribute, please fork the repository and use a feature branch. Pull requests are warmly welcome.

Links

Licensing

The code in this project is licensed under the GNU General Public License v3.0.

Disclaimer

This project is intended to be used for legal purposes only, and is pursuant to the license terms and conditions provided.

About

Implementation of the results of my proofs of the Euclidean Algorithm's greatest common divisor and the lowest common multiple into Python.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages