Are there any other squares $n^2$ for which $gcd(n^2, sigma(n^2)) = 2n^2 - sigma(n^2)$?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
3
down vote

favorite
1












Let $sigma(x)$ denote the sum of the divisors of the positive integer $x$.



Denote the deficiency of $x$ by
$$D(x)=2x-sigma(x).$$



I am interested in solutions to the equation
$$gcd(n^2, sigma(n^2)) = 2n^2 - sigma(n^2).$$



Case 1: $n$ is even.



In this case, it is known that $n=2^r$ are solutions for $r geq 1$.



Indeed, we have
$$gcd(2^2r, sigma(2^2r)) = 1 = 2(2^2r) - sigma(2^2r)$$
where the second equation follows from the fact that powers of two are almost perfect.



Case 2: $n$ is odd.



Added September 5, 2018 Note that $n^2 = 1$ is a trivial (odd) solution, as $1$ satisfies
$$gcd(1, sigma(1)) = 1 = 2(1) - sigma(1).$$



In this case, the only known solution (with $n>1$) is
$$n^2 = bigg(3cdot7cdot11cdot13bigg)^2 = 9018009.$$



Indeed, we obtain
$$gcd(9018009,sigma(9018009)) = 819 = 2(9018009) - sigma(9018009).$$



Here is my question:




Are there any other solutions?




My Attempt



Looking at the OEIS page for deficient-perfect numbers, it appears that no other solutions are known. Otherwise, if there existed another odd solution, then we will be able to produce an odd perfect or a spoof odd perfect number whose special prime/quasi-Euler prime has exponent $1$.



Can anybody confirm if my impressions are correct?



Reference



Conditions equivalent to the Descartes–Frenicle–Sorli Conjecture on odd perfect numbers, Notes on Number Theory and Discrete Mathematics, Volume 23, 2017, Number 2, Pages 12—20










share|cite|improve this question



















  • 2




    No futher solutions upto $n=10^7$
    – Peter
    Sep 4 at 15:07














up vote
3
down vote

favorite
1












Let $sigma(x)$ denote the sum of the divisors of the positive integer $x$.



Denote the deficiency of $x$ by
$$D(x)=2x-sigma(x).$$



I am interested in solutions to the equation
$$gcd(n^2, sigma(n^2)) = 2n^2 - sigma(n^2).$$



Case 1: $n$ is even.



In this case, it is known that $n=2^r$ are solutions for $r geq 1$.



Indeed, we have
$$gcd(2^2r, sigma(2^2r)) = 1 = 2(2^2r) - sigma(2^2r)$$
where the second equation follows from the fact that powers of two are almost perfect.



Case 2: $n$ is odd.



Added September 5, 2018 Note that $n^2 = 1$ is a trivial (odd) solution, as $1$ satisfies
$$gcd(1, sigma(1)) = 1 = 2(1) - sigma(1).$$



In this case, the only known solution (with $n>1$) is
$$n^2 = bigg(3cdot7cdot11cdot13bigg)^2 = 9018009.$$



Indeed, we obtain
$$gcd(9018009,sigma(9018009)) = 819 = 2(9018009) - sigma(9018009).$$



Here is my question:




Are there any other solutions?




My Attempt



Looking at the OEIS page for deficient-perfect numbers, it appears that no other solutions are known. Otherwise, if there existed another odd solution, then we will be able to produce an odd perfect or a spoof odd perfect number whose special prime/quasi-Euler prime has exponent $1$.



Can anybody confirm if my impressions are correct?



Reference



Conditions equivalent to the Descartes–Frenicle–Sorli Conjecture on odd perfect numbers, Notes on Number Theory and Discrete Mathematics, Volume 23, 2017, Number 2, Pages 12—20










share|cite|improve this question



















  • 2




    No futher solutions upto $n=10^7$
    – Peter
    Sep 4 at 15:07












up vote
3
down vote

favorite
1









up vote
3
down vote

favorite
1






1





Let $sigma(x)$ denote the sum of the divisors of the positive integer $x$.



Denote the deficiency of $x$ by
$$D(x)=2x-sigma(x).$$



I am interested in solutions to the equation
$$gcd(n^2, sigma(n^2)) = 2n^2 - sigma(n^2).$$



