Imagine that $k$ runners on a $1$ mile long circular running track start running with different constant speeds. Pick one of the runners. Will there be a time when this runner is $1/k$ miles away from all other runners?
Is there a rectangle built out of some number of smaller rectangles, so that all the smaller rectangles have equal areas but different perimeters, and so that all the side lengths of all the rectangles are whole numbers?
Build a polyhedron by taking lots of 1X1X1 cubes and gluing them together face-to-face in some interesting way. Can you unfold this polyhedron by cutting along edges to get a single flat shape with no overlaps?
Consider a convex polyhedron in which every face has an even number of edges and every vertex has three faces around it. Can you go for a walk along the edges, coming back to where you started, and passing through each vertex exactly once?