From 3ff75b9a3e85a4d7723b0de1f69345f3943070dd Mon Sep 17 00:00:00 2001
From: mbkma <Johannes.Unruh@mailbox.tu-dresden.de>
Date: Mon, 5 Oct 2020 10:30:58 +0200
Subject: Improve factorization speed

- implements Miller-Rabin primality test
- implements Pollard's rho algorithm to find prime factors
- adds mp_new_from_integer function for convenience
---
 help/C/factorize.page | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

(limited to 'help/C/factorize.page')

diff --git a/help/C/factorize.page b/help/C/factorize.page
index 4094d60..9edfd59 100644
--- a/help/C/factorize.page
+++ b/help/C/factorize.page
@@ -7,9 +7,12 @@
     </info>
 
 	<title>Factorization</title>
-    
+
     <p>
-    You can factorize the number currently displayed by pressing the <gui>fact</gui> button.
+    You can factorize the number currently displayed by pressing <keyseq><key>Ctrl</key><key>F</key></keyseq> or by pressing the <gui>fact</gui> button.
     This button is visible in <link xref="mouse">programming mode</link>.
     </p>
+    <p>
+    To factorize integers bigger than 2^64 the Miller-Rabin primality test and Pollard's rho algorithm are used.
+    </p>
 </page>
-- 
cgit v1.2.1