Strings

A few people are at a party. As they are bored, they decide to connect each other with strings. Every person must be connected to every other person. For example, if there are \(3\) people \((A, B, C)\), \((A)\) will be connected to \((B,C)\), \((B)\) will be connected to \((A,C)\) and \((C)\) will be connected to \((A,B)\). If they have less than \(1000\) strings, what is the maximum number of people at the party?

×

Problem Loading...

Note Loading...

Set Loading...