A proof of $sumlimits_{d|n} sigma(d) = n sumlimits_{d|n} {tau(d) over d}$












3












$begingroup$


I'm trying to proof the following statement:



Let $n in mathbb{Z}$ and the $sum$ are on the divisors $d$ of $n$. Show that
$$sumlimits_{d|n} sigma(d) = n sumlimits_{d|n} {tau(d) over d}.$$



I arrive to a point where I have a product of polynomials and I can't simply find a way to reorder the factors in order to resemble some kind of useful structure for this problem. Any suggestions?





EDIT: due to unsuscribe of user593746, I can't ask delucidation, so I reopen the question because I wish to have detailed delucidation on the passages on the first row of his good proof (summatory index manipulations and t outside the first sum):




We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.











share|cite|improve this question











$endgroup$












  • $begingroup$
    Use math.stackexchange.com/questions/1948422/…
    $endgroup$
    – lab bhattacharjee
    Nov 27 '18 at 14:51






  • 1




    $begingroup$
    The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
    $endgroup$
    – Servaes
    Nov 27 '18 at 14:55
















3












$begingroup$


I'm trying to proof the following statement:



Let $n in mathbb{Z}$ and the $sum$ are on the divisors $d$ of $n$. Show that
$$sumlimits_{d|n} sigma(d) = n sumlimits_{d|n} {tau(d) over d}.$$



I arrive to a point where I have a product of polynomials and I can't simply find a way to reorder the factors in order to resemble some kind of useful structure for this problem. Any suggestions?





EDIT: due to unsuscribe of user593746, I can't ask delucidation, so I reopen the question because I wish to have detailed delucidation on the passages on the first row of his good proof (summatory index manipulations and t outside the first sum):




We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.











share|cite|improve this question











$endgroup$












  • $begingroup$
    Use math.stackexchange.com/questions/1948422/…
    $endgroup$
    – lab bhattacharjee
    Nov 27 '18 at 14:51






  • 1




    $begingroup$
    The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
    $endgroup$
    – Servaes
    Nov 27 '18 at 14:55














3












3








3


2



$begingroup$


I'm trying to proof the following statement:



Let $n in mathbb{Z}$ and the $sum$ are on the divisors $d$ of $n$. Show that
$$sumlimits_{d|n} sigma(d) = n sumlimits_{d|n} {tau(d) over d}.$$



I arrive to a point where I have a product of polynomials and I can't simply find a way to reorder the factors in order to resemble some kind of useful structure for this problem. Any suggestions?





EDIT: due to unsuscribe of user593746, I can't ask delucidation, so I reopen the question because I wish to have detailed delucidation on the passages on the first row of his good proof (summatory index manipulations and t outside the first sum):




We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.











share|cite|improve this question











$endgroup$




I'm trying to proof the following statement:



Let $n in mathbb{Z}$ and the $sum$ are on the divisors $d$ of $n$. Show that
$$sumlimits_{d|n} sigma(d) = n sumlimits_{d|n} {tau(d) over d}.$$



I arrive to a point where I have a product of polynomials and I can't simply find a way to reorder the factors in order to resemble some kind of useful structure for this problem. Any suggestions?





EDIT: due to unsuscribe of user593746, I can't ask delucidation, so I reopen the question because I wish to have detailed delucidation on the passages on the first row of his good proof (summatory index manipulations and t outside the first sum):




We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.








elementary-number-theory summation divisor-sum arithmetic-functions divisor-counting-function






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 15 at 13:32







Alessar

















asked Nov 27 '18 at 14:46









AlessarAlessar

313115




313115












  • $begingroup$
    Use math.stackexchange.com/questions/1948422/…
    $endgroup$
    – lab bhattacharjee
    Nov 27 '18 at 14:51






  • 1




    $begingroup$
    The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
    $endgroup$
    – Servaes
    Nov 27 '18 at 14:55


















  • $begingroup$
    Use math.stackexchange.com/questions/1948422/…
    $endgroup$
    – lab bhattacharjee
    Nov 27 '18 at 14:51






  • 1




    $begingroup$
    The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
    $endgroup$
    – Servaes
    Nov 27 '18 at 14:55
















