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

AI Thread Summary
The discussion centers on proving the inequality a_{1} + a_{2} + ... + a_{K} > K, where each a_{i} is a positive integer. Participants suggest two approaches: elaborating on the reasons for its truth or proving it through specific cases before generalizing. However, one contributor points out that the inequality is not always true by providing a counterexample where all a_{i} equal 1, resulting in equality rather than a strict inequality. Another participant proposes using proof by induction, while another suggests rewriting the terms to demonstrate that the sum of positive integers cannot be less than K. The conversation emphasizes the need for careful consideration of the conditions under which the inequality holds.
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:

a_{1}+a_{2}+a_{3}+....a_{K}>K
a_{i} 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:

a_{1}+a_{2}+a_{3}+....a_{K}>K
a_{i} 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:

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

that's not true always .

example :

take a_i=1 , for all i.

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

Looks like a good candidate for "proof by induction".
 
HallsofIvy said:
I presume you mean a_1+ a_2+ \cdot\cdot\cdot+ a_K\ge K 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 a_i as 1+c_i, we have
(1+c_1)+(1+c_2)+\cdots+(1+c_K)=K+c_1+c_2+\cdots+c_K=K+C \geq K​
 
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
 
Back
Top