SidneyZhang/SolutionEuler
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Symbol(clack:cancel)

Browse Source
This commit is contained in:
Sidney Zhang
2025-12-26 17:35:14 +08:00
parent 266544ac47
commit 25469e1022
54 changed files with 0 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
solutions/0000_0029/0026.ReciprocalCycles/readme.md Normal file
View File

@@ -0,0 +1,6 @@
# 最大循环节
基本的数学原理是：[欧拉定理/费马欧拉定理](https://en.wikipedia.org/wiki/Euler%27s_theorem)，以及对应的[费马小定理](https://en.wikipedia.org/wiki/Fermat%27s_little_theorem)。
需要注意的是，基于费马小定理，我们只能知道质数作为$1/d$的$d$时，最大可能的循环节的长度是$d-1$。
事实上还是需要确定$d-1$的各个因数是否有最小的一个满足欧拉定理。