For a fixed positive integer n consider the equation

[TobiWan]

 

[stapel]

I'm sorry, but your images are way too small to be legible. Kindly please reply with the typed-out text of the exercise, along with a clear listing of your thoughts and efforts so far. Thank you!

 

[TobiWan]

don't know how to start

 

[stapel]

don't know how to start

Your images seem a bit confused. If you'd typed out the exercise as requested, I think we'd have seen the following:

---

10. For a fixed positive integer n consider the equation:

. . . . .x₁ + 2x₂ + ... + nx_n = n

in which x₁, ..., x_n can take nonnegative integer values. Show that there are as many solutions (x₁, ..., x_n) satisfying

. . .1. for each k =1, ..., n - 1 either x_k > 0 or x_k+1 = 0,

as there are solutions (x₁, ..., x_n) satisfying

. . .2. for each k = 1, ..., n either x_k = 0 or x_k = 1.

---

Is the above correct? If not, please reply with corrections. If so, please reply with your area and level of study, as well as topics recently covered in class, as this will help guide us toward your instructor's probable expected solution method.

Please be complete. Thank you!

 

[TobiWan]

it's irrelevant, because we don't do probems like this in school. I am just curious how to solve it. The methods of solutions are also irrelevant.

 

[Otis]

it's irrelevant ...

What is irrelevant?

Is it the question that asks you to confirm whether the incomplete submission has been correctly interpreted?

 

[HallsofIvy]

What TobiWan is telling us is that it is a waste of time to respond to his posts.