This note is part of the set Exploring the Divisor Function.
In this set, we aim to get a general form for this sum:
Where is a positive integer.
So, instead of giving out everything on a note, why not split it up into several problems so that everybody can try it out by themselves?
I will give a clue here, and then you can go ahead to solve the first problem of this set, slowly progressing to the last problem, where you will finally be able to find a general form of the sum. You may skip steps, because your approach might be better than mine. If you do have a better approach, do post it!
Here's the first clue:
If is completely multiplicative, that is , then
Where is the Dirichlet Convolution
and counts the number of divisors n.
I would post the solutions for the problems soon.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
my mind is blown
I cannot work it out for 4 as k Can you help?
Log in to reply
Oh yeah, thanks for commenting here. I forgot to add the solutions...
If you want to consider k=4, generalise it to k=pa, where p is prime. I'll post a solution to part 3 of the set by tomorrow, where you can use it for k=4.
You can use part 1 of this set as a clue to part 3, but you'll have to be more creative.
Log in to reply
thanks!
Log in to reply