Home > books, Mathematics > Combinatorial Methods with Computer Applications

Combinatorial Methods with Computer Applications


I found this book very instructive.  The scope is broad. The writing was clear and there were many instructive examples.

I enjoyed the following topics: Stirling numbers of the first and second kind, binomial coefficient properties and identities,  fibonacci number properties and identities (e.g. the worst case scenario input for Euclidean algorithm for greatest common divisor),  and  especially the Burnside lemma and Polya enumeration (cycle index polynomial).

I hope come back to this book  as both a resource but to read in greater depth than my ‘first pass’.


Categories: books, Mathematics
  1. No comments yet.
  1. No trackbacks yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: