Which algorithm is used to multiply two arbitrarily large unsigned integers in PARI/GP?
up vote
0
down vote
favorite
What is the underlying algorithm that PARI/GP uses to multiply two arbitrary unsigned integers (with arbitrary precision), assuming that all these integers are stored as sequences of N-bit words? I have downloaded the source code, but could not find the answer.
algorithms computer-algebra-systems
asked Nov 27 at 6:19
lyrically wicked
16518
add a comment |
up vote
0
down vote
favorite
What is the underlying algorithm that PARI/GP uses to multiply two arbitrary unsigned integers (with arbitrary precision), assuming that all these integers are stored as sequences of N-bit words? I have downloaded the source code, but could not find the answer.
algorithms computer-algebra-systems
asked Nov 27 at 6:19
lyrically wicked
16518
The function isaddii, which callsaddii_signinkernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.
– Patrick Stevens
Nov 27 at 7:12
@PatrickStevens: inkernel/none/add.c, I seeGEN addii_sign, but I don't see a function that contains the algorithm for multiplication.
– lyrically wicked
Nov 27 at 7:29
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
What is the underlying algorithm that PARI/GP uses to multiply two arbitrary unsigned integers (with arbitrary precision), assuming that all these integers are stored as sequences of N-bit words? I have downloaded the source code, but could not find the answer.
algorithms computer-algebra-systems
asked Nov 27 at 6:19
lyrically wicked
16518
What is the underlying algorithm that PARI/GP uses to multiply two arbitrary unsigned integers (with arbitrary precision), assuming that all these integers are stored as sequences of N-bit words? I have downloaded the source code, but could not find the answer.
algorithms computer-algebra-systems
algorithms computer-algebra-systems
asked Nov 27 at 6:19
lyrically wicked
16518
asked Nov 27 at 6:19
lyrically wicked
16518
edited Nov 27 at 7:34
asked Nov 27 at 6:19
lyrically wicked
16518
asked Nov 27 at 6:19
lyrically wicked
16518
asked Nov 27 at 6:19
lyrically wicked
16518
16518
The function isaddii, which callsaddii_signinkernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.
– Patrick Stevens
Nov 27 at 7:12
@PatrickStevens: inkernel/none/add.c, I seeGEN addii_sign, but I don't see a function that contains the algorithm for multiplication.
– lyrically wicked
Nov 27 at 7:29
add a comment |
The function isaddii, which callsaddii_signinkernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.
– Patrick Stevens
Nov 27 at 7:12
@PatrickStevens: inkernel/none/add.c, I seeGEN addii_sign, but I don't see a function that contains the algorithm for multiplication.
– lyrically wicked
Nov 27 at 7:29
The function is
addii, which calls addii_sign in kernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.– Patrick Stevens
Nov 27 at 7:12
The function is
addii, which calls addii_sign in kernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.– Patrick Stevens
Nov 27 at 7:12
@PatrickStevens: in
kernel/none/add.c, I see GEN addii_sign, but I don't see a function that contains the algorithm for multiplication.– lyrically wicked
Nov 27 at 7:29
@PatrickStevens: in
kernel/none/add.c, I see GEN addii_sign, but I don't see a function that contains the algorithm for multiplication.– lyrically wicked
Nov 27 at 7:29
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015407%2fwhich-algorithm-is-used-to-multiply-two-arbitrarily-large-unsigned-integers-in-p%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015407%2fwhich-algorithm-is-used-to-multiply-two-arbitrarily-large-unsigned-integers-in-p%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
The function is
addii, which callsaddii_signinkernel/none/add.c. In the finest traditions of academic software, the code contains virtually no documentation.– Patrick Stevens
Nov 27 at 7:12
@PatrickStevens: in
kernel/none/add.c, I seeGEN addii_sign, but I don't see a function that contains the algorithm for multiplication.– lyrically wicked
Nov 27 at 7:29