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 33 people (A,B,C)(A, B, C), (A)(A) will be connected to (B,C)(B,C), (B)(B) will be connected to (A,C)(A,C) and (C)(C) will be connected to (A,B)(A,B). If they have less than 10001000 strings, what is the maximum number of people at the party?

×

Problem Loading...

Note Loading...

Set Loading...