首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determ

In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determ

  • 资源大小:9 K
  • 上传时间:2023-05-03
  • 下载次数:0次
  • 浏览次数:1次
  • 资源积分:1积分
  • 标      签: algorithm Euclidean Euclid number

资 源 简 介

In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does not require factoring the two integers, and it is also significant in that it is one of the oldest algorithms known, dating back to the ancient Greeks.

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP