3. Partitions into powers of 2 If n is a positive integer, let e(n) be the number of partitions of n into powers of 2 with an even number of terms, and let o(n) be the number of partitions of n into powers of 2 with an odd number of terms. Prove that e(n) = o(n) for n >= 2.
Added by Thomas R.
Step 1
This means that the partition can be written as a sum of distinct powers of 2, where each power of 2 can appear at most twice. Show more…
Show all steps
Close
Your feedback will help us improve your experience
Krishna G and 97 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove that the number of partitions of the positive integer n into parts each of which is at most 2 equals ⌊ n/2 ⌋ + 1. (Remark: There is a formula, namely the nearest integer to (n+3)^2/12, for the number of partitions of n into parts each of which is at most 3 but it is much more difficult to prove. There is also one for partitions with no part more than 4, but it is even more complicated and difficult to prove.)
Krishna G.
For all integers n > 2, show that the number of integer partitions of n in which each part is greater than one is given by p(n)-p(n-1), where p(n) is the number of integer partitions of n.
Sri K.
Prove that the number of partitions of the positive integer $n$ into parts each of which is at most 2 equals $\lfloor n / 2\rfloor+1$. (Remark: There is a formula, namely the nearest integer to $\frac{(n+3)^{2}}{12}$, for the number of partitions of $n$ into parts each of which is at most 3 but it is much more difficult to prove. There is also one for partitions with no part more than 4 , but it is even more complicated and difficult to prove.)
Kevin H.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD