Search results

Page title matches

  • The '''Chain Rule''' is an essential [[theorem]] of [[calculus]]. ===Single variable Chain Rule===
    12 KB (2,377 words) - 10:48, 22 July 2009
  • #REDIRECT [[Chain Rule]]
    24 bytes (3 words) - 17:55, 20 June 2006
  • ...process can be repeated for large numbers, as with the second divisibility rule for 7.
    1 KB (178 words) - 13:20, 12 April 2021
  • 2 KB (279 words) - 14:23, 8 June 2024
  • 2 KB (406 words) - 15:46, 3 May 2020
  • ...th>10 \equiv 1 \pmod{3}</math>, the same proof also gives the divisibility rule for 3. The proof fails for 27 because <math>10 \not\equiv 1 \pmod{27}</mat
    2 KB (316 words) - 19:29, 6 March 2014
  • The divisibility rule would be <math>2d_0-k</math>, where <math>k=d_110^0+d_210^1+d_310^2+...</ma
    841 bytes (139 words) - 22:52, 21 September 2020
  • 2 KB (292 words) - 08:58, 17 August 2006
  • #REDIRECT [[Divisibility rules/Rule 1 for 13 proof]]
    52 bytes (6 words) - 09:08, 17 August 2006
  • 228 bytes (35 words) - 19:28, 6 March 2014
  • If the rule is <math>5n_0-k</math> (the opposite of the suggested rule <math>k-5n_0</math>, but that is proven in turn, and <math>k=n_110^0+n_210^
    402 bytes (69 words) - 19:29, 6 March 2014
  • '''Cramer's Rule''' is a method of solving systems of equations using [[matrix|matrices]]. Cramer's Rule employs the [http://en.wikipedia.org/wiki/Determinant matrix determinant] t
    2 KB (352 words) - 17:22, 11 October 2023
  • '''L'Hopital's Rule''' is a theorem dealing with [[limit]]s that is very important to [[calculu ...ot \epsilon(h)}</math>, which would hence prove our lemma for L'Hospital's rule.
    2 KB (475 words) - 14:04, 24 March 2022
  • 33 bytes (3 words) - 00:43, 7 December 2008
  • #REDIRECT [[L'Hôpital's Rule]]
    31 bytes (4 words) - 20:27, 11 March 2022
  • #REDIRECT[[Cramer's Rule]]
    26 bytes (3 words) - 15:59, 2 March 2016
  • Named after Guillaume de l'Hopital; however, it is believed that the rule was actually discovered by Johann Bernoulli. ==The Rule==
    4 KB (764 words) - 22:10, 2 January 2012
  • 228 bytes (35 words) - 19:27, 6 March 2014
  • 28 bytes (4 words) - 23:01, 6 September 2014
  • ...o determine the number of positive and negative roots of a polynomial. The rule gives an upper bound on the number of positive or negative roots, but does
    942 bytes (147 words) - 09:44, 20 September 2016

Page text matches

  • ...n to get three questions correct wins (as opposed to the best-out-of-three rule).
    10 KB (1,504 words) - 13:10, 1 December 2024
  • We will start with an intuitive solution, and then a rule can be built for solving general fractional inequalities. To make things e
    12 KB (1,806 words) - 05:07, 19 June 2024
  • ...ing about whether or not these roots are positive or negative. Descarte's Rule of Signs says that for a polynomial <math>P(x)</math>, the number of positi
    6 KB (1,100 words) - 14:57, 30 August 2024
  • * [[L'Hôpital's Rule]] * [[Product Rule]]
    2 KB (299 words) - 18:47, 30 June 2024
  • ...{p}</math>. Since <math>\text{gcd}\, (a,p) = 1</math>, by the cancellation rule, that reduces to <math>i \equiv j \pmod{p},</math> which means <math>i = j< The above follows from the exponent rule <math>(a^b)^c=a^{bc}</math>
    16 KB (2,660 words) - 22:42, 28 August 2024
  • ** [[Descartes Rule of Signs]]
    2 KB (198 words) - 15:06, 7 December 2024
  • === Divisibility Rule for 2 and Powers of 2 === [[Divisibility rules/Rule for 2 and powers of 2 proof | Proof]]
    10 KB (1,572 words) - 21:11, 22 September 2024
  • ...may map 1 to 1, 2 to 4, 3 to 9, 4 to 16, and so on. This function has the rule that it takes its input value, and squares it to get an output value. One ...is a function that squares its argument (its input value). Note that this "rule" can be arbitrarily complicated and doesn't need to be given by a simple fo
    10 KB (1,761 words) - 02:16, 12 May 2023
  • The '''Chain Rule''' is an essential [[theorem]] of [[calculus]]. ===Single variable Chain Rule===
    12 KB (2,377 words) - 10:48, 22 July 2009
  • ...a</math> is the angle formed by the two vectors, and from the [[right-hand rule]] condition, <math>\bold{a}\times\bold{b}=-\bold{b}\times\bold{a}</math>. A
    11 KB (1,876 words) - 18:01, 29 August 2024
  • We use the addition rule for cosines and get:
    6 KB (1,003 words) - 23:02, 19 May 2024
  • <li> Modulo a prime <math>r</math> in general, we can rule out all distances <math>d\equiv \pm n\pmod r</math> </li>
    7 KB (1,184 words) - 18:44, 7 December 2024
  • First supplementary rule: <math>\left(\frac{-1}{p}\right)=(-1)^{\frac{p-1}{2}}</math>, so <math>\lef Second supplementary rule: <math>\left(\frac{2}{p}\right)=(-1)^{\frac{p^2-1}{8}}</math>, so <math>\le
    5 KB (778 words) - 12:10, 29 November 2017
  • by [[l'Hôpital's Rule]], so the pole at <math>s=1</math> is simple, and its
    9 KB (1,547 words) - 02:04, 13 January 2021
  • ==== Addition rule ==== ====Proof of the addition rule====
    16 KB (2,406 words) - 07:56, 10 July 2024
  • ...xamples is a different function. (Of course, a function given by the same rule could also take a variety of different domains as well.)
    1 KB (219 words) - 10:54, 29 January 2007
  • *[[L'Hopital's Rule]]
    7 KB (1,327 words) - 17:39, 28 September 2024
  • ...alizes directly to seeking the number of towers where we change the second rule to read, "The cube immediately on top of a cube with edge-length <math>k</m
    3 KB (436 words) - 04:40, 4 November 2022
  • ...ence <math>a_1,a_2,\dots</math> of non-negative integers is defined by the rule <math>a_{n+2}=|a_{n+1}-a_n|</math> for <math>n\geq 1</math>. If <math>a_1=9
    13 KB (2,058 words) - 11:36, 4 July 2023
  • ...of a cube and moves along the edges of the cube according to the following rule. At each vertex the bug will choose to travel along one of the three edges
    15 KB (2,223 words) - 12:43, 28 December 2020

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