This is a fuzzier follow-up to this question. Again, we construct the graph whose vertices are integers from $1$ to $n,$ and two vertices are connected whenever one of the corresponding integers divides the other, and then we lay the graph out radially, so the vertex corresponding to $1$ is at the center of the circle, and the others are clockwise around the circumference This is what we get (for $n=180$n=180$). There are obviously patterns, but how do we explain them?
$n=180$" />This is a fuzzier follow-up to this question. Again, we construct the graph whose vertices are integers from $1$ to $n,$ and two vertices are connected whenever one of the corresponding integers divides the other, and then we lay the graph out radially, so the vertex corresponding to $1$ is at the center of the circle, and the others are clockwise around the circumference This is what we get (for $n=180). There are obviously patterns, but how do we explain them?
This is a fuzzier follow-up to this question. Again, we construct the graph whose vertices are integers from $1$ to $n,$ and two vertices are connected whenever one of the corresponding integers divides the other, and then we lay the graph out radially, so the vertex corresponding to $1$ is at the center of the circle, and the others are clockwise around the circumference This is what we get (for $n=180$). There are obviously patterns, but how do we explain them?
More on divisibility
This is a fuzzier follow-up to this question. Again, we construct the graph whose vertices are integers from $1$ to $n,$ and two vertices are connected whenever one of the corresponding integers divides the other, and then we lay the graph out radially, so the vertex corresponding to $1$ is at the center of the circle, and the others are clockwise around the circumference This is what we get (for $n=180). There are obviously patterns, but how do we explain them?