加载中…
We adapt (over ) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are inspired by the “analogous” works in \cite{Gall-Rahav-newcongr} and \cite{Touchard}, about odd perfect numbers.

生成讲解博客的中文版本

生成AI智能校验的中文版本