On a sum of a multiplicative function linked to the divisor function over the set of integers B-multiple of 5
Abstract
Let d(n) and d(n) be the numbers of divisors and the numbers of unitary divisors of the integer n≥1. In this paper, we prove that \[ n∈Bn≤ xΣd(n)d% (n)=16π% %TCIMACROb2% %BeginExpansion 2% %EndExpansion 123pΠ(1-12p% %TCIMACROb2% %BeginExpansion 2% %EndExpansion +12p3)x+O( x810+ ) ,~( x≥slant1,~>0) , \] where B is the set which contains any integer that is not a multiple of 5, but some permutations of its digits is a multiple of 5.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.