Timeline for Distinct numbers in multiplication table
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 5, 2020 at 22:52 | comment | added | Gerry Myerson | @VS. I don't know. Have you looked at the paper to see how the bound is expressed there? | |
| May 5, 2020 at 17:18 | comment | added | VS. | @GerryMyerson "the number of positive integers $n\le x$, which can be written as $n=m_1m_2$, with each $m_i\le\sqrt x$, is bounded above and below by a constant times $x(\log x)^{-\delta}(\log\log x)^{-3/2}$, where $\delta=1-(1+\log\log2)/\log2$". That bound is asymptotic bound. Is there a minimum $x$ needed for that bound to be effective? | |
| S Oct 18, 2013 at 1:32 | history | suggested | xan | CC BY-SA 3.0 |
fix broken link
|
| Oct 18, 2013 at 1:18 | review | Suggested edits | |||
| S Oct 18, 2013 at 1:32 | |||||
| Jul 22, 2010 at 4:35 | comment | added | Charles | Ford's Annals of Mathematics preprint is on the arXiv: arxiv.org/abs/math/0401223 | |
| Jul 13, 2010 at 8:43 | comment | added | falagar | Thank you for references! The PARI program implements straightforward $O(n^2)$ algorithm. Is there any algorithm which works faster than $O(n^2)$? | |
| Jul 13, 2010 at 6:06 | history | edited | Gerry Myerson | CC BY-SA 2.5 |
added 172 characters in body; added 108 characters in body
|
| Jul 13, 2010 at 6:00 | history | answered | Gerry Myerson | CC BY-SA 2.5 |