Keys required for cryptography
The system can be viewed as a complete graph, in which each vertex is a user and each edge represents a different symmetric key.

Thus for 100 users (vertices), you need (100*99)/2 keys (edges). This is roughly 5,000.

To help visualise, consider the image below from Wikipedia. It demonstrates a complete graph with seven users. Hence 21 seperate keys would be required.