$begingroup$
Use math.stackexchange.com/questions/1948422/…
$endgroup$
– lab bhattacharjee
Nov 27 '18 at 14:51




$begingroup$
Use math.stackexchange.com/questions/1948422/…
$endgroup$
– lab bhattacharjee
Nov 27 '18 at 14:51




1




1




$begingroup$
The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
$endgroup$
– Servaes
Nov 27 '18 at 14:55




$begingroup$
The sums express two different ways to count the sum of how many divisors $cmid n$ each divisor $dmid n$ divides.
$endgroup$
– Servaes
Nov 27 '18 at 14:55










2 Answers
2






active

oldest

votes


















2





+50







$begingroup$

Here is a derivation with some intermediate steps which might be helpful.




We obtain
begin{align*}
color{blue}{sum_{dmid n}sigma(d)}&=sum_{dmid n}sum_{tmid d}ttag{1}\
&=sum_{{tmid dmid n}atop{t,dgeq 1}}ttag{2}\
&=sum_{{t mid tk mid n}atop{t,kgeq 1}}ttag{3}\
&=sum_{{t mid n,k mid frac{n}{t}}atop{t,kgeq 1}}ttag{4}\
&,,color{blue}{=sum_{t mid n}tsum_{k mid frac{n}{t}}1}tag{5}
end{align*}




Comment:




  • In (1) we use the definition of the divisor function $sigma(d)=sum_{t| d}t$.


  • In (2) we write the index region somewhat more compactly. This does not change the sum, as it is only a rearrangement of the summands.


  • In (3) we use $t|d Longleftrightarrow exists kgeq 1 : tk=d$, assuming $t,d,k$ are positive integers.


  • In (4) we use the transitivity of the $|$ operator: $t| d| nLongrightarrow t|n$ and we also use $t cdot k| nLongleftrightarrow t | frac{n}{k}$.


  • In (5) we rearrange the summands again by summing at first over $t| n$. We also factor out $t$ from the inner sum, since $t$ does not depend on the index variable $k$.




[Add-on 2019-01-17]: A derivation using Dirichlet convolution due to OPs comment.



Taking the unit-function $u(n)=1$ for all $n$ and the function $N(n)=n$ for all $n$ we have
begin{align*}
tau(n)&=sum_{d|n}1=(ustar u)(n)\
sigma(n)&=sum_{d|n}d=(ustar N)(n)
end{align*}



We obtain
begin{align*}
color{blue}{sum_{d|n}sigma(d)}&=(sigma star u)(n)\
&=((ustar N)star u)(n)\
&=(ustar(N star u))(n)\
&=(ustar (ustar N))(n)\
&=((ustar u) star N)(n)\
&=(tau star N)(n)\
&,,color{blue}{=sum_{d|n}tau(d)frac{n}{d}}
end{align*}

and the claim follows.







share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
    $endgroup$
    – Alessar
    Jan 16 at 11:44






  • 1




    $begingroup$
    @Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
    $endgroup$
    – Markus Scheuer
    Jan 16 at 12:14












  • $begingroup$
    Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
    $endgroup$
    – Alessar
    Jan 17 at 7:39






  • 1




    $begingroup$
    @Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
    $endgroup$
    – Markus Scheuer
    Jan 17 at 9:55






  • 1




    $begingroup$
    Wow! Thanks! Wish I could give 100 times that bounty!
    $endgroup$
    – Alessar
    Jan 17 at 9:58



















3












$begingroup$

We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
    $endgroup$
    – Alessar
    Nov 27 '18 at 15:01






  • 1




    $begingroup$
    Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
    $endgroup$
    – user593746
    Nov 27 '18 at 15:03












  • $begingroup$
    You're welcome, thanks for the very good answer!
    $endgroup$
    – Alessar
    Jan 16 at 15:00












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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015855%2fa-proof-of-sum-limits-dn-sigmad-n-sum-limits-dn-taud-over-d%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









2





+50







