Math Proof Homework: Proving a_1 + a_2 + ... + a_K > K

Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
5 replies · 4K views
ritwik06
Messages
577
Reaction score
0

Homework Statement


The thing is that there is a question which needs me to prove something. I have done it already but the thing that troubles me is that it wants me to prove this:

[tex]a_{1}+a_{2}+a_{3}+....a_{K}>K[/tex]
[tex]a_{i}[/tex] is a positive integer.
I know this is always true. but how should I prove it mathematically?
 
Last edited:
Physics news on Phys.org
ritwik06 said:

Homework Statement


The thing is that there is a question which needs me to prove something. I have done it already but the thing that troubles me is that it wants me to prove this:

[tex]a_{1}+a_{2}+a_{3}+....a_{K}>K[/tex]
[tex]a_{i}[/tex] is a positive integer.
I know this is always true. but how should I prove it mathematically?
I see two ways to proceed:

(1) Attempt to precisely elaborate why you know it's true. Then translate those precise reasons into logical implications

(2) Try to prove it for special cases of your own choosing. Then, see if you can generalize your proof to the general case.
 
ritwik06 said:

Homework Statement


The thing is that there is a question which needs me to prove something. I have done it already but the thing that troubles me is that it wants me to prove this:

[tex]a_{1}+a_{2}+a_{3}+....a_{K}>K[/tex]
[tex]a_{i}[/tex] is a positive integer.
I know this is always true. but how should I prove it mathematically?

that's not true always .

example :

take [tex]a_i=1[/tex] , for all [tex]i[/tex].

So , we get [tex]\overbrace{1+1+\cdots+1}^K =K \not > K[/tex]
 
HallsofIvy said:
I presume you mean [itex]a_1+ a_2+ \cdot\cdot\cdot+ a_K\ge K[/itex] where the an are positive integers.

Looks like a good candidate for "proof by induction".

why proof by induction? The way I was thinking of it is like this:
Rewriting each [tex]a_i[/tex] as [tex]1+c_i[/tex], we have
[tex](1+c_1)+(1+c_2)+\cdots+(1+c_K)=K+c_1+c_2+\cdots+c_K=K+C \geq K[/tex]​
 
This seems self-evident? The lowest positive integer is 1. If you have n numbers, all being positive, the sum cannot be smaller than n.

k