Timeline for Complexity of representations of sets using elementary functions
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13, 2019 at 13:12 | comment | added | Display name | @GerryMyerson Yes. That and the prime generating example involving Wilson's Theorem was why I didn't allow floors or division. | |
| Aug 13, 2019 at 13:11 | comment | added | Robert Israel | If you allow square roots and division when the results are integers, you can map those "infinitely many negative numbers" to $0$, since $(x + \sqrt{x^2})/2 = 0$ if $x \le 0$, $x$ if $x \ge 0$. | |
| Aug 13, 2019 at 13:11 | comment | added | Wojowu | I have taken a liberty of changing the title to something more descriptive. Regarding the conjectures themselves, I have little hope for them being even remotely approachable. Even with Fermat numbers $2^{2^n}+1$, it has not been excluded that all but finitely many of them are primes. | |
| Aug 13, 2019 at 13:09 | history | edited | Wojowu | CC BY-SA 4.0 |
edited title
|
| Aug 13, 2019 at 13:07 | comment | added | Gerry Myerson | Do you know about Mills' constant? en.wikipedia.org/wiki/Mills%27_constant | |
| S Aug 13, 2019 at 11:28 | history | suggested | Ali Taghavi | CC BY-SA 4.0 |
I add a tag.
|
| Aug 13, 2019 at 11:24 | review | Suggested edits | |||
| S Aug 13, 2019 at 11:28 | |||||
| Aug 13, 2019 at 10:53 | history | edited | Display name | CC BY-SA 4.0 |
added 47 characters in body
|
| Aug 13, 2019 at 10:45 | history | edited | Display name | CC BY-SA 4.0 |
added 300 characters in body
|
| Aug 13, 2019 at 10:40 | review | First posts | |||
| Aug 13, 2019 at 12:29 | |||||
| Aug 13, 2019 at 10:37 | history | asked | Display name | CC BY-SA 4.0 |