Search results
Jump to navigation
Jump to search
- ...h>\sum^{\infty}_{n=1} \frac{x^n}n = \log_e\left(\frac{1}{1-x}\right) \quad\mbox{ for } |x| < 1 \!</math> *<math>\sum^{\infty}_{n=0} \frac{x^{2n+1}}{2n+1} = \mathrm{arctanh} (x) \quad\mbox{ for } |x| < 1\,\!</math> ...7 KB (1,090 words) - 18:10, 19 October 2014
- <math>\Pr[\mbox{no edge in }C\mbox{ is contracted}]</math>. &\quad\,\prod_{i=1}^{n-2}\Pr[\,C\mbox{ survives all }(n-2)\mbox{ contractions }]\\ ...7 KB (1,302 words) - 17:40, 4 September 2011
- \mbox{independent}\qquad\\ \mbox{dependent}\\ ...2 KB (253 words) - 20:16, 12 March 2015
- ...box{J}}{\mbox{C}} = \dfrac{\mbox{m}^2 \cdot \mbox{kg}}{\mbox{s}^{3} \cdot \mbox{A}}</math> ...5 KB (641 words) - 23:12, 22 September 2016
- ...left[X-\mathbf{E}[X]\right]\mathbf{E}\left[Y-\mathbf{E}[Y]\right] &\qquad(\mbox{Independence})\\ 1& \mbox{with probability }p\\ ...5 KB (821 words) - 03:48, 19 July 2011
- \mbox{minimize } \mbox{subject to: } ...5 KB (952 words) - 02:52, 19 July 2011
- \mbox{minimize} & \quad f(x)\\ \mbox{subject to} &\quad x\in\mathcal{F} ...6 KB (1,029 words) - 09:37, 6 November 2011
- :: <math>\delta S=\{u\not\in S\mid uv\in E \mbox{ and }v\in S\}</math>, \sum_{k=1}^\frac{n}{2}\Pr[\,\exists \mbox{bad }S\mbox{ of size }k\,]\\ ...8 KB (1,407 words) - 02:23, 25 July 2011
- \mbox{SMOG grade} = 1.0430 \sqrt{ \mbox{hard words in 30 sentences} } \ + 3.1291 \mbox{SMOG grade} = 1.0430 \sqrt{ \mbox{hard words} \times \frac{30}{ \mbox{sentences} } } \ + 3.1291 ...11 KB (1,581 words) - 08:33, 13 September 2015
- \mbox{maximize} &\quad \sum_{j=1}^m z_j\\ \mbox{subject to} &\quad \sum_{i\in C_j^+}y_i+\sum_{i\in C_j^-}(1-y_i) \ge z_j, & ...8 KB (1,443 words) - 14:02, 6 November 2011
- ...you use this coin to generate unbiased (i.e., <math>\Pr[\mbox{HEADS}]=\Pr[\mbox{TAILS}]=1/2</math>) coin-flips? Give a scheme for which the expected number ...4 KB (549 words) - 15:39, 6 July 2013
- \mbox{maximize} &\quad \sum_{j=1}^m z_j\\ \mbox{subject to} &\quad \sum_{i\in C_j^+}y_i+\sum_{i\in C_j^-}(1-y_i) \ge z_j, & ...8 KB (1,443 words) - 05:44, 13 November 2015
- &\quad\,\prod_{i=1}^{n-2}\Pr[\,C\mbox{ survives all }(n-2)\mbox{ contractions }]\\ ...urvives the }i\mbox{-th contraction}\mid C\mbox{ survives the first }(i-1)\mbox{-th contractions}]\\ ...14 KB (2,511 words) - 02:11, 9 October 2015
- :<math>p_{C}=\Pr[\,C\mbox{ is returned by }RandomContract\,]\ge ?</math> ...t to the event <math>\mbox{``}e_i\not\in C\mbox{ for all }i=1,2,\ldots,n-2\mbox{''}</math>. Therefore: ...15 KB (2,698 words) - 02:36, 12 March 2023
- & = 18.31\ \mbox{km/s} \left[ 1 - 0.0177 - 0.00008 - \cdots \right] \\ & \approx 17.98\ \mbox {km/s} \\ ...10 KB (1,411 words) - 04:22, 18 November 2016
- 1 & a_i\mbox{ and }a_j\mbox{ are compared}\\ 0 & \mbox{otherwise} ...16 KB (2,893 words) - 08:43, 7 June 2010
- <math>\mbox{SG} = \frac{\rho_\mathrm{substance}}{\rho_\mathrm{H2O} }</math> ...1 KB (199 words) - 07:36, 12 January 2015
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...15 KB (2,761 words) - 06:11, 8 December 2015
- ...you use this coin to generate unbiased (i.e., <math>\Pr[\mbox{HEADS}]=\Pr[\mbox{TAILS}]=1/2</math>) coin-flips? Give a scheme for which the expected number ...4 KB (646 words) - 08:14, 3 March 2014
- 1 & a_i\mbox{ and }a_j\mbox{ are compared}\\ 0 & \mbox{otherwise} ...19 KB (3,431 words) - 06:53, 14 April 2014