summaryrefslogtreecommitdiff
path: root/content/math/rho.cpp
diff options
context:
space:
mode:
authorGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
committerGloria Mundi <gloria@gloria-mundi.eu>2024-11-16 01:24:14 +0100
commit98567ec798aa8ca2cfbcb85c774dd470f30e30d4 (patch)
tree5113d5cc24d1ad5f93810b6442ce584a36950dc8 /content/math/rho.cpp
parentad3856a6b766087df0036de0b556f4700a6498c9 (diff)
parent8d11c6c8213f46f0fa19826917c255edd5d43cb1 (diff)
mzuenni tests
Diffstat (limited to 'content/math/rho.cpp')
-rw-r--r--content/math/rho.cpp19
1 files changed, 19 insertions, 0 deletions
diff --git a/content/math/rho.cpp b/content/math/rho.cpp
new file mode 100644
index 0000000..ad640cd
--- /dev/null
+++ b/content/math/rho.cpp
@@ -0,0 +1,19 @@
+using lll = __int128;
+ll rho(ll n) { // Findet Faktor < n, nicht unbedingt prim.
+ if (n % 2 == 0) return 2;
+ ll x = 0, y = 0, prd = 2, i = n/2 + 7;
+ auto f = [&](lll c){return (c * c + i) % n;};
+ for (ll t = 30; t % 40 || gcd(prd, n) == 1; t++) {
+ if (x == y) x = ++i, y = f(x);
+ if (ll q = (lll)prd * abs(x-y) % n; q) prd = q;
+ x = f(x); y = f(f(y));
+ }
+ return gcd(prd, n);
+}
+
+void factor(ll n, map<ll, int>& facts) {
+ if (n == 1) return;
+ if (isPrime(n)) {facts[n]++; return;}
+ ll f = rho(n);
+ factor(n / f, facts); factor(f, facts);
+}