by NickR » Wed Mar 14, 2007 10:49 pm
For the first one you use Descartes' rule of signs:
First, find possible number of positive(real) roots...
[unparseable or potentially dangerous latex formula]
Now, look and count the number of sign changes...which we determine to be 2.
As per the rule, this means that the number of positive, real roots could either be [unparseable or potentially dangerous latex formula] or [unparseable or potentially dangerous latex formula].
Now, let's find the possible number of negative(real) roots and we find this by using [unparseable or potentially dangerous latex formula] instead of [unparseable or potentially dangerous latex formula] in our function/polynomial.
[unparseable or potentially dangerous latex formula] [unparseable or potentially dangerous latex formula]
Counting the number of sign changes yields us 2 again. So that means we can either have be [unparseable or potentially dangerous latex formula] or [unparseable or potentially dangerous latex formula] negative, real roots.
Since the problem wants the least number of non real zeros or roots, that means we want to maximize the number of real roots. Thus, the max number of real roots is [unparseable or potentially dangerous latex formula] and that leaves us with [unparseable or potentially dangerous latex formula] non real roots.
Now, for the second one:
*edited*
The way we can do this problem is with permutations. There are [unparseable or potentially dangerous latex formula] ways to choose the consonants since there are 4 possible choices and you only need 3. Next, there are [unparseable or potentially dangerous latex formula] ways to choose the vowels since there are 5 possible choices and you only need 2. Thus, the total is [unparseable or potentially dangerous latex formula]
Last edited by
NickR on Wed Mar 14, 2007 11:18 pm, edited 4 times in total.