Question

roblem: Report Error A partition of a positive integer $n$ is any way of writing $n$ as a sum of one or more positive integers, in which we don't care about the order of the numbers in the sum. For example, the number 4 can be written as a sum of one or more positive integers (where we don't care about the order of the numbers in the sum) in exactly five ways: \[4,\; 3 + 1,\; 2 + 2,\; 2 + 1 + 1,\; 1 + 1 + 1 + 1.\] So 4 has five partitions. What is the number of partitions of the number 7?

Answer 1

Answer:

There are 15 partitions of 7.

Step-by-step explanation:

We are given that a partition of a positive integer $n$ is any way of writing $n$ as a sum of one or more positive integers, in which we don't care about the numbers in the sum .

We have to find the partition of 7

We are given an example

Partition of 4

4=4

4=3+1

4=2+2

4=1+2+1

4=1+1+1+1

There are five partition of 4

In similar way  we are finding  partition of 7

7=7

7=6+1

7=5+2

7=5+1+1

7=3+3+1

7=3+4

7=4+2+1

7=3+2+2

7=4+1+1+1

7=3+1+1+1+1

7=2+2+2+1

7=3+2+1+1

7=2+2+1+1+1

7=2+1+1+1+1+1

7=1+1+1+1+1+1+1

Hence, there are 15 partitions of 7.