Timeline for A tree with prime vertices
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 5, 2020 at 13:30 | comment | added | Zhi-Wei Sun | I thank J. O'Rourke for drawing the prime tree. | |
| May 3, 2020 at 21:09 | comment | added | Joseph O'Rourke | @ Wolfgang: You are asking great questions! I hope @ZhiWeiSun responds. I will think about implementation... [software will not let me @ two users] | |
| May 3, 2020 at 20:30 | comment | added | Wolfgang | And likewise, as there are numbers like 89 with 3 branches arriving, are there also others with 4 or more? | |
| May 3, 2020 at 20:28 | comment | added | Wolfgang | Yes, eventually, as expected. I am also wondering: associate with each prime p the number b(p) of branchings the trajectory encounters before arriving in the main branch. So for the small primes above, it is either 0 or 1, but I guess that there should be bigger primes for which there are 2, 3, ... branching points. Or maybe not? Could you easily find some with your implementation? | |
| May 3, 2020 at 18:08 | comment | added | Joseph O'Rourke | @Wolfgang: Yes. For example, just going a bit further, $223 \rightarrow 251$ is a separate tree, which eventually gets hooked into the main branch. | |
| May 3, 2020 at 15:45 | comment | added | Wolfgang | So if we call the trajectory starting with 2 the main branch, the question is whether the trajectory of any prime not on the main branch will eventually hit it. | |
| May 3, 2020 at 12:37 | history | answered | Joseph O'Rourke | CC BY-SA 4.0 |