Problem 4 The vertices of the graph are drawn on the plane, numbered from 2 to 30. At the same time, two vertices with n
Posted: Thu Apr 28, 2022 6:41 am
Problem 4 The vertices of the graph are drawn on the plane, numbered from 2 to 30. At the same time, two vertices with numbers a and b are connected by an edge only if one of the numbers a orb is divisible by the other. How many connected components does this graph have?