Search results

  • the vertex <math>V</math> to this path? MP("P",(-1,0),W);MP("V",(-.5,2.4),N);
    3 KB (560 words) - 19:23, 10 March 2015
  • | <math>\left(u(x)\times v(x)\right)'=u(x)v'(x)+u'(x)v(x)</math> | <math>\left(\frac{u(x)}{v(x)}\right)' = \frac{u'(x)v(x) - u(x)v'(x)}{(v(x))^2}</math>
    3 KB (506 words) - 16:23, 11 March 2022
  • *Given a weighted, undirected graph <math>G = (V,E)</math> and two vertices <math>s, t \in E</math>, does there exist a path
    6 KB (1,104 words) - 15:11, 25 October 2017
  • ...for which <cmath>\left\vert\sum_{j=m+1}^n(a_j-(v+1))\right\vert\le (T-v)\,v \le \left(\frac T 2\right)^2</cmath>for all integers <math>m</math> and <ma ...is:<cmath>\sum_{i=1}^v (T-v+i) - \sum_{i=1}^v i=\sum_{i=1}^v (T-v)=(T-v)\,v\;. \quad \blacksquare</cmath>
    4 KB (833 words) - 01:33, 31 December 2019
  • ...s had to make change on a purchase of LXIV dollars with bills marked L, X, V and I when handed XC dollars.
    2 KB (371 words) - 12:55, 21 June 2023
  • ...group over a set <math>I</math> and <math>uv = vu</math>, then <math>u^m = v^n</math>, for some [[integer]]s <math>m</math> and <math>n</math>.
    2 KB (454 words) - 17:54, 16 March 2012
  • \text{(V) } 2007 \quad </math> <math>\text{(V) Ying} \quad
    33 KB (5,177 words) - 21:05, 4 February 2023
  • ...ng subset. Hence <cmath>F(n,r)=\frac{1}{\binom{n}{r}} \sum_{v \in B} \deg (v)= \frac{n+1}{r+1}.</cmath>
    5 KB (879 words) - 11:18, 27 June 2020
  • 5 - '''V''' ''(quinque)''
    865 bytes (140 words) - 13:58, 24 March 2019
  • ..., then the [[greatest common factor]] of <math>2^u + 1 </math> and <math>2^v + 1 </math> is 3. ...ath>t </math>, contradicting our assumption that <math>u </math> and <math>v </math> are relatively prime.
    10 KB (1,739 words) - 06:38, 12 November 2019
  • label("V", (2, 6), NE);
    13 KB (1,968 words) - 18:32, 29 February 2024
  • ...ale the triangle with the circumradius by a [[line]]ar scale factor, <math>v</math>. :<math>\frac{65}{8}v=8u</math>
    11 KB (2,099 words) - 17:51, 4 January 2024
  • ...cut off corners is a [[pyramid]], whose volume can be calculated by <math>V = \frac 13 Bh</math>. Use the base as one of the three [[congruency (geomet
    2 KB (317 words) - 10:10, 16 September 2022
  • Call it a vertex set <math>V</math>. <math>10</math> vertices remain outside <math>V</math> and each has to be attached to at least one edge.
    3 KB (438 words) - 01:19, 27 December 2023
  • Let <math>u</math> and <math>v</math> be real numbers such that (u + u^2 + u^3 + \cdots + u^8) + 10u^9 = (v + v^2 + v^3 + \cdots + v^{10}) + 10v^{11} = 8.
    2 KB (326 words) - 18:52, 18 July 2016
  • Chose a vertex, <math>v</math>, for which <math>a</math> is minimal (i.e. out of all maximal elemen ...h>. So then in this special case, we have <math>D = 4</math>, and so <math>V = 2006 \times 4+1</math> (a possible configuration of this size that works
    10 KB (1,878 words) - 14:56, 30 June 2021
  • * The volume <math>V</math> of a regular octahedron with side length <math>a</math> is <math>\fr
    1 KB (155 words) - 12:19, 21 July 2023
  • Let <math>u</math> and <math>v</math> be real numbers such that <cmath> (u + u^2 + u^3 + \cdots + u^8) + 10u^9 = (v + v^2 + v^3 + \cdots + v^{10}) + 10v^{11} = 8. </cmath>
    2 KB (300 words) - 19:16, 18 July 2016
  • ...bstituting yields: <math>20n+25=21(n+1),</math> so <math>n=4</math>, <math>v = 80.</math> Then, we see that the only way Paula can satisfy this rule is
    2 KB (310 words) - 17:39, 31 December 2022
  • Let <math>U=2\cdot 2004^{2005}</math>, <math>V=2004^{2005}</math>, <math>W=2003\cdot 2004^{2004}</math>, <math>X=2\cdot 20 <math>\mathrm {(A)} U-V \qquad \mathrm {(B)} V-W \qquad \mathrm {(C)} W-X \qquad \mathrm {(D)} X-Y \qquad \mathrm {(E)} Y-
    1 KB (139 words) - 02:10, 30 December 2020

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