[quote=R.D. Silverman;219758]I will also add:

You wrote "The number of terms for P is equivallent to x^k's.
To open F(P)+F(P-1)+...+F(1)?"

The first sentence is total gibberish. What does "equivalent to x^k's"
mean? It is nonsense.

And what does the word "open" mean?? And "To open F(P)+F(P-1)+...+F(1)?" is not even a sentence.[/quote]
This is another horrible mistake.

[QUOTE=blob100;219760]This is another horrible mistake.[/QUOTE]

Proofread before you post!

[quote=R.D. Silverman;219763]Proofread before you post![/quote]
OK.

I'll try again writing the formula:
The number of terms taken from x^k's coefficient is:
F(P)+F(P-1)+...+1.
Where P=n-k.
F(N)=N(N+1)/2, for any given natural N.


BTW: by "open" I meant, to show F(P)+F(P-1)+...+1 as a phrase concerning P's value (not a sum of functions).

[QUOTE=blob100;219765]I'll try again writing the formula:
The number of terms taken from x^k's coefficient is:
F(P)+F(P-1)+...+1.
Where P=n-k.
F(N)=N(N+1)/2, for any given natural N.

[/QUOTE]

To the other readers of this thread:

What am I doing wrong? Am I not getting through? I [b]already[/b]
said that this formula is wrong, explained [b]why[/b] it could not be correct,
and gave a strong hint to the correct answer.

Yet Tomer insists on repeating the same stuff. Just as he kept
using the answer from THIS problem in problem 1 when I told him
not to do so.

[quote=R.D. Silverman;219766]To the other readers of this thread:

What am I doing wrong? Am I not getting through? I [B]already[/B]
said that this formula is wrong, explained [B]why[/B] it could not be correct,
and gave a strong hint to the correct answer.

Yet Tomer insists on repeating the same stuff. Just as he kept
using the answer from THIS problem in problem 1 when I told him
not to do so.[/quote]

I just touhgt you didn't understand what I formulated.

"I will give a hint: The number of different products of roots taken r
at a time from a set of size n is a well known COMBINATORIAL object. "

What you mean is that there is a well known formula for this question?

The formula that gives the [B]number of combinations[/B] of n things taken k at a time, [SUB]n[/SUB][B]C[/B][SUB]k[/SUB], is well known.

It, also, is not difficult to derive.

Perhaps it would be useful for you to back up and go through the exercise of providing a formal proof of that formula.

While you are at it, you might learn to use simple formatting in your postings to display exponents and subscripts. Using them will make it easier to read your equations.

[QUOTE=blob100;219769]"I will give a hint: The number of different products of roots taken r
at a time from a set of size n is a well known COMBINATORIAL object. "

What you mean is that there is a well known formula for this question?[/QUOTE]

It sounds like you are not familiar with the combination formula. Try this link: [url]http://mathworld.wolfram.com/Combination.html[/url]. While you're at it, look up some of the following terms: "binomial coefficient", "binomial theorem" and "Pascal's Triangle".

After you've had a chance to think about this information, see if you can apply it to this problem.

[QUOTE=R.D. Silverman;219766]To the other readers of this thread:

What am I doing wrong? Am I not getting through? I [b]already[/b]
said that this formula is wrong, explained [b]why[/b] it could not be correct,
and gave a strong hint to the correct answer.

Yet Tomer insists on repeating the same stuff. Just as he kept
using the answer from THIS problem in problem 1 when I told him
not to do so.[/QUOTE]

Yes, it's true that he's doing these things. But he is lacking some specific knowledge that he needs in order to understand your hints. Without that knowledge, which he doesn't know he lacks, he can't do what you're asking so he flails about.

The solution isn't to yell at him; that hasn't been particularly successful so far. It's to direct him to the specific information that will help. This I have done.

(And FWIW, I agree: there's a question of basic mathematical maturity here. Tomer should have been exposed to the combination formula long ago or, put another way, given that he [I]hasn't[/I] been so exposed it would seem that he is not ready for some of the more advanced topics to which he aspires. He needs time and instruction to gain that maturity.)

[QUOTE=jyb;219775]Yes, it's true that he's doing these things. But he is lacking some specific knowledge that he needs in order to understand your hints. Without that knowledge, which he doesn't know he lacks, he can't do what you're asking so he flails about.

The solution isn't to yell at him; that hasn't been particularly successful so far. It's to direct him to the specific information that will help. This I have done.

(And FWIW, I agree: there's a question of basic mathematical maturity here. Tomer should have been exposed to the combination formula long ago or, put another way, given that he [I]hasn't[/I] been so exposed it would seem that he is not ready for some of the more advanced topics to which he aspires. He needs time and instruction to gain that maturity.)[/QUOTE]

He had stated earlier that he was familiar with the binomial theorem........