Search results

Page title matches

  • #REDIRECT [[Brahmagupta's Formula]]
    35 bytes (3 words) - 12:55, 22 December 2007
  • ...Formula''' (sometimes called Hero's formula) is a [[mathematical formula | formula]] for finding the [[area]] of a [[triangle]] given only the three side leng ...b}, {c}</math>, the area <math>{A}</math> can be found using the following formula:
    5 KB (783 words) - 17:58, 1 January 2025
  • The '''quadratic formula''' is a general [[expression]] for the [[root (polynomial)|solutions]] to a This is the quadratic formula, and we are done.
    2 KB (269 words) - 18:39, 10 December 2024
  • '''Brahmagupta's Formula''' is a [[formula]] for determining the [[area]] of a [[cyclic quadrilateral]] given only the [[Bretschneider's formula]] gives a formula for the area of a non-cyclic quadrilateral given only the side lengths; app
    3 KB (543 words) - 18:35, 29 October 2024
  • 29 bytes (3 words) - 23:31, 3 June 2022
  • * [[Euler's polyhedral formula]]
    155 bytes (19 words) - 14:45, 14 February 2007
  • #REDIRECT [[Quadratic formula]]
    31 bytes (3 words) - 01:09, 19 June 2006
  • ...t order) and [[diagonal]]s of length <math>p, q</math>. '''Bretschneider's formula''' states that the [[area]] * [[Brahmagupta's formula]]
    3 KB (566 words) - 02:51, 12 February 2021
  • Apply Euler's Polyhedral Formula on the following polyhedra:
    1,006 bytes (134 words) - 13:15, 6 March 2022
  • '''Wallis's formula''' states that Wallis's formula often works well in combination with [[trigonometric substitution]] in redu
    598 bytes (88 words) - 16:03, 12 October 2006
  • The '''distance formula''' is a direct application of the [[Pythagorean Theorem]] in the setting of
    2 KB (340 words) - 20:37, 1 August 2024
  • #REDIRECT [[Heron's Formula]]
    29 bytes (3 words) - 12:27, 7 January 2008
  • #REDIRECT [[Euler's formula]]
    29 bytes (3 words) - 14:45, 14 February 2007
  • The Lagrange Interpolation Formula states that For any distinct [[complex number]]s <math> x_0, \ldots , x_n < This formula is useful for many olympiad problems, especially since such a polynomial is
    2 KB (398 words) - 02:50, 20 November 2023
  • #REDIRECT [[Lagrange Interpolation Formula]]
    44 bytes (4 words) - 10:42, 25 March 2007
  • #REDIRECT [[Lagrange Interpolation Formula]]
    44 bytes (4 words) - 12:38, 3 March 2015
  • '''Binet's formula''' is an explicit formula used to find the <math>n</math>th term of the Fibonacci sequence. ==Formula==
    6 KB (953 words) - 20:37, 30 May 2024
  • #REDIRECT [[Euler's Polyhedral Formula]]
    40 bytes (4 words) - 12:55, 22 December 2007
  • #REDIRECT [[Heron's Formula]]
    29 bytes (3 words) - 12:55, 22 December 2007
  • #REDIRECT [[Binet's Formula]]
    29 bytes (3 words) - 22:01, 14 January 2008

Page text matches

  • This formula is also called the [[quadratic formula]].
    2 KB (422 words) - 15:20, 5 March 2023
  • ...Formula''' (sometimes called Hero's formula) is a [[mathematical formula | formula]] for finding the [[area]] of a [[triangle]] given only the three side leng ...b}, {c}</math>, the area <math>{A}</math> can be found using the following formula:
    5 KB (783 words) - 17:58, 1 January 2025
  • The '''quadratic formula''' is a general [[expression]] for the [[root (polynomial)|solutions]] to a This is the quadratic formula, and we are done.
    2 KB (269 words) - 18:39, 10 December 2024
  • ...a for the sum of a [[geometric sequence]], it's easy to derive the general formula for difference of powers: This also leads to the formula for the sum of cubes,
    3 KB (532 words) - 21:00, 13 January 2024
  • ...n strategies: [[factoring]], [[completing the square]] and the [[quadratic formula]]. === Quadratic Formula ===
    2 KB (264 words) - 11:04, 15 July 2021
  • ...]] is a combinatorial problem, as is the derivation of a non-[[recursive]] formula for the [[Fibonacci numbers]], and so too methods of solving the [[Rubik's
    1 KB (209 words) - 17:13, 27 December 2024
  • ...e of Inclusion-Exclusion''' (abbreviated PIE) provides an organized method/formula to find the number of [[element]]s in the [[union]] of a given group of [[s ...e every element is counted once and only once. In particular, memorizing a formula for PIE is a bad idea for problem solving.
    9 KB (1,703 words) - 00:20, 7 December 2024
  • == Formula ==
    4 KB (638 words) - 20:55, 5 January 2025
  • ===General formula of discriminant=== ...a polynomial of degree 3, which also makes possible to us to use Cardano's formula, by doing the substitution <math>x=z-\frac{a}{3}</math> on the polynomial <
    4 KB (768 words) - 16:56, 24 June 2024
  • '''Brahmagupta's Formula''' is a [[formula]] for determining the [[area]] of a [[cyclic quadrilateral]] given only the [[Bretschneider's formula]] gives a formula for the area of a non-cyclic quadrilateral given only the side lengths; app
    3 KB (543 words) - 18:35, 29 October 2024
  • ...circle containing <math>D.</math> Additionally, by the Inversion Distance Formula, we may express the inequality as the following:
    6 KB (922 words) - 16:34, 13 January 2025
  • * [[Brahmagupta's formula]]
    1 KB (179 words) - 18:41, 3 January 2025
  • == Formula == ...\cdots {p}_m^{e_m}</math>, one can compute <math>\phi(n)</math> using the formula <cmath>\phi(n)= n\left(1-\frac{1}{p_1} \right) \left(1-\frac{1}{p_2} \right
    5 KB (903 words) - 14:49, 27 July 2024
  • * [[Brahmagupta's formula]]
    1 KB (167 words) - 19:14, 16 January 2025
  • ...-b)(s-c)}</math>, where <math>s</math> is the [[semiperimeter]] ([[Heron's Formula]]).
    4 KB (631 words) - 20:16, 8 October 2024
  • ...reatest common divisor of more than two numbers, one can use the recursive formula <math>GCD(a_1,\dots,a_n)=GCD(GCD(a_1,\dots,a_{n-1}),a_n)</math>.
    2 KB (288 words) - 21:40, 26 January 2021
  • ...th> handshakes. Now let's try our formula for two people. According to the formula we get 2 handshakes, but wait, we will have only 1 handshake between two pe ...h = \frac{n*(n-1)}{2}</math> where h is the number of handshakes. Now our formula tally with our experiment results. (To easily solve a problem, we overcount
    4 KB (635 words) - 11:19, 2 January 2022
  • * [[Euler's polyhedral formula]]
    155 bytes (19 words) - 14:45, 14 February 2007
  • ...ating functions can be derived using the [[Geometric sequence#Infinite|sum formula for geometric series]] <cmath>\frac{1}{1-x} = \sum_{k=0}^{\infty} x^k = 1
    4 KB (659 words) - 11:54, 7 March 2022
  • * Use of recursion to compute an explicit formula: [[2006_AIME_I_Problems#Problem_13| 2006 AIME I Problem 13]]
    2 KB (316 words) - 15:03, 1 January 2024

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