$begingroup$

Here is a derivation with some intermediate steps which might be helpful.




We obtain
begin{align*}
color{blue}{sum_{dmid n}sigma(d)}&=sum_{dmid n}sum_{tmid d}ttag{1}\
&=sum_{{tmid dmid n}atop{t,dgeq 1}}ttag{2}\
&=sum_{{t mid tk mid n}atop{t,kgeq 1}}ttag{3}\
&=sum_{{t mid n,k mid frac{n}{t}}atop{t,kgeq 1}}ttag{4}\
&,,color{blue}{=sum_{t mid n}tsum_{k mid frac{n}{t}}1}tag{5}
end{align*}




Comment:




  • In (1) we use the definition of the divisor function $sigma(d)=sum_{t| d}t$.


  • In (2) we write the index region somewhat more compactly. This does not change the sum, as it is only a rearrangement of the summands.


  • In (3) we use $t|d Longleftrightarrow exists kgeq 1 : tk=d$, assuming $t,d,k$ are positive integers.


  • In (4) we use the transitivity of the $|$ operator: $t| d| nLongrightarrow t|n$ and we also use $t cdot k| nLongleftrightarrow t | frac{n}{k}$.


  • In (5) we rearrange the summands again by summing at first over $t| n$. We also factor out $t$ from the inner sum, since $t$ does not depend on the index variable $k$.




[Add-on 2019-01-17]: A derivation using Dirichlet convolution due to OPs comment.



Taking the unit-function $u(n)=1$ for all $n$ and the function $N(n)=n$ for all $n$ we have
begin{align*}
tau(n)&=sum_{d|n}1=(ustar u)(n)\
sigma(n)&=sum_{d|n}d=(ustar N)(n)
end{align*}



We obtain
begin{align*}
color{blue}{sum_{d|n}sigma(d)}&=(sigma star u)(n)\
&=((ustar N)star u)(n)\
&=(ustar(N star u))(n)\
&=(ustar (ustar N))(n)\
&=((ustar u) star N)(n)\
&=(tau star N)(n)\
&,,color{blue}{=sum_{d|n}tau(d)frac{n}{d}}
end{align*}

and the claim follows.







share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
    $endgroup$
    – Alessar
    Jan 16 at 11:44






  • 1




    $begingroup$
    @Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
    $endgroup$
    – Markus Scheuer
    Jan 16 at 12:14












  • $begingroup$
    Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
    $endgroup$
    – Alessar
    Jan 17 at 7:39






  • 1




    $begingroup$
    @Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
    $endgroup$
    – Markus Scheuer
    Jan 17 at 9:55






  • 1




    $begingroup$
    Wow! Thanks! Wish I could give 100 times that bounty!
    $endgroup$
    – Alessar
    Jan 17 at 9:58
















2





+50







$begingroup$

Here is a derivation with some intermediate steps which might be helpful.




We obtain
begin{align*}
color{blue}{sum_{dmid n}sigma(d)}&=sum_{dmid n}sum_{tmid d}ttag{1}\
&=sum_{{tmid dmid n}atop{t,dgeq 1}}ttag{2}\
&=sum_{{t mid tk mid n}atop{t,kgeq 1}}ttag{3}\
&=sum_{{t mid n,k mid frac{n}{t}}atop{t,kgeq 1}}ttag{4}\
&,,color{blue}{=sum_{t mid n}tsum_{k mid frac{n}{t}}1}tag{5}
end{align*}




Comment:




  • In (1) we use the definition of the divisor function $sigma(d)=sum_{t| d}t$.


  • In (2) we write the index region somewhat more compactly. This does not change the sum, as it is only a rearrangement of the summands.


  • In (3) we use $t|d Longleftrightarrow exists kgeq 1 : tk=d$, assuming $t,d,k$ are positive integers.


  • In (4) we use the transitivity of the $|$ operator: $t| d| nLongrightarrow t|n$ and we also use $t cdot k| nLongleftrightarrow t | frac{n}{k}$.


  • In (5) we rearrange the summands again by summing at first over $t| n$. We also factor out $t$ from the inner sum, since $t$ does not depend on the index variable $k$.




