| Name | egcd JSON |
| Version |
2.0.2
JSON |
| download |
| home_page | None |
| Summary | Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments. |
| upload_time | 2024-12-31 21:05:21 |
| maintainer | None |
| docs_url | None |
| author | Andrei Lapets |
| requires_python | >=3.7 |
| license | MIT |
| keywords |
|
| VCS |
 |
| bugtrack_url |
|
| requirements |
No requirements were recorded.
|
| Travis-CI |
No Travis.
|
| coveralls test coverage |
No coveralls.
|
====
egcd
====
Pure-Python `extended Euclidean algorithm <https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm>`__ implementation that accepts any number of integer arguments.
|pypi| |readthedocs| |actions| |coveralls|
.. |pypi| image:: https://badge.fury.io/py/egcd.svg#
:target: https://badge.fury.io/py/egcd
:alt: PyPI version and link.
.. |readthedocs| image:: https://readthedocs.org/projects/egcd/badge/?version=latest
:target: https://egcd.readthedocs.io/en/latest/?badge=latest
:alt: Read the Docs documentation status.
.. |actions| image:: https://github.com/lapets/egcd/workflows/lint-test-cover-docs/badge.svg#
:target: https://github.com/lapets/egcd/actions/workflows/lint-test-cover-docs.yml
:alt: GitHub Actions status.
.. |coveralls| image:: https://coveralls.io/repos/github/lapets/egcd/badge.svg?branch=main
:target: https://coveralls.io/github/lapets/egcd?branch=main
:alt: Coveralls test coverage summary.
Installation and Usage
----------------------
This library is available as a `package on PyPI <https://pypi.org/project/egcd>`__:
.. code-block:: bash
python -m pip install egcd
The library can be imported in the usual way:
.. code-block:: python
from egcd import egcd
Examples
^^^^^^^^
.. |egcd| replace:: ``egcd``
.. _egcd: https://egcd.readthedocs.io/en/2.0.2/_source/egcd.html#egcd.egcd.egcd
.. |math_gcd| replace:: ``math.gcd``
.. _math_gcd: https://docs.python.org/3/library/math.html#math.gcd
The function |egcd|_ is a pure-Python implementation of the `extended Euclidean algorithm <https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm>`__ that can be viewed as an expansion of the functionality and interface of the built-in |math_gcd|_ function. When it is supplied two integer arguments ``a`` and ``b``, it returns a tuple of the form ``(g, s, t)`` where the three integers in the tuple satisfy the `identity <https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity>`__ ``(a * s) + (b * t) == g``:
.. code-block:: python
>>> egcd(1, 1)
(1, 0, 1)
>>> egcd(12, 8)
(4, 1, -1)
>>> egcd(23894798501898, 23948178468116)
(2, 2437250447493, -2431817869532)
>>> egcd(pow(2, 50), pow(3, 50))
(1, -260414429242905345185687, 408415383037561)
However, any number of integer arguments can be supplied. When no arguments are supplied, the result is ``(0,)`` (just as the expression ``math.gcd()`` evaluates to ``0`` in Python 3.9 and higher). In all other cases, the result contains the `greatest common divisor <https://en.wikipedia.org/wiki/Greatest_common_divisor>`__ of all the supplied integers and the coefficients of the generalized form of the associated `identity <https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity>`__:
.. code-block:: python
>>> egcd(2, 4, 3, 9)
(1, -1, 0, 1, 0)
>>> 1 == ((-1) * 2) + (0 * 4) + (1 * 3) + (0 * 9)
1
A succinct way to extract the greatest common divisor and the coefficients is to take advantage of Python's support for `iterable unpacking <https://peps.python.org/pep-3132/>`__ via the `asterisk <https://docs.python.org/3/reference/expressions.html#expression-lists>`__ notation:
.. code-block:: python
>>> bs = (26, 16, 34)
>>> (g, *cs) = egcd(*bs)
>>> (g, cs)
(2, [-3, 5, 0])
>>> g == sum(c * b for (c, b) in zip(cs, bs))
True
Development
-----------
All installation and development dependencies are fully specified in ``pyproject.toml``. The ``project.optional-dependencies`` object is used to `specify optional requirements <https://peps.python.org/pep-0621>`__ for various development tasks. This makes it possible to specify additional options (such as ``docs``, ``lint``, and so on) when performing installation using `pip <https://pypi.org/project/pip>`__:
.. code-block:: bash
python -m pip install ".[docs,lint]"
Documentation
^^^^^^^^^^^^^
The documentation can be generated automatically from the source files using `Sphinx <https://www.sphinx-doc.org>`__:
.. code-block:: bash
python -m pip install ".[docs]"
cd docs
sphinx-apidoc -f -E --templatedir=_templates -o _source .. && make html
Testing and Conventions
^^^^^^^^^^^^^^^^^^^^^^^
All unit tests are executed and their coverage is measured when using `pytest <https://docs.pytest.org>`__ (see the ``pyproject.toml`` file for configuration details):
.. code-block:: bash
python -m pip install ".[test]"
python -m pytest
Alternatively, all unit tests are included in the module itself and can be executed using `doctest <https://docs.python.org/3/library/doctest.html>`__:
.. code-block:: bash
python src/egcd/egcd.py -v
Style conventions are enforced using `Pylint <https://pylint.readthedocs.io>`__:
.. code-block:: bash
python -m pip install ".[lint]"
python -m pylint src/egcd
Contributions
^^^^^^^^^^^^^
In order to contribute to the source code, open an issue or submit a pull request on the `GitHub page <https://github.com/lapets/egcd>`__ for this library.
Versioning
^^^^^^^^^^
Beginning with version 0.1.0, the version number format for this library and the changes to the library associated with version number increments conform with `Semantic Versioning 2.0.0 <https://semver.org/#semantic-versioning-200>`__.
Publishing
^^^^^^^^^^
This library can be published as a `package on PyPI <https://pypi.org/project/egcd>`__ via the GitHub Actions workflow found in ``.github/workflows/build-publish-sign-release.yml`` that follows the `recommendations found in the Python Packaging User Guide <https://packaging.python.org/en/latest/guides/publishing-package-distribution-releases-using-github-actions-ci-cd-workflows/>`__.
Ensure that the correct version number appears in ``pyproject.toml``, and that any links in this README document to the Read the Docs documentation of this package (or its dependencies) have appropriate version numbers. Also ensure that the Read the Docs project for this library has an `automation rule <https://docs.readthedocs.io/en/stable/automation-rules.html>`__ that activates and sets as the default all tagged versions.
To publish the package, create and push a tag for the version being published (replacing ``?.?.?`` with the version number):
.. code-block:: bash
git tag ?.?.?
git push origin ?.?.?
Raw data
{
"_id": null,
"home_page": null,
"name": "egcd",
"maintainer": null,
"docs_url": null,
"requires_python": ">=3.7",
"maintainer_email": null,
"keywords": null,
"author": "Andrei Lapets",
"author_email": "a@lapets.io",
"download_url": "https://files.pythonhosted.org/packages/63/f5/c0c0808f8a3f8a4af605b48a241b16a634ceddd41b5e3ee05ae2fd9e1e42/egcd-2.0.2.tar.gz",
"platform": null,
"description": "====\negcd\n====\n\nPure-Python `extended Euclidean algorithm <https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm>`__ implementation that accepts any number of integer arguments.\n\n|pypi| |readthedocs| |actions| |coveralls|\n\n.. |pypi| image:: https://badge.fury.io/py/egcd.svg#\n :target: https://badge.fury.io/py/egcd\n :alt: PyPI version and link.\n\n.. |readthedocs| image:: https://readthedocs.org/projects/egcd/badge/?version=latest\n :target: https://egcd.readthedocs.io/en/latest/?badge=latest\n :alt: Read the Docs documentation status.\n\n.. |actions| image:: https://github.com/lapets/egcd/workflows/lint-test-cover-docs/badge.svg#\n :target: https://github.com/lapets/egcd/actions/workflows/lint-test-cover-docs.yml\n :alt: GitHub Actions status.\n\n.. |coveralls| image:: https://coveralls.io/repos/github/lapets/egcd/badge.svg?branch=main\n :target: https://coveralls.io/github/lapets/egcd?branch=main\n :alt: Coveralls test coverage summary.\n\nInstallation and Usage\n----------------------\nThis library is available as a `package on PyPI <https://pypi.org/project/egcd>`__:\n\n.. code-block:: bash\n\n python -m pip install egcd\n\nThe library can be imported in the usual way:\n\n.. code-block:: python\n\n from egcd import egcd\n\nExamples\n^^^^^^^^\n\n.. |egcd| replace:: ``egcd``\n.. _egcd: https://egcd.readthedocs.io/en/2.0.2/_source/egcd.html#egcd.egcd.egcd\n\n.. |math_gcd| replace:: ``math.gcd``\n.. _math_gcd: https://docs.python.org/3/library/math.html#math.gcd\n\nThe function |egcd|_ is a pure-Python implementation of the `extended Euclidean algorithm <https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm>`__ that can be viewed as an expansion of the functionality and interface of the built-in |math_gcd|_ function. When it is supplied two integer arguments ``a`` and ``b``, it returns a tuple of the form ``(g, s, t)`` where the three integers in the tuple satisfy the `identity <https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity>`__ ``(a * s) + (b * t) == g``:\n\n.. code-block:: python\n\n >>> egcd(1, 1)\n (1, 0, 1)\n >>> egcd(12, 8)\n (4, 1, -1)\n >>> egcd(23894798501898, 23948178468116)\n (2, 2437250447493, -2431817869532)\n >>> egcd(pow(2, 50), pow(3, 50))\n (1, -260414429242905345185687, 408415383037561)\n\nHowever, any number of integer arguments can be supplied. When no arguments are supplied, the result is ``(0,)`` (just as the expression ``math.gcd()`` evaluates to ``0`` in Python 3.9 and higher). In all other cases, the result contains the `greatest common divisor <https://en.wikipedia.org/wiki/Greatest_common_divisor>`__ of all the supplied integers and the coefficients of the generalized form of the associated `identity <https://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity>`__:\n\n.. code-block:: python\n\n >>> egcd(2, 4, 3, 9)\n (1, -1, 0, 1, 0)\n >>> 1 == ((-1) * 2) + (0 * 4) + (1 * 3) + (0 * 9)\n 1\n\nA succinct way to extract the greatest common divisor and the coefficients is to take advantage of Python's support for `iterable unpacking <https://peps.python.org/pep-3132/>`__ via the `asterisk <https://docs.python.org/3/reference/expressions.html#expression-lists>`__ notation:\n\n.. code-block:: python\n\n >>> bs = (26, 16, 34)\n >>> (g, *cs) = egcd(*bs)\n >>> (g, cs)\n (2, [-3, 5, 0])\n >>> g == sum(c * b for (c, b) in zip(cs, bs))\n True\n\nDevelopment\n-----------\nAll installation and development dependencies are fully specified in ``pyproject.toml``. The ``project.optional-dependencies`` object is used to `specify optional requirements <https://peps.python.org/pep-0621>`__ for various development tasks. This makes it possible to specify additional options (such as ``docs``, ``lint``, and so on) when performing installation using `pip <https://pypi.org/project/pip>`__:\n\n.. code-block:: bash\n\n python -m pip install \".[docs,lint]\"\n\nDocumentation\n^^^^^^^^^^^^^\nThe documentation can be generated automatically from the source files using `Sphinx <https://www.sphinx-doc.org>`__:\n\n.. code-block:: bash\n\n python -m pip install \".[docs]\"\n cd docs\n sphinx-apidoc -f -E --templatedir=_templates -o _source .. && make html\n\nTesting and Conventions\n^^^^^^^^^^^^^^^^^^^^^^^\nAll unit tests are executed and their coverage is measured when using `pytest <https://docs.pytest.org>`__ (see the ``pyproject.toml`` file for configuration details):\n\n.. code-block:: bash\n\n python -m pip install \".[test]\"\n python -m pytest\n\nAlternatively, all unit tests are included in the module itself and can be executed using `doctest <https://docs.python.org/3/library/doctest.html>`__:\n\n.. code-block:: bash\n\n python src/egcd/egcd.py -v\n\nStyle conventions are enforced using `Pylint <https://pylint.readthedocs.io>`__:\n\n.. code-block:: bash\n\n python -m pip install \".[lint]\"\n python -m pylint src/egcd\n\nContributions\n^^^^^^^^^^^^^\nIn order to contribute to the source code, open an issue or submit a pull request on the `GitHub page <https://github.com/lapets/egcd>`__ for this library.\n\nVersioning\n^^^^^^^^^^\nBeginning with version 0.1.0, the version number format for this library and the changes to the library associated with version number increments conform with `Semantic Versioning 2.0.0 <https://semver.org/#semantic-versioning-200>`__.\n\nPublishing\n^^^^^^^^^^\nThis library can be published as a `package on PyPI <https://pypi.org/project/egcd>`__ via the GitHub Actions workflow found in ``.github/workflows/build-publish-sign-release.yml`` that follows the `recommendations found in the Python Packaging User Guide <https://packaging.python.org/en/latest/guides/publishing-package-distribution-releases-using-github-actions-ci-cd-workflows/>`__.\n\nEnsure that the correct version number appears in ``pyproject.toml``, and that any links in this README document to the Read the Docs documentation of this package (or its dependencies) have appropriate version numbers. Also ensure that the Read the Docs project for this library has an `automation rule <https://docs.readthedocs.io/en/stable/automation-rules.html>`__ that activates and sets as the default all tagged versions.\n\nTo publish the package, create and push a tag for the version being published (replacing ``?.?.?`` with the version number):\n\n.. code-block:: bash\n\n git tag ?.?.?\n git push origin ?.?.?\n",
"bugtrack_url": null,
"license": "MIT",
"summary": "Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.",
"version": "2.0.2",
"project_urls": {
"Documentation": "https://egcd.readthedocs.io",
"Repository": "https://github.com/lapets/egcd"
},
"split_keywords": [],
"urls": [
{
"comment_text": "",
"digests": {
"blake2b_256": "a3e79d984faee490e50a495b50d0a87c42fe661252f9513157776d8cb2724445",
"md5": "3954fe8a0afcfb230a7ef40f0c5dbb64",
"sha256": "2f0576a651b4aa9e9c4640bba078f9741d1624f386b55cb5363a79ae4b564bd2"
},
"downloads": -1,
"filename": "egcd-2.0.2-py3-none-any.whl",
"has_sig": false,
"md5_digest": "3954fe8a0afcfb230a7ef40f0c5dbb64",
"packagetype": "bdist_wheel",
"python_version": "py3",
"requires_python": ">=3.7",
"size": 7187,
"upload_time": "2024-12-31T21:05:19",
"upload_time_iso_8601": "2024-12-31T21:05:19.098130Z",
"url": "https://files.pythonhosted.org/packages/a3/e7/9d984faee490e50a495b50d0a87c42fe661252f9513157776d8cb2724445/egcd-2.0.2-py3-none-any.whl",
"yanked": false,
"yanked_reason": null
},
{
"comment_text": "",
"digests": {
"blake2b_256": "63f5c0c0808f8a3f8a4af605b48a241b16a634ceddd41b5e3ee05ae2fd9e1e42",
"md5": "4776e3f141846c6932bb0f4bb7841e99",
"sha256": "3b05b0feb67549f8f76c97afed36c53252c0d7cb9a65bf4e6ca8b99110fb77f2"
},
"downloads": -1,
"filename": "egcd-2.0.2.tar.gz",
"has_sig": false,
"md5_digest": "4776e3f141846c6932bb0f4bb7841e99",
"packagetype": "sdist",
"python_version": "source",
"requires_python": ">=3.7",
"size": 6952,
"upload_time": "2024-12-31T21:05:21",
"upload_time_iso_8601": "2024-12-31T21:05:21.984189Z",
"url": "https://files.pythonhosted.org/packages/63/f5/c0c0808f8a3f8a4af605b48a241b16a634ceddd41b5e3ee05ae2fd9e1e42/egcd-2.0.2.tar.gz",
"yanked": false,
"yanked_reason": null
}
],
"upload_time": "2024-12-31 21:05:21",
"github": true,
"gitlab": false,
"bitbucket": false,
"codeberg": false,
"github_user": "lapets",
"github_project": "egcd",
"travis_ci": false,
"coveralls": false,
"github_actions": true,
"lcname": "egcd"
}
