Timeline for Is $\Bigl\{ n \sum_{k=2}^{n-1} \frac{1}{k}\Bigr\}$ unique $\forall n \in \Bbb{N}, n>1$
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Nov 12, 2020 at 19:33 | comment | added | Carlo Beenakker | indeed, corrected, thanks @IlyaBogdanov | |
Nov 12, 2020 at 19:33 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
deleted 193 characters in body
|
Nov 12, 2020 at 19:29 | comment | added | Ilya Bogdanov | ...and I do not get an argument when $n$ even, $m$ odd, and $c>m$... | |
Nov 12, 2020 at 19:21 | comment | added | Ilya Bogdanov | If $n$ is odd and $m(<n)$ is even, then merely $v_2(nH_n)<v_2(mH_m)\leq 0$. Indeed, $v_2(H_k)=-\lfloor \log_2 k\rfloor$. | |
Nov 12, 2020 at 16:09 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
deleted 1 character in body
|
Nov 12, 2020 at 14:43 | history | edited | Carlo Beenakker | CC BY-SA 4.0 |
added 2 characters in body
|
Nov 12, 2020 at 14:12 | history | answered | Carlo Beenakker | CC BY-SA 4.0 |