Description:
Math: Combinatorics and related fields
|
|
|
test banks and solution manuals for sale
|
| |
Comprehensive test banks and solution manuals for sale
Email us at bestsellers.testbanks[at]gmail .com if you need to buy any test bank or solution manual listed below. We are proud to say that as per December 1st, 2012 we have in our collections:
4500 Solutions Manuals for various textbooks from major publishers.... more »
|
|
|
complement of Uniform Distribution?
|
| |
I'm not sure the subject makes much sense so I will give the actual example.
Consider N empty indistinguishable urns placed in a row and m indistinguishable balls. I place one of the balls in one of the urns chosen at random. The probability that a particular urn remain empty is of course... more »
|
|
|
How to compute the permanent of a matrix
|
| |
I've read how to calculate the permanent of a matrix, but I found the
notation hard to understand so I'd Like a practical demonstration. For
2 by 2 matrices It's easy. For example, the permanent of
2 4
9 6
Is 2*6+4*9=36+12=48
But what about... more »
|
|
|
Think Parks
|
| |
Think parks need only a 100 meter long pathway to be implemented. They promote a better understanding of the very small and very large numbers we encounter daily in our description of reality from atoms to the universe. They enables a clearer visualization of concepts and topics learned in physics, chemistry, biology, geology, history and philosophy. They offer us a place of meditation and contemplation resulting in a greater appreciation of our world and our purpose in it. See YouTube video "Think Parks". [link]... more »
|
|
|
Math as Fiction
|
| |
Seeking reviewers / interviewers.
Halvor Aakhus has made mathematics sexy. And cool. We're hoping to expand the cultural conversation of mathematics by finding people to review or discuss his book, and/or interview him for math, science or other websites and periodicals.
Aakhus’s debut novel, Book of Knut: A Novel by Knut Knudson, combines real math problems with paintings, musical scores and a wildly entertaining story. The book won the $10,000 Henfield Prize for its startling originality and humane intelligence.... more »
|
|
|
covering paths in a directed graph by subpaths
|
| |
Hello.
This sounds like something for which an algorithm already exists, but I can't find anything that addresses it.
Given a directed graph G, possibly with cycles, and with exactly one source and one sink, we want to generate a list of all the paths from the source to the sink (potentially an infinite list if there is a cycle). We want to be able to create any path on this list by composing elements of a given set of subpaths. That is, we have a (finite) set of paths in G, from any vertex to any other vertex (not necessarily from the source to the sink), where any of the paths are allowed to repeat edges, and we would like to determine whether we can generate any path from the source to the sink by gluing some of these paths together end-to-end (the ends must match up).... more »
|
|
|
Educational videos
|
| |
Animation of encryption. See YouTube video "Encryption Simplified". [link]
What do numbers have to tell us? How can we listen? See YouTube video "Numbers Simplified". [link]
|
|
|
combinatorics
|
| |
I posted the following in 'alt.sci.math.probability' but got no replies, so I decided to try here. My apologies for multiposting.
How many ways can b indistinguishable balls be placed in a rectangular array of r (r>b>2c) rows and c columns such that no row is completely full?
If that cannot be solved in general, what about the special case where c=... more »
|
|
|
