maths.free › Combinatorics & Graph Theory › Generating Functions › Discussion
Discussion
After studying the proof that the number of partitions of an integer into odd parts is the same as the number of partitions of that integer into distinct parts, Yolanda was beside herself.
Discussion
After studying the proof that the number of partitions of an integer into odd parts is the same as the number of partitions of that integer into distinct parts, Yolanda was beside herself. Do you guys realize what we just did? We showed that two quantities were equal without saying anything about what those quantities actually were. That's really neat, she said. Nobody said anything for a long time, but after some time Dave said There might be other instances where you would want to be able to communicate fully, yet hold back on every last detail. Bob said I don't get it. Alice interjected a comment that was more of question than a statement Do you mean that parties may want to communicate, while maintaining that the conversation did not occur? Carlos added Or maybe they just want to be able to detect whether anyone else was listening. Now Zori was nearly happy. Privacy and security were big ticket items.
Nå har du Ingen kalkulator setter opp denne, men brikkene kan brukes. Prøv en nedenfor eller skriv inn din egen.
Symboler som brukes her
Trykk på et symbol for den fulle definisjonen, et bilde og hva hver bokstav i det betyr.
Spørsmål folk stiller
Permutation or combination?
Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).
What is a graph in this sense?
Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.
Deler av denne siden er tilpasset fra Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). Kondensert og re-forklaret her, feil er vår.
Mer i Combinatorics & Graph Theory
The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleRecurrences and generating functionsGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs