If $q equiv k equiv 1 pmod 4$, is it necessarily true that $gcdbigg(sigma(q^k),sigma(q^{(k-1)/2})bigg)=1$?
$begingroup$
Let $sigma$ denote the classical sum-of-divisors function. In what follows, we let $q$ be a prime number.
Here is my question:
If $q equiv k equiv 1 pmod 4$, is it necessarily true that $gcdbigg(sigma(q^k),sigma(q^{(k-1)/2})bigg)=1$?
MY ATTEMPT
I pattern my approach after the answer to this closely related MSE question.
$$sigma(q^{frac{k-1}{2}})=frac{q^{frac{k+1}{2}} - 1}{q - 1}$$
$$sigma(q^k)=frac{q^{k+1} - 1}{q - 1}$$
Therefore,
$$gcdbigg(sigma(q^{frac{k-1}{2}}),sigma(q^k)bigg)=bigg(frac{1}{q-1}bigg)gcdbigg(q^{frac{k+1}{2}} - 1, q^{k+1} - 1bigg)=frac{q^{gcdbigg(frac{k+1}{2}, hspace{0.05in} k+1bigg)} - 1}{q - 1}$$
$$=frac{q^{frac{k+1}{2}} - 1}{q - 1} = sigma(q^{frac{k-1}{2}}).$$
But $sigma(q^{(k-1)/2}) = 1$ is true if and only if
$$q^{(k-1)/2} = 1 iff (k-1)/2 = 0 iff k = 1.$$
Is this proof correct?
elementary-number-theory proof-verification greatest-common-divisor divisor-sum arithmetic-functions
$endgroup$
add a comment |
$begingroup$
Let $sigma$ denote the classical sum-of-divisors function. In what follows, we let $q$ be a prime number.
Here is my question:
If $q equiv k equiv 1 pmod 4$, is it necessarily true that $gcdbigg(sigma(q^k),sigma(q^{(k-1)/2})bigg)=1$?
MY ATTEMPT
I pattern my approach after the answer to this closely related MSE question.
$$sigma(q^{frac{k-1}{2}})=frac{q^{frac{k+1}{2}} - 1}{q - 1}$$
$$sigma(q^k)=frac{q^{k+1} - 1}{q - 1}$$
Therefore,
$$gcdbigg(sigma(q^{frac{k-1}{2}}),sigma(q^k)bigg)=bigg(frac{1}{q-1}bigg)gcdbigg(q^{frac{k+1}{2}} - 1, q^{k+1} - 1bigg)=frac{q^{gcdbigg(frac{k+1}{2}, hspace{0.05in} k+1bigg)} - 1}{q - 1}$$
$$=frac{q^{frac{k+1}{2}} - 1}{q - 1} = sigma(q^{frac{k-1}{2}}).$$
But $sigma(q^{(k-1)/2}) = 1$ is true if and only if
$$q^{(k-1)/2} = 1 iff (k-1)/2 = 0 iff k = 1.$$
Is this proof correct?
elementary-number-theory proof-verification greatest-common-divisor divisor-sum arithmetic-functions
$endgroup$
1
$begingroup$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
1
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04
add a comment |
$begingroup$
Let $sigma$ denote the classical sum-of-divisors function. In what follows, we let $q$ be a prime number.
Here is my question:
If $q equiv k equiv 1 pmod 4$, is it necessarily true that $gcdbigg(sigma(q^k),sigma(q^{(k-1)/2})bigg)=1$?
MY ATTEMPT
I pattern my approach after the answer to this closely related MSE question.
$$sigma(q^{frac{k-1}{2}})=frac{q^{frac{k+1}{2}} - 1}{q - 1}$$
$$sigma(q^k)=frac{q^{k+1} - 1}{q - 1}$$
Therefore,
$$gcdbigg(sigma(q^{frac{k-1}{2}}),sigma(q^k)bigg)=bigg(frac{1}{q-1}bigg)gcdbigg(q^{frac{k+1}{2}} - 1, q^{k+1} - 1bigg)=frac{q^{gcdbigg(frac{k+1}{2}, hspace{0.05in} k+1bigg)} - 1}{q - 1}$$
$$=frac{q^{frac{k+1}{2}} - 1}{q - 1} = sigma(q^{frac{k-1}{2}}).$$
But $sigma(q^{(k-1)/2}) = 1$ is true if and only if
$$q^{(k-1)/2} = 1 iff (k-1)/2 = 0 iff k = 1.$$
Is this proof correct?
elementary-number-theory proof-verification greatest-common-divisor divisor-sum arithmetic-functions
$endgroup$
Let $sigma$ denote the classical sum-of-divisors function. In what follows, we let $q$ be a prime number.
Here is my question:
If $q equiv k equiv 1 pmod 4$, is it necessarily true that $gcdbigg(sigma(q^k),sigma(q^{(k-1)/2})bigg)=1$?
MY ATTEMPT
I pattern my approach after the answer to this closely related MSE question.
$$sigma(q^{frac{k-1}{2}})=frac{q^{frac{k+1}{2}} - 1}{q - 1}$$
$$sigma(q^k)=frac{q^{k+1} - 1}{q - 1}$$
Therefore,
$$gcdbigg(sigma(q^{frac{k-1}{2}}),sigma(q^k)bigg)=bigg(frac{1}{q-1}bigg)gcdbigg(q^{frac{k+1}{2}} - 1, q^{k+1} - 1bigg)=frac{q^{gcdbigg(frac{k+1}{2}, hspace{0.05in} k+1bigg)} - 1}{q - 1}$$
$$=frac{q^{frac{k+1}{2}} - 1}{q - 1} = sigma(q^{frac{k-1}{2}}).$$
But $sigma(q^{(k-1)/2}) = 1$ is true if and only if
$$q^{(k-1)/2} = 1 iff (k-1)/2 = 0 iff k = 1.$$
Is this proof correct?
elementary-number-theory proof-verification greatest-common-divisor divisor-sum arithmetic-functions
elementary-number-theory proof-verification greatest-common-divisor divisor-sum arithmetic-functions
edited Jan 7 at 7:31
Jose Arnaldo Bebita Dris
asked Jan 6 at 1:59
Jose Arnaldo Bebita DrisJose Arnaldo Bebita Dris
5,38141944
5,38141944
1
$begingroup$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
1
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04
add a comment |
1
$begingroup$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
1
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04
1
1
$begingroup$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
1
1
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The work shown here follows the same pattern as that of the closely related MSE question that was referenced. Based on that, plus my own checking (but keep in mind though that I'm not a number theory expert), what you've shown in proof attempt all looks fine to me.
One small thing to note is that since $q^{k + 1} - 1 = left(q^{frac{k + 1}{2}} - 1right)left(q^{frac{k + 1}{2}} + 1right)$, this is another way to see that $gcdleft(q^{k + 1} - 1, q^{frac{k + 1}{2}} - 1right) = q^{frac{k + 1}{2}} - 1$.
$endgroup$
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
add a comment |
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%2f3063396%2fif-q-equiv-k-equiv-1-pmod-4-is-it-necessarily-true-that-gcd-bigg-sigma%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$
The work shown here follows the same pattern as that of the closely related MSE question that was referenced. Based on that, plus my own checking (but keep in mind though that I'm not a number theory expert), what you've shown in proof attempt all looks fine to me.
One small thing to note is that since $q^{k + 1} - 1 = left(q^{frac{k + 1}{2}} - 1right)left(q^{frac{k + 1}{2}} + 1right)$, this is another way to see that $gcdleft(q^{k + 1} - 1, q^{frac{k + 1}{2}} - 1right) = q^{frac{k + 1}{2}} - 1$.
$endgroup$
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
add a comment |
$begingroup$
The work shown here follows the same pattern as that of the closely related MSE question that was referenced. Based on that, plus my own checking (but keep in mind though that I'm not a number theory expert), what you've shown in proof attempt all looks fine to me.
One small thing to note is that since $q^{k + 1} - 1 = left(q^{frac{k + 1}{2}} - 1right)left(q^{frac{k + 1}{2}} + 1right)$, this is another way to see that $gcdleft(q^{k + 1} - 1, q^{frac{k + 1}{2}} - 1right) = q^{frac{k + 1}{2}} - 1$.
$endgroup$
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
add a comment |
$begingroup$
The work shown here follows the same pattern as that of the closely related MSE question that was referenced. Based on that, plus my own checking (but keep in mind though that I'm not a number theory expert), what you've shown in proof attempt all looks fine to me.
One small thing to note is that since $q^{k + 1} - 1 = left(q^{frac{k + 1}{2}} - 1right)left(q^{frac{k + 1}{2}} + 1right)$, this is another way to see that $gcdleft(q^{k + 1} - 1, q^{frac{k + 1}{2}} - 1right) = q^{frac{k + 1}{2}} - 1$.
$endgroup$
The work shown here follows the same pattern as that of the closely related MSE question that was referenced. Based on that, plus my own checking (but keep in mind though that I'm not a number theory expert), what you've shown in proof attempt all looks fine to me.
One small thing to note is that since $q^{k + 1} - 1 = left(q^{frac{k + 1}{2}} - 1right)left(q^{frac{k + 1}{2}} + 1right)$, this is another way to see that $gcdleft(q^{k + 1} - 1, q^{frac{k + 1}{2}} - 1right) = q^{frac{k + 1}{2}} - 1$.
edited Jan 7 at 11:01
answered Jan 7 at 10:53
John OmielanJohn Omielan
1,73629
1,73629
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
add a comment |
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
$begingroup$
Thank you for your answer, @JohnOmielan! Gladly accepting it now.
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 11:07
add a comment |
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%2f3063396%2fif-q-equiv-k-equiv-1-pmod-4-is-it-necessarily-true-that-gcd-bigg-sigma%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$
For what it's worth, keeping in mind I'm not a number theory expert, what you show in your proof attempt all looks fine to me.
$endgroup$
– John Omielan
Jan 7 at 5:53
$begingroup$
@JohnOmielan, thank you for your feedback! Could you write down your last comment as an actual answer, so that I would be able to accept it?
$endgroup$
– Jose Arnaldo Bebita Dris
Jan 7 at 10:18
1
$begingroup$
You are welcome. As you requested, I have added an answer below.
$endgroup$
– John Omielan
Jan 7 at 11:04