Timeline for Distinct numbers in multiplication table
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 6, 2021 at 8:22 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 7 characters in body; edited tags
|
| Jul 29, 2021 at 10:03 | answer | added | Tony Huynh | timeline score: 6 | |
| Apr 28, 2015 at 23:12 | answer | added | Joe Silverman | timeline score: 12 | |
| Dec 9, 2013 at 15:49 | comment | added | Eric Naslund | Related: mathoverflow.net/questions/108912/… | |
| Oct 18, 2013 at 3:58 | comment | added | Noam D. Elkies | If all you can hope to save is a fractional power of $\log n$ then you ought to keep track of powers of $\log n$ in the computation model and complexity estimates; and then, even if you use repeated addition rather than multiplication to get each row of the multiplication table, the direct method seems to take $n^2 \log n$ time and space if you count honestly (i.e. $\log n$ bits for a number of size $n$). | |
| Jul 13, 2010 at 6:04 | comment | added | Sidney Raffer | A nice paper on this with plenty of references: Multiples and Divisors, by Steven Finch, available online from CiteSeer. | |
| Jul 13, 2010 at 6:00 | answer | added | Gerry Myerson | timeline score: 29 | |
| Jul 13, 2010 at 5:37 | history | asked | falagar | CC BY-SA 2.5 |