[Add-on 2019-01-17]: A derivation using Dirichlet convolution due to OPs comment.



Taking the unit-function $u(n)=1$ for all $n$ and the function $N(n)=n$ for all $n$ we have
begin{align*}
tau(n)&=sum_{d|n}1=(ustar u)(n)\
sigma(n)&=sum_{d|n}d=(ustar N)(n)
end{align*}



We obtain
begin{align*}
color{blue}{sum_{d|n}sigma(d)}&=(sigma star u)(n)\
&=((ustar N)star u)(n)\
&=(ustar(N star u))(n)\
&=(ustar (ustar N))(n)\
&=((ustar u) star N)(n)\
&=(tau star N)(n)\
&,,color{blue}{=sum_{d|n}tau(d)frac{n}{d}}
end{align*}

and the claim follows.







share|cite|improve this answer











$endgroup$













  • $begingroup$
    Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
    $endgroup$
    – Alessar
    Jan 16 at 11:44






  • 1




    $begingroup$
    @Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
    $endgroup$
    – Markus Scheuer
    Jan 16 at 12:14












  • $begingroup$
    Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
    $endgroup$
    – Alessar
    Jan 17 at 7:39






  • 1




    $begingroup$
    @Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
    $endgroup$
    – Markus Scheuer
    Jan 17 at 9:55






  • 1




    $begingroup$
    Wow! Thanks! Wish I could give 100 times that bounty!
    $endgroup$
    – Alessar
    Jan 17 at 9:58














2





+50







2





+50



2




+50



$begingroup$

Here is a derivation with some intermediate steps which might be helpful.




We obtain
begin{align*}
color{blue}{sum_{dmid n}sigma(d)}&=sum_{dmid n}sum_{tmid d}ttag{1}\
&=sum_{{tmid dmid n}atop{t,dgeq 1}}ttag{2}\
&=sum_{{t mid tk mid n}atop{t,kgeq 1}}ttag{3}\
&=sum_{{t mid n,k mid frac{n}{t}}atop{t,kgeq 1}}ttag{4}\
&,,color{blue}{=sum_{t mid n}tsum_{k mid frac{n}{t}}1}tag{5}
end{align*}




Comment:




  • In (1) we use the definition of the divisor function $sigma(d)=sum_{t| d}t$.


  • In (2) we write the index region somewhat more compactly. This does not change the sum, as it is only a rearrangement of the summands.


  • In (3) we use $t|d Longleftrightarrow exists kgeq 1 : tk=d$, assuming $t,d,k$ are positive integers.


  • In (4) we use the transitivity of the $|$ operator: $t| d| nLongrightarrow t|n$ and we also use $t cdot k| nLongleftrightarrow t | frac{n}{k}$.


  • In (5) we rearrange the summands again by summing at first over $t| n$. We also factor out $t$ from the inner sum, since $t$ does not depend on the index variable $k$.




[Add-on 2019-01-17]: A derivation using Dirichlet convolution due to OPs comment.



Taking the unit-function $u(n)=1$ for all $n$ and the function $N(n)=n$ for all $n$ we have
begin{align*}
tau(n)&=sum_{d|n}1=(ustar u)(n)\
sigma(n)&=sum_{d|n}d=(ustar N)(n)
end{align*}



We obtain
begin{align*}
color{blue}{sum_{d|n}sigma(d)}&=(sigma star u)(n)\
&=((ustar N)star u)(n)\
&=(ustar(N star u))(n)\
&=(ustar (ustar N))(n)\
&=((ustar u) star N)(n)\
&=(tau star N)(n)\
&,,color{blue}{=sum_{d|n}tau(d)frac{n}{d}}
end{align*}

and the claim follows.







share|cite|improve this answer











$endgroup$



Here is a derivation with some intermediate steps which might be helpful.




