Is it possible to find a proper divisor of a composite Fermat Number without using any arithmetic operation...
$begingroup$
I have an absurdly simple algorithm which for N = 2^{2^{k-1}} +1 a composite Fermat Number,
computes a divisor 1
The algorithm is also a test for primality, i.e. N is prime if and only if my algorithm
has output e=N.
Features:
The algorithm is a k-step recursion. Hence it contains no steps which involve "Trial & Error".
The algorithm involves simple manipulations of bit strings. It uses non of the
arithmetic operations +,-,*,/.
My goal is to prove that no such algorithm as I have just described is possible. This would be the contradiction in a theorem I proving.
number-theory
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
$endgroup$
add a comment |
$begingroup$
I have an absurdly simple algorithm which for N = 2^{2^{k-1}} +1 a composite Fermat Number,
computes a divisor 1
The algorithm is also a test for primality, i.e. N is prime if and only if my algorithm
has output e=N.
Features:
The algorithm is a k-step recursion. Hence it contains no steps which involve "Trial & Error".
The algorithm involves simple manipulations of bit strings. It uses non of the
arithmetic operations +,-,*,/.
My goal is to prove that no such algorithm as I have just described is possible. This would be the contradiction in a theorem I proving.
number-theory
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
$endgroup$
2
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28
add a comment |
$begingroup$
I have an absurdly simple algorithm which for N = 2^{2^{k-1}} +1 a composite Fermat Number,
computes a divisor 1
The algorithm is also a test for primality, i.e. N is prime if and only if my algorithm
has output e=N.
Features:
The algorithm is a k-step recursion. Hence it contains no steps which involve "Trial & Error".
The algorithm involves simple manipulations of bit strings. It uses non of the
arithmetic operations +,-,*,/.
My goal is to prove that no such algorithm as I have just described is possible. This would be the contradiction in a theorem I proving.
number-theory
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
$endgroup$
I have an absurdly simple algorithm which for N = 2^{2^{k-1}} +1 a composite Fermat Number,
computes a divisor 1
The algorithm is also a test for primality, i.e. N is prime if and only if my algorithm
has output e=N.
Features:
The algorithm is a k-step recursion. Hence it contains no steps which involve "Trial & Error".
The algorithm involves simple manipulations of bit strings. It uses non of the
arithmetic operations +,-,*,/.
My goal is to prove that no such algorithm as I have just described is possible. This would be the contradiction in a theorem I proving.
number-theory
number-theory
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
asked Nov 24 '18 at 16:58
Arthur LubocceArthur Lubocce
1
1
2
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28
add a comment |
2
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28
2
2
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28
add a comment |
0
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',
autoActivateHeartbeat: false,
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%2f3011797%2fis-it-possible-to-find-a-proper-divisor-of-a-composite-fermat-number-without-usi%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
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.
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%2f3011797%2fis-it-possible-to-find-a-proper-divisor-of-a-composite-fermat-number-without-usi%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
2
$begingroup$
All of those arithmetic operations can be implemented as simple manipulations of bit strings.
$endgroup$
– user3482749
Nov 24 '18 at 17:36
$begingroup$
Proving in general that an algorithm doesn't exist is extremely difficult. For example, the following question is open: Is there are a linear time algorithm for multiplying two positive integers?
$endgroup$
– JoshuaZ
Nov 24 '18 at 17:57
$begingroup$
Sure, arithmetic operations can be implemented as simple manipulations on bit strings. But with my algorithm the point is that none of what I do amounts to performing any arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:25
$begingroup$
What I am attempting to show is the opposite of finding some optimal algorithm. I seek to prove that all algorithms to find divisors of Fermat Numbers or to prove they are composite requires some minimal operations, namely arithmetic operations.
$endgroup$
– Arthur Lubocce
Nov 26 '18 at 5:28