Timeline for Estimates for the size of the product set [n].[n] [duplicate]
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 18, 2023 at 15:50 | comment | added | The Amplitwist | Reposting a link mentioned in a previous comment so that it appears in the "Linked" questions list: Distinct numbers in multiplication table | |
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Apr 18, 2013 at 20:56 | history | edited | CommunityBot |
insert duplicate link
|
|
| Apr 18, 2013 at 20:56 | history | closed |
Eric Naslund Douglas Zare Anthony Quas Suvrit Goldstern |
exact duplicate | |
| Apr 18, 2013 at 18:30 | comment | added | Douglas Zare | To look something like this up, you might compute a few values, then put them into the Online Encyclopedia of Integer Sequences. oeis.org/A027424 | |
| Apr 18, 2013 at 18:29 | comment | added | user31074 | Oh dear, I was trying to edit my comment and ended up deleting it. @everyone: Thanks for all the references. @quid: Thank you, that sort of estimate will suffice for my purposes. To those wondering, I'd asked if there were any obvious ways of lower bounding $c_n$. | |
| Apr 18, 2013 at 18:25 | comment | added | user9072 | @bn: yes, if I understand you right. You will have n/log n prime numbers and all their products (except for symmetry) will be distinct, yielding already a lower bound of n^2/ (2(log n)^2) for the number of products. | |
| Apr 18, 2013 at 17:53 | comment | added | user9072 | @Eric Naslund: so it is a an exact duplicate of an almost duplicate ;-) I knew I saw this somewhere not that long ago (and indeed the first thing I did was to search the site but somehow this did not turn up). Now, that not even the reference is new, I will delete the answer. | |
| Apr 18, 2013 at 17:44 | comment | added | Eric Naslund | This is an exact duplicate of: mathoverflow.net/questions/108912/… | |
| Apr 18, 2013 at 17:31 | comment | added | Gerhard Paseman | This is well researched by Erdos and others; it is the number of distinct values in the corresponding multplication table. You might start with mathoverflow.net/questions/31663/… . Gerhard "Ask Me About System Design" Paseman, 2013.04.18 | |
| Apr 18, 2013 at 17:03 | history | asked | user31074 | CC BY-SA 3.0 |