summaryrefslogtreecommitdiff
path: root/help
diff options
context:
space:
mode:
authormbkma <[email protected]>2020-10-05 10:30:58 +0200
committerRobert Antoni Buj Gelonch <[email protected]>2020-11-09 21:49:49 +0100
commit3ff75b9a3e85a4d7723b0de1f69345f3943070dd (patch)
treeef9c55e5efe6eaaf80c4398de457737e62c961aa /help
parent81aa78009bcb2bc07abfb6cd3953e24ae3979dd8 (diff)
downloadmate-calc-3ff75b9a3e85a4d7723b0de1f69345f3943070dd.tar.bz2
mate-calc-3ff75b9a3e85a4d7723b0de1f69345f3943070dd.tar.xz
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
Diffstat (limited to 'help')
-rw-r--r--help/C/factorize.page7
1 files changed, 5 insertions, 2 deletions
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>