Prove combinatorially the recurrence p n </msub> ( k ) = p n </ms

wanaopatays 2022-05-24 Answered
Prove combinatorially the recurrence p n ( k ) = p n ( k n ) + p n 1 ( k 1 ) for all 0 < n k
Recall that p n ( k ) counts the number of partitions of k into exactly n positive parts (or, alternatively, into any number of parts the largest of which has size n).
You can still ask an expert for help

Want to know more about Discrete math?

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

fongama33
Answered 2022-05-25 Author has 13 answers
Step 1
Hints for decomposing the collection of partitions into two groups:
Using the first interpretation: Given a partition of k into exactly n positive parts, there are two cases.
Case 1: Each part has size 2.
Case 2: There is at least one part of size 1.
Step 2
Using the second interpretation: Given a partition of k into positive parts, the largest of which has size n, there are two cases.
Case 1: There at least two parts of size n.
Case 2: There is exactly one part of size n.
Not exactly what you’re looking for?
Ask My Question

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Relevant Questions

asked 2021-08-18
Discrete Mathematics Basics
1) Determine whether the relation R on the set of all Web pages is reflexive, symmetric, antisymmetric, and/or transitive, where (a,b)R if and only if
I) everyone who has visited Web page a has also visited Web page b.
II) there are no common links found on both Web page a and Web page b.
III) there is at least one common link on Web page a and Web page b.
asked 2021-08-02
Suppose that A is the set of sophomores at your school and B is the set of students in discrete mathematics at your school. Express each of these sets in terms of A and B.
a) the set of sophomores taking discrete mathematics in your school
b) the set of sophomores at your school who are not taking discrete mathematics
c) the set of students at your school who either are sophomores or are taking discrete mathematics
Use these symbols:
asked 2020-11-09
Use proof by Contradiction to prove that the sum of an irrational number and a rational number is irrational.
asked 2021-07-28

Let A, B, and C be sets. Show that (AB)C=(AC)(BC)
image

asked 2022-05-20
A particular solution for the diffirencial equation: ( x + i ) y + y = 2 x arctan x
the original equation was: ( x + i ) y + y = 1 + 2 x arctan ( x )
I solved for ( x + i ) y + y = 0
then ( x + i ) y + y = 1 now I'm working on the second term ( 2 x arctan ( x ))
asked 2022-06-13
Showing that a relation is an equivalence relation
Let N and n R × R be defined by: x n y d f x n y n = n x n y. Show that n is an equivalence relation.
And here is my take on it (I apologize in advance for any notation mistakes, I'm still not quite good at it.):
Proof Reflexivity: Let x R and n N ; to show: x n x
x n x d f x n x n = n x n x 0 = 0 n is reflexive
Proof Symmetry: Let x R and n N ; to show: x n y y n x
x n y d f x n y n = n x n y y n x ( x n y n ) = n x + n y y x
So, the assumption made is wrong, that is, the relation is not symmetric, and therefore not an equivalence relation.
However, I'm unsure whether my proof is valid or not, as the wording of the question, and the following question, that requires ~ to be an equivalence relation, makes me believe it is in fact an equivalence relation.
asked 2021-08-01
Discrete mathematics cardinality using Richard Hammacks

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question