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.

现在轮到你 没有计算器能解决这一个问题, 但其中的碎片是可以计算的。 请在下面尝试一个, 或者输入您自己的 。

保持你自己的工作

免费账户在每一课上都添加注解, 记录你完成的, 在一个地方解决的, 以及您可以询问的关于此页的导师。 数学本身向每个人开放, 是否签名 。

签名上签名 登录

此处所用符号

输入完整定义、图片和其中每个字母的含义的符号。

人们对人们提出的问题

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.

本页部分内容从 Keller & Trotter, Applied Combinatorics (CC BY-SA 4.0). 在这里进行浓缩和重新解释;错误属于我们。

更多 Combinatorics & Graph Theory