Search results

Jump to navigation Jump to search

Page title matches

Page text matches

  • #REDIRECT[[Fundamental Theorem of Algebra]]
    43 bytes (5 words) - 21:01, 21 May 2007
  • | pagename = Fundamental Theorem of Algebra | abc = Fundamental Theorem of Algebra
    802 bytes (78 words) - 08:33, 15 March 2024
  • * [[Fundamental theorem of algebra]] {{r|Fundamental Theorem of Algebra}}
    2 KB (247 words) - 06:00, 7 November 2010
  • {{r|Fundamental Theorem of Algebra}}
    2 KB (206 words) - 19:38, 11 January 2010
  • {{r|Fundamental Theorem of Algebra}}
    276 bytes (34 words) - 10:41, 21 April 2010
  • The '''Fundamental Theorem of Algebra''' is a mathematical theorem stating that every nonconstant [[polynomial]] One important case of the Fundamental Theorem of Algebra is that every nonconstant polynomial with [[Real number|real]] coefficients
    5 KB (924 words) - 16:35, 11 December 2008
  • ...r Theorem" (due to the latter being mentioned in a title). In the case of "fundamental theorem of algebra", there's no competition: lowercase outnumbers uppercase 10 to 1.'
    3 KB (475 words) - 09:12, 10 September 2007
  • ...as finitely many [[solution (equation)|solution]]s, a consequence of the [[fundamental theorem of algebra]]. This is not true for other types of equations. For instance, == The fundamental theorem of algebra ==
    4 KB (647 words) - 16:35, 22 December 2008
  • {{r|Fundamental Theorem of Algebra}}
    444 bytes (57 words) - 17:15, 11 January 2010
  • Auto-populated based on [[Special:WhatLinksHere/Fundamental Theorem of Algebra]]. Needs checking by a human.
    493 bytes (64 words) - 16:43, 11 January 2010
  • {{r|Fundamental Theorem of Algebra}}
    544 bytes (70 words) - 18:34, 11 January 2010
  • {{r|Fundamental Theorem of Algebra}}
    991 bytes (124 words) - 17:15, 11 January 2010
  • ...mber]] [[coefficient]]s has at most three real roots, as dictated by the [[fundamental theorem of algebra]]. [[solution (equation)|Solving]] cubic equations is more difficult than
    3 KB (483 words) - 23:24, 17 December 2008
  • <!-- This property can be used for an elegant proof of the [[fundamental theorem of algebra]]. !-->
    6 KB (827 words) - 14:44, 19 December 2008
  • This polynomial has no roots in Q. However, from the [[fundamental theorem of algebra]] we know that it has exacly two roots in C, and can be written as the prod ...r_0 , r_1</math> such that <math>x^2-5 = (x-r_0)(x-r_1)</math>. By the [[fundamental theorem of algebra]] this is always possible - there exists a subfield L of C such that <math>
    9 KB (1,510 words) - 21:04, 15 January 2009
  • The [[Fundamental Theorem of Algebra]] tells us that we should expect there to be two roots for a second-degree ...own in Figure 3. In this case the roots still exist, as guaranteed by the fundamental theorem of algebra, but they are complex so cannot be shown on the real number line.
    8 KB (1,360 words) - 16:44, 17 December 2008
  • ...be in the [[complex number]] article, but I felt an entire article on the fundamental theorem of algebra would be the better place for it. However all I did was cut and paste from
    2 KB (321 words) - 11:26, 15 March 2008
  • This polynomial has no roots in Q. However, from the [[fundamental theorem of algebra]] we know that it has exacly two roots in C, and can be written as the prod
    4 KB (683 words) - 22:17, 7 February 2010
  • *[[Fundamental Theorem of Algebra]]
    3 KB (400 words) - 03:55, 22 November 2023
  • ...is algebraically closed (such as the field of complex numbers) then the [[fundamental theorem of algebra]] states that the secular equation has exactly ''n'' roots (zeros) &lambda;
    12 KB (1,903 words) - 10:57, 2 February 2009
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)