Difference of Squares: Always More Than One Solution For Odd Composite #s?
$begingroup$
I've been looking at the pattern in the difference of squares recently. I've seen proofs that for a given prime, there is a unique pair of squares that differ by that prime.
What I'd like to know is: is there guaranteed to be more than one pair of squares with a difference of $m$ where $m$ is an odd, composite integer $> 0$?
The sequence of values $q^2 - p^2$ where $p = q - 1$ will produce a difference of squares of the form $( q - p )( q + p ) = ( 1 )( 2q - 1 ) = m$. There is always a solution for m using this approach, but it's not terribly interesting for factorization purposes. I'd like to find solutions where $p = q - k | k > 1$.
I can perform a search in $O(sqrt{m})$ to find one/all such solutions - but I'm not sure that there is always a solution for $m$ (other than $k = 1$). Are there any existing proofs on this matter?
factoring
$endgroup$
add a comment |
$begingroup$
I've been looking at the pattern in the difference of squares recently. I've seen proofs that for a given prime, there is a unique pair of squares that differ by that prime.
What I'd like to know is: is there guaranteed to be more than one pair of squares with a difference of $m$ where $m$ is an odd, composite integer $> 0$?
The sequence of values $q^2 - p^2$ where $p = q - 1$ will produce a difference of squares of the form $( q - p )( q + p ) = ( 1 )( 2q - 1 ) = m$. There is always a solution for m using this approach, but it's not terribly interesting for factorization purposes. I'd like to find solutions where $p = q - k | k > 1$.
I can perform a search in $O(sqrt{m})$ to find one/all such solutions - but I'm not sure that there is always a solution for $m$ (other than $k = 1$). Are there any existing proofs on this matter?
factoring
$endgroup$
add a comment |
$begingroup$
I've been looking at the pattern in the difference of squares recently. I've seen proofs that for a given prime, there is a unique pair of squares that differ by that prime.
What I'd like to know is: is there guaranteed to be more than one pair of squares with a difference of $m$ where $m$ is an odd, composite integer $> 0$?
The sequence of values $q^2 - p^2$ where $p = q - 1$ will produce a difference of squares of the form $( q - p )( q + p ) = ( 1 )( 2q - 1 ) = m$. There is always a solution for m using this approach, but it's not terribly interesting for factorization purposes. I'd like to find solutions where $p = q - k | k > 1$.
I can perform a search in $O(sqrt{m})$ to find one/all such solutions - but I'm not sure that there is always a solution for $m$ (other than $k = 1$). Are there any existing proofs on this matter?
factoring
$endgroup$
I've been looking at the pattern in the difference of squares recently. I've seen proofs that for a given prime, there is a unique pair of squares that differ by that prime.
What I'd like to know is: is there guaranteed to be more than one pair of squares with a difference of $m$ where $m$ is an odd, composite integer $> 0$?
The sequence of values $q^2 - p^2$ where $p = q - 1$ will produce a difference of squares of the form $( q - p )( q + p ) = ( 1 )( 2q - 1 ) = m$. There is always a solution for m using this approach, but it's not terribly interesting for factorization purposes. I'd like to find solutions where $p = q - k | k > 1$.
I can perform a search in $O(sqrt{m})$ to find one/all such solutions - but I'm not sure that there is always a solution for $m$ (other than $k = 1$). Are there any existing proofs on this matter?
factoring
factoring
edited Jul 22 '18 at 21:38
Ryan Pierce Williams
asked Jul 22 '18 at 21:24
Ryan Pierce WilliamsRyan Pierce Williams
1867
1867
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Write $m^2-n^2 = c$ as $(m+n)(m-n) = c$, for odd composite $c$. Since $c$ is composite, it can be written as a product of two natural numbers in at least two different ways: $c times 1$ and $r times s$, for odd $r > s$ (without loss of generality). So we can have
$$
m = frac{c+1}{2}, quad n = frac{c-1}{2}
$$
for the former case, and
$$
m = frac{r+s}{2}, quad n = frac{r-s}{2}
$$
for the latter case.
$endgroup$
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
|
show 4 more comments
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%2f2859795%2fdifference-of-squares-always-more-than-one-solution-for-odd-composite-s%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Write $m^2-n^2 = c$ as $(m+n)(m-n) = c$, for odd composite $c$. Since $c$ is composite, it can be written as a product of two natural numbers in at least two different ways: $c times 1$ and $r times s$, for odd $r > s$ (without loss of generality). So we can have
$$
m = frac{c+1}{2}, quad n = frac{c-1}{2}
$$
for the former case, and
$$
m = frac{r+s}{2}, quad n = frac{r-s}{2}
$$
for the latter case.
$endgroup$
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
|
show 4 more comments
$begingroup$
Write $m^2-n^2 = c$ as $(m+n)(m-n) = c$, for odd composite $c$. Since $c$ is composite, it can be written as a product of two natural numbers in at least two different ways: $c times 1$ and $r times s$, for odd $r > s$ (without loss of generality). So we can have
$$
m = frac{c+1}{2}, quad n = frac{c-1}{2}
$$
for the former case, and
$$
m = frac{r+s}{2}, quad n = frac{r-s}{2}
$$
for the latter case.
$endgroup$
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
|
show 4 more comments
$begingroup$
Write $m^2-n^2 = c$ as $(m+n)(m-n) = c$, for odd composite $c$. Since $c$ is composite, it can be written as a product of two natural numbers in at least two different ways: $c times 1$ and $r times s$, for odd $r > s$ (without loss of generality). So we can have
$$
m = frac{c+1}{2}, quad n = frac{c-1}{2}
$$
for the former case, and
$$
m = frac{r+s}{2}, quad n = frac{r-s}{2}
$$
for the latter case.
$endgroup$
Write $m^2-n^2 = c$ as $(m+n)(m-n) = c$, for odd composite $c$. Since $c$ is composite, it can be written as a product of two natural numbers in at least two different ways: $c times 1$ and $r times s$, for odd $r > s$ (without loss of generality). So we can have
$$
m = frac{c+1}{2}, quad n = frac{c-1}{2}
$$
for the former case, and
$$
m = frac{r+s}{2}, quad n = frac{r-s}{2}
$$
for the latter case.
answered Jul 22 '18 at 21:29
Brian TungBrian Tung
25.9k32555
25.9k32555
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
|
show 4 more comments
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
Awesome, thank you very much :) I'll accept as answer once it lets me do that
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:32
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
@RyanPierceWilliams: Strange. It should always allow you to accept an answer; what it might not let you do is upvote it. :-/
$endgroup$
– Brian Tung
Jul 22 '18 at 21:33
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
Says I gotta wait 8 minutes >.>
$endgroup$
– Ryan Pierce Williams
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
$begingroup$
@RyanPierceWilliams: Ahh, I see. Well, I'm in no rush. :-)
$endgroup$
– Brian Tung
Jul 22 '18 at 21:34
2
2
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
$begingroup$
Yeah, was looking for that, and found it, eventually, but it would have been easier to find if you had stuck with OPs original letters.
$endgroup$
– Thomas Andrews
Jul 22 '18 at 21:35
|
show 4 more comments
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%2f2859795%2fdifference-of-squares-always-more-than-one-solution-for-odd-composite-s%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