Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
#

greatest-common-divisor

Here are 36 public repositories matching this topic...

symbolica

Pure-Python extended Euclidean algorithm implementation that accepts any number of integer arguments.

  • UpdatedSep 29, 2025
  • Python

Greatest Common Divisor Finder With Java

  • UpdatedJan 11, 2020
  • Java

🔢 Get the greatest common devisor of two numbers

  • UpdatedMar 4, 2023
  • JavaScript

A library for computing modular GCD of univariate polynomials.

  • UpdatedApr 25, 2018
  • C

🔢💻 Get the greatest common devisor CLI

  • UpdatedMar 4, 2023
  • JavaScript
gcd-lcm-calculator

Calculates the GCD and LCM for given set of numbers.

  • UpdatedApr 3, 2021
  • Java

Gaussian Integers and Gaussian Rationals, implemented using Python integers, since there is no limit on their size, unlike the mantissa of Python floats.

  • UpdatedOct 7, 2025
  • Jupyter Notebook

Proyecto corto realizado para la clase de Matemática Discrete, contiene funciones para obtener el mcd de 2 números dados con el algoritmo de eculides, determinar si un número es primo o compuesto y determinar los factores de un número

  • UpdatedAug 18, 2021
  • Python

Improve this page

Add a description, image, and links to thegreatest-common-divisor topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with thegreatest-common-divisor topic, visit your repo's landing page and select "manage topics."

Learn more


[8]ページ先頭

©2009-2025 Movatter.jp