Leeyuxun / Large-Number-GCD Public

Notifications You must be signed in to change notification settings
Fork 0
Star 2

Using Extended Euclidean Algorithm to Realize Large Number Operation.

2 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
img		img
README.md		README.md
gcd.py		gcd.py

Repository files navigation

Large-Number-GCD

说明

使用Python利用扩展欧几里得算法求大数(超过长整型的数)是否互素，若不互素，则求出 $u、v$ 使 $mu+nv=gcd(m,n)$，其中 $m、n$ 为大数，且 $m>n$ .

运行结果

About

Using Extended Euclidean Algorithm to Realize Large Number Operation.

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%