Here is one I came up myself. It is a proof.

Prove that has a unique positive solution in real number for represented by .

Please make in invisible letters.

Printable View

- Feb 8th 2006, 08:09 PMThePerfectHackerSquare Root Canal
Here is one I came up myself. It is a proof.

Prove that has a unique positive solution in real number for represented by .

Please make in invisible letters. - Feb 16th 2006, 07:43 AMTD!
Rather than only for the square root, you could prove this for .

A sketch of a possible proof: you use the completeness of the real numbers (axiom), i.e. you use the fact that every bounded set has a supremum (and, as follows, an infimum). You can then "sandwhich" and from which follows that . You prove the uniqueness by contradiction, pick two and show they have to be the same. - Feb 16th 2006, 01:37 PMThePerfectHackerQuote:

Originally Posted by**TD!**

- Feb 16th 2006, 02:16 PMTD!
There is no "the proof", unless you're referring to "your proof", it should be "a proof" ;)

- Mar 3rd 2006, 06:42 AMRich B.Elementary my dear Watson...quite.
Hi:

x^2 = n is equivalent to x^2 - n = 0. According to the Fundamental Theorem of Algebra, this polynomial has exactly two solutions. We know two solutions, both real and of opposite algebraic sign. Hence there is exactly one solution in R+. Whip the aforesaid into a rigorous proof and you're there.

Regards,

Rich B. - Mar 3rd 2006, 09:48 AMThePerfectHackerQuote:

Originally Posted by**Rich B.**

- Mar 3rd 2006, 04:39 PMRich B.
Greetings PHckr:

Okay, you can do that. But I did it without this theorem. Further, you made one mistake it has AT MOST two solutions and AT LEAST one, that is the fundamental theorem.

I am perplexed by the first two sentences noted above in blue print. I used one theorem, you used another (MVT). The FTA simplifies the proof with a single stroke of logic. Of course, such statement is meaningless should the remaining print in blue indeed be true. As it were, however, the fundamental theorem of algebra guarantees the existence of exactly n-complex roots for every polynomial of degree, n, having real coefficients. I believe it was Gauss (perhaps Euler --my memory for detail, sadly, varies inversely with age) who first conjectured existence of solutions numbering between one and n (this may be what you had in mind). However, the MVT,*established*more recently, asserts exactly n. Finally, as I state in my initial dialogue, yes, the*plan*suggested herein need only be formalized as a proof of, perhaps, three or so lines of text.

BTW, as an alternative to invoking the FTA,*Descartes Rule of Signs*affirms the singular positive root as well. What's more, such approach obviates any obligation to incorporate solutions into the formal proof.

Regards,

Rich B. - Mar 4th 2006, 12:15 AMCaptainBlackQuote:

Originally Posted by**ThePerfectHacker**

polynomial equation of degree n greater than or equal to 1, with complex

coefficients, has a root in the complex plane.

Then a simple corollary shows that it has exactly n roots (counting multiplicity). in the complex plane.

RonL - Mar 4th 2006, 04:18 PMThePerfectHackerQuote:

Originally Posted by**CaptainBlack**

- Mar 4th 2006, 04:21 PMThePerfectHackerQuote:

Originally Posted by**Rich B.**

- Mar 5th 2006, 04:52 AMtopsquarkQuote:

Originally Posted by**ThePerfectHacker**

-Dan - Mar 5th 2006, 06:49 AMCaptainBlackQuote:

Originally Posted by**topsquark**

must also be a root giving three all told :p

RonL