Can I efficiently enumerate all numbers in a range that have a prime factor in another given range?
$begingroup$
Suppose $a<b$ are positive integers. The object is to determine all the numbers $xin [a,b]$ having a prime factor in the range $[c,d]$ efficiently (that is without factoring all the numbers in the range or other brute-force approaches).
Example : Which numbers in the range $[40!-10^9,40!+10^9]$ have a prime factor in the range $8cdot 10^{15},10^{16}$ ?
number-theory elementary-number-theory prime-factorization
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
$endgroup$
add a comment |
$begingroup$
Suppose $a<b$ are positive integers. The object is to determine all the numbers $xin [a,b]$ having a prime factor in the range $[c,d]$ efficiently (that is without factoring all the numbers in the range or other brute-force approaches).
Example : Which numbers in the range $[40!-10^9,40!+10^9]$ have a prime factor in the range $8cdot 10^{15},10^{16}$ ?
number-theory elementary-number-theory prime-factorization
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
$endgroup$
1
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14
add a comment |
$begingroup$
Suppose $a<b$ are positive integers. The object is to determine all the numbers $xin [a,b]$ having a prime factor in the range $[c,d]$ efficiently (that is without factoring all the numbers in the range or other brute-force approaches).
Example : Which numbers in the range $[40!-10^9,40!+10^9]$ have a prime factor in the range $8cdot 10^{15},10^{16}$ ?
number-theory elementary-number-theory prime-factorization
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
$endgroup$
Suppose $a<b$ are positive integers. The object is to determine all the numbers $xin [a,b]$ having a prime factor in the range $[c,d]$ efficiently (that is without factoring all the numbers in the range or other brute-force approaches).
Example : Which numbers in the range $[40!-10^9,40!+10^9]$ have a prime factor in the range $8cdot 10^{15},10^{16}$ ?
number-theory elementary-number-theory prime-factorization
number-theory elementary-number-theory prime-factorization
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
asked Dec 3 '18 at 18:49
PeterPeter
46.9k1039125
46.9k1039125
1
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14
add a comment |
1
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14
1
1
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14
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%2f3024503%2fcan-i-efficiently-enumerate-all-numbers-in-a-range-that-have-a-prime-factor-in-a%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%2f3024503%2fcan-i-efficiently-enumerate-all-numbers-in-a-range-that-have-a-prime-factor-in-a%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
1
$begingroup$
Just wondering: why would you need this?
$endgroup$
– YiFan
Dec 4 '18 at 5:13
$begingroup$
Some sort of sieving algorithm comes to mind. But I haven't heard of one that suits this specific scenario.
$endgroup$
– Klangen
Dec 18 '18 at 13:14