Case 1: $n$ is even.



In this case, it is known that $n=2^r$ are solutions for $r geq 1$.



Indeed, we have
$$gcd(2^2r, sigma(2^2r)) = 1 = 2(2^2r) - sigma(2^2r)$$
where the second equation follows from the fact that powers of two are almost perfect.



Case 2: $n$ is odd.



Added September 5, 2018 Note that $n^2 = 1$ is a trivial (odd) solution, as $1$ satisfies
$$gcd(1, sigma(1)) = 1 = 2(1) - sigma(1).$$



In this case, the only known solution (with $n>1$) is
$$n^2 = bigg(3cdot7cdot11cdot13bigg)^2 = 9018009.$$



Indeed, we obtain
$$gcd(9018009,sigma(9018009)) = 819 = 2(9018009) - sigma(9018009).$$



Here is my question:




Are there any other solutions?




My Attempt



Looking at the OEIS page for deficient-perfect numbers, it appears that no other solutions are known. Otherwise, if there existed another odd solution, then we will be able to produce an odd perfect or a spoof odd perfect number whose special prime/quasi-Euler prime has exponent $1$.



Can anybody confirm if my impressions are correct?



Reference



Conditions equivalent to the Descartes–Frenicle–Sorli Conjecture on odd perfect numbers, Notes on Number Theory and Discrete Mathematics, Volume 23, 2017, Number 2, Pages 12—20










share|cite|improve this question















Let $sigma(x)$ denote the sum of the divisors of the positive integer $x$.



Denote the deficiency of $x$ by
$$D(x)=2x-sigma(x).$$



I am interested in solutions to the equation
$$gcd(n^2, sigma(n^2)) = 2n^2 - sigma(n^2).$$



Case 1: $n$ is even.



In this case, it is known that $n=2^r$ are solutions for $r geq 1$.



Indeed, we have
$$gcd(2^2r, sigma(2^2r)) = 1 = 2(2^2r) - sigma(2^2r)$$
where the second equation follows from the fact that powers of two are almost perfect.



Case 2: $n$ is odd.



Added September 5, 2018 Note that $n^2 = 1$ is a trivial (odd) solution, as $1$ satisfies
$$gcd(1, sigma(1)) = 1 = 2(1) - sigma(1).$$



In this case, the only known solution (with $n>1$) is
$$n^2 = bigg(3cdot7cdot11cdot13bigg)^2 = 9018009.$$



Indeed, we obtain
$$gcd(9018009,sigma(9018009)) = 819 = 2(9018009) - sigma(9018009).$$



Here is my question:




Are there any other solutions?




My Attempt



Looking at the OEIS page for deficient-perfect numbers, it appears that no other solutions are known. Otherwise, if there existed another odd solution, then we will be able to produce an odd perfect or a spoof odd perfect number whose special prime/quasi-Euler prime has exponent $1$.



Can anybody confirm if my impressions are correct?



Reference



Conditions equivalent to the Descartes–Frenicle–Sorli Conjecture on odd perfect numbers, Notes on Number Theory and Discrete Mathematics, Volume 23, 2017, Number 2, Pages 12—20







elementary-number-theory greatest-common-divisor divisor-sum arithmetic-functions perfect-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 5 at 7:40

























asked Sep 4 at 8:28









Jose Arnaldo Bebita Dris

5,10531941




5,10531941







  • 2




    No futher solutions upto $n=10^7$
    – Peter
    Sep 4 at 15:07












  • 2




    No futher solutions upto $n=10^7$
    – Peter
    Sep 4 at 15:07







2




2




No futher solutions upto $n=10^7$
– Peter
Sep 4 at 15:07




No futher solutions upto $n=10^7$
– Peter
Sep 4 at 15:07















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: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2904786%2fare-there-any-other-squares-n2-for-which-gcdn2-sigman2-2n2-si%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2904786%2fare-there-any-other-squares-n2-for-which-gcdn2-sigman2-2n2-si%23new-answer', 'question_page');

);

Post as a guest













































































這個網誌中的熱門文章

How to combine Bézier curves to a surface?

Mutual Information Always Non-negative

Why am i infinitely getting the same tweet with the Twitter Search API?