Problem #PRU-35598

Problems Geometry Solid geometry Visual geometry in space

Problem

In a communication system consisting of 2001 subscribers, each subscriber is connected with exactly \(n\) others. Determine all the possible values of \(n\).