Timeline for factorazy $k$-tuples
Current License: CC BY-SA 3.0
11 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 26, 2017 at 19:59 | history | edited | user114642 | CC BY-SA 3.0 |
changed the name of the concept
|
Sep 23, 2017 at 19:29 | comment | added | user114642 | @GerryMyerson Yes, it is very similar in spirit. | |
Sep 23, 2017 at 4:41 | comment | added | Gerry Myerson | The question is very close to, perhaps a duplicate of, mathoverflow.net/questions/261640/… | |
Sep 23, 2017 at 4:37 | comment | added | Gerry Myerson | Smallest $m$ such that $p(m)<\cdots<p(m+k-1)$ are tabulated at oeis.org/A100384, e.g., $p(256994754033)<\cdots<p(256994754047)$. oeis.org/A079749 is closely related. | |
Sep 23, 2017 at 4:28 | comment | added | Gerry Myerson | Honestly, my opinions on such a question are worth nothing. | |
Sep 23, 2017 at 4:28 | answer | added | Gerry Myerson | timeline score: 5 | |
Sep 23, 2017 at 1:25 | comment | added | user114642 | @GerryMyerson Do you expect $k$-factorazy tuples to exist for every $k$? | |
Sep 22, 2017 at 23:08 | comment | added | Gerry Myerson | $p(n)$ is tabulated at oeis.org/A006530 with a link to a listing up to $n=100,000$. $p(8)<\cdots<p(11)$; $p(90)<\cdots<p(94)$; $p(168)<\cdots<p(173)$. | |
Sep 22, 2017 at 20:47 | answer | added | Greg Martin | timeline score: 3 | |
Sep 22, 2017 at 20:39 | history | edited | Greg Martin | CC BY-SA 3.0 |
added 3 characters in body
|
Sep 22, 2017 at 20:10 | history | asked | user114642 | CC BY-SA 3.0 |