Skip to main content

Timeline for Recurrence for the sum

Current License: CC BY-SA 4.0

16 events
when toggle format what by license comment
Nov 5, 2021 at 11:48 history edited Notamathematician CC BY-SA 4.0
added 733 characters in body
Oct 2, 2021 at 16:54 comment added markvs @LSpice: MathJax does not interpret \bmod correctly on my screen and $(\frac mn)$ instead of $\left(\frac mn\right)$ looks weird and hard to read (for me).
Oct 2, 2021 at 16:50 comment added LSpice @markvs, re, the use of \bmod in place of \mod and of () in place of \left(\right) are not misprints.
S Oct 2, 2021 at 12:42 history suggested markvs CC BY-SA 4.0
fixed misprints
Oct 2, 2021 at 3:56 review Suggested edits
S Oct 2, 2021 at 12:42
Oct 1, 2021 at 10:27 vote accept Notamathematician
Sep 30, 2021 at 21:25 history edited Max Alekseyev CC BY-SA 4.0
deleted 2 characters in body
Sep 30, 2021 at 21:19 comment added Max Alekseyev @Notamathematician: I've edited your question accordingly.
Sep 30, 2021 at 21:19 history edited Max Alekseyev CC BY-SA 4.0
edited per suggestion in the comments
Sep 30, 2021 at 21:13 answer added Max Alekseyev timeline score: 4
Sep 30, 2021 at 16:14 answer added Alapan Das timeline score: 3
Sep 30, 2021 at 14:31 comment added Alapan Das I think we should start like this: $S(n,m)=\sum_{l=0}^{m-1}(\sum_{k=0}^{m^{n-1}-1}a(mk+l,m))$. This gives $S(n,m)=mS(n-1,m)+\sum_{k=0}^{m^{n-1}-1}a(km-f(k,m),m)$
Sep 30, 2021 at 14:04 comment added Notamathematician @FedorPetrov, thank you for comment! You are absolutely right.
Sep 30, 2021 at 13:58 comment added Fedor Petrov In other words, $f(n,m)$ is the maximal power of $m$ which divides $n$?
Sep 30, 2021 at 13:54 comment added Notamathematician @MaxAlekseyev, thank you for comment! Сould you please make the necessary corrections? I'm trying to understand what's wrong, but I cannot.
Sep 30, 2021 at 13:36 history asked Notamathematician CC BY-SA 4.0