当前位置:
X-MOL 学术
›
Int. J. Number Theory
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A combinatorial proof of a recurrence relation for the sum of divisors function
International Journal of Number Theory ( IF 0.7 ) Pub Date : 2020-07-07 , DOI: 10.1142/s1793042120400084 Sun Kim 1
International Journal of Number Theory ( IF 0.7 ) Pub Date : 2020-07-07 , DOI: 10.1142/s1793042120400084 Sun Kim 1
Affiliation
We give a combinatorial proof of a generalization of an identity involving the sum of divisors function σ ( n ) and the partition function p ( n ) , which is a companion of Euler’s recurrence formula for σ ( n ) .
中文翻译:
除数之和函数的递推关系的组合证明
我们给出了一个包含除数之和函数的恒等式泛化的组合证明σ ( n ) 和配分函数p ( n ) , 这是欧拉的递推公式的伴侣σ ( n ) .
更新日期:2020-07-07
中文翻译:
除数之和函数的递推关系的组合证明
我们给出了一个包含除数之和函数的恒等式泛化的组合证明