- #1
joypav
- 151
- 0
Okay, so I need to prove this. I thought I would be using induction, right?
First we can consider the base case, which is simple.
Next we have to do the induction step.
I think we consider one case where each a=1. Then we have 1<=1.
Then consider that they are not all 1. I can't remember what trick to use. Is it that there must exist at least one a such that a<1? Because if they're all larger than 1 then the sum can't be n. And then there must also exist an a>1? Because if they're all less than 1 then the sum can't be n.