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

Click For Summary

Discussion Overview

The discussion revolves around the mathematical proof of the inequality a_{1}+a_{2}+...+a_{K} > K, where each a_{i} is a positive integer. Participants explore various approaches to proving this statement, including specific cases and general reasoning.

Discussion Character

  • Homework-related
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant asserts that the inequality is always true but seeks a mathematical proof.
  • Another participant suggests two approaches: elaborating on the reasoning behind the belief in the inequality or proving it for special cases and generalizing from there.
  • A different participant challenges the assertion by providing a counterexample where a_{i} = 1 for all i, leading to the conclusion that the sum equals K, which does not satisfy the inequality.
  • Some participants propose that the correct form of the inequality might be a_{1}+a_{2}+...+a_{K} ≥ K, indicating a potential misunderstanding of the original statement.
  • One participant suggests that the problem is suitable for proof by induction.
  • Another participant supports the idea of proof by induction and provides a reasoning approach involving rewriting each a_{i} as 1 + c_{i} to demonstrate the inequality.
  • One participant expresses that the inequality seems self-evident, arguing that the sum of positive integers cannot be smaller than the count of those integers.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the validity of the original inequality. There are competing views regarding its truth, with some asserting it is always true while others provide counterexamples. The discussion remains unresolved.

Contextual Notes

There are limitations in the assumptions made about the inequality, particularly regarding the interpretation of the statement and the conditions under which it holds. The discussion also reflects uncertainty about the correct formulation of the inequality.

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]
 
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".
 
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
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
Replies
4
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 31 ·
2
Replies
31
Views
3K
Replies
8
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 15 ·
Replies
15
Views
5K
  • · Replies 4 ·
Replies
4
Views
2K