home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #23 / NN_1992_23.iso / spool / sci / math / 12851 < prev    next >
Encoding:
Text File  |  1992-10-07  |  737 b   |  22 lines
  1. Newsgroups: sci.math
  2. Path: sparky!uunet!gumby!destroyer!sol.ctr.columbia.edu!news.cs.columbia.edu!thanasis
  3. From: thanasis@cs.columbia.edu (Thanasis Tsantilas)
  4. Subject: Catalan NUmbers
  5. Message-ID: <BvrFrn.53A@cs.columbia.edu>
  6. Sender: news@cs.columbia.edu (The Daily News)
  7. Organization: Columbia University Department of Computer Science
  8. Date: Wed, 7 Oct 1992 16:42:59 GMT
  9. Lines: 11
  10.  
  11.  
  12. Is there a combinatorial ("bijective") way to prove that the 
  13. Catalan numbers are equal to C(2n,n)/(n+1)? 
  14. The answer looks simple, so I thought there must be something.
  15. I'm only aware of the generating function solution of the recurrence.
  16. Any pointers to books/articles are appreciated.
  17.  
  18. Thanasis Tsantilas
  19. Columbia University
  20. thanasis@cs.columbia.edu
  21.  
  22.