- #1
mkbh_10
- 222
- 0
Suppose a problem requires me to find the result of [(a+a#)^n ]ln> , where a is the annhilation operator , and a# is the creation operator , now n can be any number , suppose if it is 10 then will i write (a+a#) 10 times and then multiply each of these terms to see which are non zero , isn't there some general form of getting result of (a+a#)^n ?
The normal method of multiplying will become too cumbersome if n is a large number .
The normal method of multiplying will become too cumbersome if n is a large number .