We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://oi-wiki.org/math/number-theory/gcd/
LCM和GCD应该并列吧?我在索引找了半天找不到LCM,要不然把LCM拎出去放在索引里面,要不然将索引标题改成最大公约数&最小公倍数,然后详细页面内把“定义”这个一级标题改成“最小公倍数”
The text was updated successfully, but these errors were encountered:
感谢你对 OI Wiki 的关注!记得在 Issue 中表达清楚自己的意思哦~
Sorry, something went wrong.
我自己的看法:
一个是 lcm 与 gcd 本来就是相通的,因此 lcm 实在是没有重要到需要单独拎出来单独成一个页面;然后就是也不至于把标题改成 “最大公约数 & 最小公倍数”,一是因为 lcm 远不及 gcd 应用的多,二是因为这篇 wiki 大部分内容都是在讲 gcd 和 exgcd 的,而 lcm 又从 gcd 来;最后就是在 OI Wiki 的搜索框搜索 “最小公倍数” 或 “LCM” 是可以找到 “最大公约数” 这个页面的。
综上我认为既不需要单独拎出来,也不需要修改标题。
感觉 @untitledunrevised 说的挺有道理~先close啦
No branches or pull requests
请选择:
我正在访问这个页面
https://oi-wiki.org/math/number-theory/gcd/
我发现页面有这样的问题
LCM和GCD应该并列吧?我在索引找了半天找不到LCM,要不然把LCM拎出去放在索引里面,要不然将索引标题改成最大公约数&最小公倍数,然后详细页面内把“定义”这个一级标题改成“最小公倍数”
The text was updated successfully, but these errors were encountered: