Using Zeta Zeros to Tally Squarefree Divisors


demonstrations.wolfram.com The Wolfram Demonstrations Project contains thousands of free interactive visualizations, with new entries added daily. For a positive integer n, TemplateBox[{n}, PrimeNu] is the number of distinct prime factors of n. The number of squarefree divisors of n is 2^TemplateBox[{n}, PrimeNu]. We define F(x) to be the sum of TagBox[SuperscriptBox[2, TemplateBox[{n}, PrimeNu]],… Contributed by: Robert Baillie