Search results

Page title matches

  • ...ems can be solved by building right triangles and applying the Pythagorean Theorem. .../www.cut-the-knot.org/pythagoras/index.shtml 122 proofs of the Pythagorean Theorem]
    6 KB (943 words) - 09:44, 17 January 2025
  • In [[number theory]], '''Wilson's Theorem''' states that if [[integer ]]<math>p > 1</math> , then <math>(p-1)! + 1</m ...der the [[field]] of integers modulo <math>p</math>. By [[Fermat's Little Theorem]], every nonzero element of this field is a root of the [[polynomial]]
    4 KB (639 words) - 00:53, 2 February 2023
  • #REDIRECT[[Ceva's theorem]]
    27 bytes (3 words) - 15:06, 9 May 2021
  • '''Menelaus' theorem''' deals with the [[collinearity]] of points on each of the three sides (ex Alternatively, when written with [[directed segment|directed segments]], the theorem becomes <math>BP\cdot CQ\cdot AR = CP\cdot QA\cdot RB</math>.
    5 KB (804 words) - 02:01, 12 June 2023
  • ...y level if they have a hard time following the rest of this article). This theorem is credited to [[Pierre de Fermat]]. ...{p}</math>. As you can see, it is derived by multipling both sides of the theorem by <math>a</math>. The restated form is nice because we no longer need to
    16 KB (2,660 words) - 22:42, 28 August 2024
  • '''Euler's Totient Theorem''' is a theorem closely related to his [[totient function]]. == Theorem ==
    4 KB (569 words) - 21:34, 30 December 2024
  • #REDIRECT[[Ptolemy's theorem]]
    30 bytes (3 words) - 16:37, 9 May 2021
  • ...quality condition | equality case]] of [[Ptolemy's Inequality]]. Ptolemy's theorem frequently shows up as an intermediate step in problems involving inscribed We provide a proof for the general case of Ptolemy's theorem, Ptolemy's Inequality.
    6 KB (922 words) - 16:34, 13 January 2025
  • #REDIRECT[[Menelaus' theorem]]
    30 bytes (3 words) - 15:20, 9 May 2021
  • 28 bytes (3 words) - 18:01, 9 May 2021
  • #REDIRECT[[Stewart's theorem]]
    30 bytes (3 words) - 15:22, 9 May 2021
  • The '''Binomial Theorem''' states that for [[real]] or [[complex]] <math>a</math>, <math>b</math>, ...a straightforward application of [[mathematical induction]]. The Binomial Theorem also has a nice combinatorial proof:
    5 KB (935 words) - 12:11, 20 February 2024
  • The '''Fundamental Theorem of Calculus''' establishes a link between the two central operations of [[c ...em of Calculus. The last question corresponds to the "second" Fundamental Theorem of Calculus.)
    11 KB (2,082 words) - 14:23, 2 January 2022
  • ...hat <math> \frac cb = \frac mn </math>. Likewise, the [[converse]] of this theorem holds as well. Further by combining with [[Stewart's theorem]] it can be shown that <math>AD^2 = b\cdot c - m \cdot n</math>
    3 KB (438 words) - 12:17, 30 November 2024
  • #REDIRECT [[Pythagorean Theorem]]
    33 bytes (3 words) - 11:09, 22 June 2006
  • #REDIRECT [[Binomial Theorem]]
    30 bytes (3 words) - 11:52, 22 June 2006
  • '''Fermat's Last Theorem''' is a recently proven [[theorem]] stating that for positive [[integers]] <math>a,b,c,n</math> with <math>n Fermat's Last Theorem was proposed by [[Pierre de Fermat]] in the <math>1600s</math> in the margi
    3 KB (453 words) - 10:13, 9 June 2023
  • The '''Power of a Point Theorem''' is a relationship that holds between the lengths of the [[line segment]] == Theorem ==
    5 KB (859 words) - 15:11, 8 December 2024
  • ...[coefficient]]s has a complex [[root]]. In fact, every known proof of this theorem involves some [[analysis]], since the result depends on certain properties === Proof by Liouville's Theorem ===
    5 KB (832 words) - 13:22, 11 January 2024
  • The '''Prime Number Theorem''' (PNT) is one of the most the exception of [[Fermat's Last Theorem]]. (Fortunately, the proof
    11 KB (1,749 words) - 21:52, 10 January 2025

Page text matches

  • ...ems can be solved by building right triangles and applying the Pythagorean Theorem. .../www.cut-the-knot.org/pythagoras/index.shtml 122 proofs of the Pythagorean Theorem]
    6 KB (943 words) - 09:44, 17 January 2025
  • ...math>r-3,r-1</math> and [[hypotenuse]] <math>r+1</math>. The [[Pythagorean Theorem]] yields:
    2 KB (307 words) - 23:58, 17 November 2024
  • ...n.artofproblemsolving.com/resources/articles/crt.pdf The Chinese Remainder Theorem] by Evan Chen
    17 KB (2,291 words) - 22:33, 13 January 2025
  • In [[number theory]], '''Wilson's Theorem''' states that if [[integer ]]<math>p > 1</math> , then <math>(p-1)! + 1</m ...der the [[field]] of integers modulo <math>p</math>. By [[Fermat's Little Theorem]], every nonzero element of this field is a root of the [[polynomial]]
    4 KB (639 words) - 00:53, 2 February 2023
  • == Theorem ==
    5 KB (783 words) - 17:58, 1 January 2025
  • ====The Fundamental Theorem of Algebra==== The [[Fundamental Theorem of Algebra]] states that any polynomial with [[complex number|complex]] coe
    6 KB (1,100 words) - 14:57, 30 August 2024
  • * [[Binomial theorem]] * [[Factor Theorem]]
    3 KB (532 words) - 21:00, 13 January 2024
  • * [[Rolle's Theorem]] * [[Squeeze Theorem]]
    2 KB (299 words) - 18:47, 30 June 2024
  • === Example 1: Rational Approximation Theorem === ...uch that <math>\{ qx \}</math> lies in <math>[0, 1/n)</math>, which is the theorem. We may assemble this into a formal proof:
    11 KB (1,986 words) - 18:13, 19 June 2024
  • ...st common multiple]] is their product. This pops up in [[Chinese Remainder Theorem]]. * [[Chicken McNugget Theorem]]
    2 KB (245 words) - 17:45, 14 October 2024
  • <math>\lfloor\theta^{3^n}\rfloor</math> is the prime number theorem where <math>n</math> can be any number and <math>\theta</math> is an elemen
    794 bytes (105 words) - 00:59, 15 January 2022
  • ...ny proofs is by first inserting <math>a = b = 1</math> into the [[binomial theorem]]. Because the combinations are the coefficients of <math>2^n</math>, and a
    4 KB (638 words) - 20:55, 5 January 2025
  • #REDIRECT[[Ceva's theorem]]
    27 bytes (3 words) - 15:06, 9 May 2021
  • '''Menelaus' theorem''' deals with the [[collinearity]] of points on each of the three sides (ex Alternatively, when written with [[directed segment|directed segments]], the theorem becomes <math>BP\cdot CQ\cdot AR = CP\cdot QA\cdot RB</math>.
    5 KB (804 words) - 02:01, 12 June 2023
  • ...some theorems concerning integer manipulation (like the [[Chicken McNugget Theorem ]]) are sometimes considered number theory. * [[Fermat's Last Theorem]]
    3 KB (404 words) - 19:56, 28 December 2024
  • *** [[Chinese Remainder Theorem]] ** [[Euler's Totient Theorem]]
    734 bytes (79 words) - 17:27, 25 April 2008
  • *** [[Chinese Remainder Theorem]] ** [[Euler's Totient Theorem]]
    1,015 bytes (104 words) - 16:21, 1 September 2024
  • ...y level if they have a hard time following the rest of this article). This theorem is credited to [[Pierre de Fermat]]. ...{p}</math>. As you can see, it is derived by multipling both sides of the theorem by <math>a</math>. The restated form is nice because we no longer need to
    16 KB (2,660 words) - 22:42, 28 August 2024
  • '''Euler's Totient Theorem''' is a theorem closely related to his [[totient function]]. == Theorem ==
    4 KB (569 words) - 21:34, 30 December 2024
  • ...agorean Inequality is a generalization of the [[Pythagorean Theorem]]. The Theorem states that in a [[right triangle]] with sides of length <math>a \leq b \le ...oving that <math>EF\ge FN+EM</math> but this is obvious by the Pythagorean Theorem. <math>\blacksquare</math>
    7 KB (1,300 words) - 00:11, 28 October 2024

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)