Timeline for Asymptotics of the least common multiple of the first natural numbers
Current License: CC BY-SA 3.0
2 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 5 at 0:45 | comment | added | Bjorn Poonen | I don't think this argument is correct. The sum here equals $\sum_{p \le n} (\log n - \log p)$, but both $\sum_{p \le n} \log n$ and $\sum_{p \le n} \log p$ are asymptotic to $n$, by the prime number theorem. | |
Sep 9, 2015 at 15:01 | history | answered | Brando | CC BY-SA 3.0 |