@mods,

This is not geometry. This is algebra.

Attachment 24176

What does this mean? What are indices?Quote:

Then there exist k indices j such that...

Printable View

- Jun 27th 2012, 10:36 AMcosmonavtNon Degenerate Triangles
@mods,

This is not geometry. This is algebra.

Attachment 24176

Quote:

Then there exist k indices j such that...

- Jun 27th 2012, 11:32 AMrichard1234Re: Non Degenerate Triangles
Indices = plural of index.

In this case, an "index" is the set . For example, and are considered to be indices. The question is essentially asking, what is the largest possible k such that the statement is always true, that you can form k non-degenerate triangles with side lengths for some j. - Jun 27th 2012, 01:48 PMHallsofIvyRe: Non Degenerate Triangles
More commonly, in the United States, called "subscripts".

- Jun 27th 2012, 02:36 PMrichard1234Re: Non Degenerate Triangles
Another example of a problem using the word "indices":

2010 USAMO Problems/Problem 3 - AoPSWiki - Jun 28th 2012, 07:11 AMcosmonavtRe: Non Degenerate Triangles
Thanks guys! Got it! I am a hobbyist programmer. I knew it has something to do with an "array" or a "set" in mathematics. But thanks for the explanation.

- Jun 28th 2012, 10:58 AMcosmonavtRe: Non Degenerate Triangles
OK so since this is an IMO problem, the solution needs explanation too! :P

Let's get started.

Attachment 24184

1. Now the first part underlined in**red**, I have no idea. How come does he assume that k is 1?

2. The second part in**red**, why does he need to prove that they are always the sides of a triangle? And why only for index 2009? Why not for others?

3. The first part in**black**- I know that we can assume this without losing generality, but again, why only 2009? Why not others? Is that because k is 1?

4. The second part in**black**, shows that 2009 is non-degenerate right?

5. The first part in blue. Is he assigning arbitrary variables to members of the set with index 2009? Why?

6. To the parts in**green**, I have no idea. - Jun 28th 2012, 11:43 AMrichard1234Re: Non Degenerate Triangles
- Jun 28th 2012, 11:53 AMrichard1234Re: Non Degenerate Triangles
Sorry, didn't see 1. through 5.

1. The author's claiming that the maximal k is 1.

2. , , and are the*longest*black, white, red sides, but there is no indication that they are of the same triangle.

3. No. Once you fix an assumption on the ordering, you shouldn't make any other assumptions. It's a little difficult to explain, but I can show you other USAMO/IMO-type problems where you can only make one "WLOG" assumption.

4. Yes.

5. He is basically constructing an arbitrary triangle with . - Jun 29th 2012, 09:33 PMcosmonavtRe: Non Degenerate Triangles
What is the basis of this assumption?

Quote:

2. , , and are the*longest*black, white, red sides, but there is no indication that they are of the same triangle.

Quote:

3. No. Once you fix an assumption on the ordering, you shouldn't make any other assumptions. It's a little difficult to explain, but I can show you other USAMO/IMO-type problems where you can only make one "WLOG" assumption.

Quote:

5. He is basically constructing an arbitrary triangle with .

- Jun 29th 2012, 10:16 PMcosmonavtRe: Non Degenerate Triangles
I was meaning to ask...

Just like in this problem you mentioned, the solution requires first making a random assumption and then going onto proof it (instead of approaching the assumption from a definite pathway.

He assumes that (2i - 1) * (2i) ≤ (2i -1) + (2i) and then goes on to prove it.

Do these assumptions come from that so called "mental database" of yours? Or is this just the cherry picked part of the solution (and the real solution process consisted of numerous other assumptions by trial and error)? - Jun 29th 2012, 11:00 PMrichard1234Re: Non Degenerate Triangles
- Jun 30th 2012, 12:07 AMcosmonavtRe: Non Degenerate Triangles
Yeah but how exactly do you make a claim in the first place? How do you know it WILL be true? Is that because your mental database contains similar problems?

And also clear my queries in the post #9 - Jun 30th 2012, 09:08 AMrichard1234Re: Non Degenerate Triangles
If it's an IMO problem, you or the author probably would have spent considerable time on this (an hour, maybe two hours). The author has already proven that k=1 using the techniques he is about to describe. Remember, it's just like writing a persuasive paper -- introduce your original claim, and support it with evidence (in this case, proof).

- Jun 30th 2012, 09:26 AMrichard1234Re: Non Degenerate Triangles