We obtain
begin{align*}
color{blue}{sum_{dmid n}sigma(d)}&=sum_{dmid n}sum_{tmid d}ttag{1}\
&=sum_{{tmid dmid n}atop{t,dgeq 1}}ttag{2}\
&=sum_{{t mid tk mid n}atop{t,kgeq 1}}ttag{3}\
&=sum_{{t mid n,k mid frac{n}{t}}atop{t,kgeq 1}}ttag{4}\
&,,color{blue}{=sum_{t mid n}tsum_{k mid frac{n}{t}}1}tag{5}
end{align*}




Comment:




  • In (1) we use the definition of the divisor function $sigma(d)=sum_{t| d}t$.


  • In (2) we write the index region somewhat more compactly. This does not change the sum, as it is only a rearrangement of the summands.


  • In (3) we use $t|d Longleftrightarrow exists kgeq 1 : tk=d$, assuming $t,d,k$ are positive integers.


  • In (4) we use the transitivity of the $|$ operator: $t| d| nLongrightarrow t|n$ and we also use $t cdot k| nLongleftrightarrow t | frac{n}{k}$.


  • In (5) we rearrange the summands again by summing at first over $t| n$. We also factor out $t$ from the inner sum, since $t$ does not depend on the index variable $k$.




[Add-on 2019-01-17]: A derivation using Dirichlet convolution due to OPs comment.



Taking the unit-function $u(n)=1$ for all $n$ and the function $N(n)=n$ for all $n$ we have
begin{align*}
tau(n)&=sum_{d|n}1=(ustar u)(n)\
sigma(n)&=sum_{d|n}d=(ustar N)(n)
end{align*}



We obtain
begin{align*}
color{blue}{sum_{d|n}sigma(d)}&=(sigma star u)(n)\
&=((ustar N)star u)(n)\
&=(ustar(N star u))(n)\
&=(ustar (ustar N))(n)\
&=((ustar u) star N)(n)\
&=(tau star N)(n)\
&,,color{blue}{=sum_{d|n}tau(d)frac{n}{d}}
end{align*}

and the claim follows.








share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Jan 17 at 9:59

























answered Jan 16 at 10:53









Markus ScheuerMarkus Scheuer

63.5k460151




63.5k460151












  • $begingroup$
    Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
    $endgroup$
    – Alessar
    Jan 16 at 11:44






  • 1




    $begingroup$
    @Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
    $endgroup$
    – Markus Scheuer
    Jan 16 at 12:14












  • $begingroup$
    Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
    $endgroup$
    – Alessar
    Jan 17 at 7:39






  • 1




    $begingroup$
    @Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
    $endgroup$
    – Markus Scheuer
    Jan 17 at 9:55






  • 1




    $begingroup$
    Wow! Thanks! Wish I could give 100 times that bounty!
    $endgroup$
    – Alessar
    Jan 17 at 9:58


















  • $begingroup$
    Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
    $endgroup$
    – Alessar
    Jan 16 at 11:44






  • 1




    $begingroup$
    @Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
    $endgroup$
    – Markus Scheuer
    Jan 16 at 12:14












  • $begingroup$
    Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
    $endgroup$
    – Alessar
    Jan 17 at 7:39






  • 1




    $begingroup$
    @Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
    $endgroup$
    – Markus Scheuer
    Jan 17 at 9:55






  • 1




    $begingroup$
    Wow! Thanks! Wish I could give 100 times that bounty!
    $endgroup$
    – Alessar
    Jan 17 at 9:58
















$begingroup$
Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
$endgroup$
– Alessar
Jan 16 at 11:44




$begingroup$
Thank you for this precise explanation; one thing, the term $t$ can be carried out of the fist sum according to some kind of properties or constraint?
$endgroup$
– Alessar
Jan 16 at 11:44




1




1




$begingroup$
@Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
$endgroup$
– Markus Scheuer
Jan 16 at 12:14






$begingroup$
@Alessar: You're welcome and you're right, we can factor out $t$ since it does not depend on the index of the inner sum. I've updated the answer accordingly.
$endgroup$
– Markus Scheuer
Jan 16 at 12:14














$begingroup$
Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
$endgroup$
– Alessar
Jan 17 at 7:39




