Y by
There is a regular octagonal prism, all edges of which are equal to
m. A spider sits in the center of one of the side faces. It can move on the surface prisms until its
m long cobweb ends. The spider wondered if there were on the bases of the prism, points to which it can reach with at least two different shortest paths, and at the same time spending all the cobweb. Help the spider count the number of such points.


This post has been edited 1 time. Last edited by parmenides51, May 3, 2021, 8:27 PM