A First Course in String Theory

.

Construct explicitly all the states with and count them, verifying that there are indeed a total of 3200 states. **You may find the counting formula in Problem 12.11 useful.**

~~~

Let , the number of ways to put n indistinguishable balls into k boxes.

p.318 “For open bosonic strings , …”

.

When , the cases are:

1. three ‘s:

2. one and one :

3. one :

24

.

Total number of possible states for is 3200.

— Me@2018-04-20 02:45:35 PM

.

.

2018.04.20 Friday (c) All rights reserved by ACHK