$begingroup$
Sheuer, one curious question; this kind of derivation in this proof can be done only using Dirichlet convolutions?
$endgroup$
– Alessar
Jan 17 at 7:39




1




1




$begingroup$
@Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
$endgroup$
– Markus Scheuer
Jan 17 at 9:55




$begingroup$
@Alessar: Many thanks for accepting my answer and granting the bounty. I've added a derivation based upon Dirichlet convolution.
$endgroup$
– Markus Scheuer
Jan 17 at 9:55




1




1




$begingroup$
Wow! Thanks! Wish I could give 100 times that bounty!
$endgroup$
– Alessar
Jan 17 at 9:58




$begingroup$
Wow! Thanks! Wish I could give 100 times that bounty!
$endgroup$
– Alessar
Jan 17 at 9:58











3












$begingroup$

We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
    $endgroup$
    – Alessar
    Nov 27 '18 at 15:01






  • 1




    $begingroup$
    Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
    $endgroup$
    – user593746
    Nov 27 '18 at 15:03












  • $begingroup$
    You're welcome, thanks for the very good answer!
    $endgroup$
    – Alessar
    Jan 16 at 15:00
















3












$begingroup$

We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
    $endgroup$
    – Alessar
    Nov 27 '18 at 15:01






  • 1




    $begingroup$
    Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
    $endgroup$
    – user593746
    Nov 27 '18 at 15:03












  • $begingroup$
    You're welcome, thanks for the very good answer!
    $endgroup$
    – Alessar
    Jan 16 at 15:00














3












3








3





$begingroup$

We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.






share|cite|improve this answer









$endgroup$



We have $$sum_{dmid n}sigma(d)=sum_{dmid n}sum_{tmid d}t=sum_{tmid n}sum_{kmid frac{n}{t}}t=sum_{tmid n}tsum_{kmid frac{n}t}1,$$
where $k=frac{d}{t}$. So
$$sum_{dmid n}sigma(d)=sum_{tmid n}ttauleft(frac{n}tright)=sum_{delta mid n}frac{n}{delta}tau(delta)=nsum_{deltamid n}frac{tau(delta)}{delta},$$
where $delta =frac{n}{t}$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 27 '18 at 14:51







user593746



















  • $begingroup$
    In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
    $endgroup$
    – Alessar
    Nov 27 '18 at 15:01






  • 1




    $begingroup$
    Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
    $endgroup$
    – user593746
    Nov 27 '18 at 15:03












  • $begingroup$
    You're welcome, thanks for the very good answer!
    $endgroup$
    – Alessar
    Jan 16 at 15:00


















  • $begingroup$
    In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
    $endgroup$
    – Alessar
    Nov 27 '18 at 15:01






  • 1




    $begingroup$
    Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
    $endgroup$
    – user593746
    Nov 27 '18 at 15:03












  • $begingroup$
    You're welcome, thanks for the very good answer!
    $endgroup$
    – Alessar
    Jan 16 at 15:00
















$begingroup$
In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
$endgroup$
– Alessar
Nov 27 '18 at 15:01




$begingroup$
In the final result $delta$ has the same exact meaning of $d$, identify the same divisors, right?
$endgroup$
– Alessar
Nov 27 '18 at 15:01




1




1




$begingroup$
Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
$endgroup$
– user593746
Nov 27 '18 at 15:03






$begingroup$
Yep. I used a different variable because I wanted to define $delta=frac{n}{t}$, which could be confusing if I say $d=frac{n}{t}$, since $d$ is used in $k=frac{d}{t}$ already. But then, which ever variables you are using as the indices of summation don't really matter.
$endgroup$
– user593746
Nov 27 '18 at 15:03














$begingroup$
You're welcome, thanks for the very good answer!
$endgroup$
– Alessar
Jan 16 at 15:00




$begingroup$
You're welcome, thanks for the very good answer!
$endgroup$
– Alessar
Jan 16 at 15:00


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3015855%2fa-proof-of-sum-limits-dn-sigmad-n-sum-limits-dn-taud-over-d%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

Human spaceflight

Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

張江高科駅