Find how many $m \le 1000$ such that : $$\sum\limits_{k=1}^m \left\lfloor \frac{m}{k}\right\rfloor$$
be even ( $\lfloor x\rfloor$ is the largest integer smaller than $x$.)
I think that one case is $\sum\limits_{k=1}^m \left\lfloor \frac{m}{k}\right\rfloor$ is even if for every integer $k$ ( $ 1 \le k \le m $) $\left\lfloor\frac{m}{k}\right\rfloor$ be even or the number of odd number be even in $\sum\limits_{k=1}^m \left\lfloor\frac{m}{k}\right\rfloor$. $\big($ $ \sum\limits_{i=1}^n\left\lfloor\frac{n}{i}\right\rfloor=\sum\limits_{i=1}^n d(i) $ where $d(\ )$ is the divisor function $\big)$
Hint, further to the comments $$\sum\limits_{k=1}^{m} \left \lfloor \frac{m}{k} \right \rfloor=\sum\limits_{k=1}^{m}d(k) \tag{1}$$
Is the pattern visible now? It should be easy to show it by induction.