Search results
Jump to navigation
Jump to search
- \mbox{Power}(x,\,n)= \begin{cases} x, & \mbox{if }n\mbox{ = 1} \\ ...1 KB (183 words) - 22:13, 8 March 2013
- :<math>\mbox{H} = \dfrac{\mbox{m}^2 \cdot \mbox{kg}}{\mbox{s}^{2} \cdot \mbox{A}^2} ...2 KB (365 words) - 13:00, 25 September 2014
- :<math>2\pi\mbox{ rad} = 360^\circ</math> :<math>1 \mbox{ rad} = \frac {360^\circ} {2 \pi} = \frac {180^\circ} {\pi} \approx 57.2957 ...2 KB (244 words) - 01:59, 18 July 2017
- :<math>\mbox{T} = \dfrac{\mbox{kg}}{\mbox{A} \cdot \mbox{s}^2} ...3 KB (459 words) - 04:52, 5 December 2016
- :<math>\bar{\mbox{A}} = \mbox{Q}</math> :<math>\overline{\mbox{A} \cdot \mbox{B}}</math> is the same as an AND then a NOT. This is called a NAND gate. ...4 KB (577 words) - 11:45, 6 July 2017
- gcd(v, u\mbox{ mod }v), & \mbox{if }v > 0 \\ u, & \mbox{if }v = 0 ...733 bytes (106 words) - 09:44, 30 December 2016
- <center><math>\mbox{fractional yield} = \frac{\mbox{actual yield}}{\mbox{theoretical yield}}</math></center> ...1 KB (200 words) - 15:36, 12 March 2013
- (3x_t+1)/2 & \mbox{if }x_t\mbox{ is odd},\\ x_t/2 & \mbox{if }x_t\mbox{ is even}, ...3 KB (592 words) - 14:37, 19 April 2010
- ...quivalent to that <math>\forall S\in{X\choose t}, \exists h\in{\mathcal C}\mbox{ that }h\neq f, (h\triangle f)\cap S=\emptyset</math>. For every <math>S\in ...+\sum_{S,T\in{X\choose t}\atop S\neq T}\Pr\left[\mbox{both }S\mbox{ and }T\mbox{ are teaching sets of }f\right]. ...3 KB (513 words) - 10:09, 10 December 2012
- :<math> \mbox{H}_2\mbox{CO}_3 \longrightarrow \mbox{H}_2\mbox{O} + \mbox{CO}_2</math> ...3 KB (427 words) - 19:05, 27 March 2017
- 1 & a_i\mbox{ and }a_j\mbox{ are compared}\\ 0 & \mbox{otherwise} ...7 KB (1,276 words) - 06:03, 27 August 2011
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 22:38, 15 September 2020
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 05:52, 16 September 2019
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 04:35, 10 September 2018
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 16:39, 26 September 2023
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 08:05, 20 September 2017
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 06:13, 9 September 2021
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...6 KB (955 words) - 15:49, 3 October 2022
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...3 KB (541 words) - 15:18, 21 July 2011
- \frac{1}{d(u)}&\mbox{if }(u,v)\in E,\\ 0 & \mbox{otherwise }, ...4 KB (699 words) - 15:06, 19 July 2011
- ...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
- ...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 (747 words) - 06:44, 25 September 2015
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 09:37, 9 November 2015
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 09:24, 19 April 2013
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 08:14, 16 October 2019
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 12:56, 18 April 2023
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 09:36, 2 April 2014
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 02:36, 31 October 2017
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 03:49, 24 October 2016
- ...sponding cells share a <math>{\color{Red}\mbox{red}}\mbox{--}{\color{Blue}\mbox{blue}}</math> edge. ...receives only <math>{\color{Red}\mbox{red}}</math> and <math>{\color{Blue}\mbox{blue}}</math>, the corresponding vertex has degree 2; ...14 KB (2,455 words) - 13:27, 9 April 2024
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...10 KB (1,940 words) - 22:39, 15 September 2020
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...10 KB (1,940 words) - 03:37, 19 October 2021
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...10 KB (1,940 words) - 10:53, 10 October 2023
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...10 KB (1,940 words) - 07:38, 14 October 2019
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...10 KB (1,940 words) - 12:53, 11 October 2022
- 1& \mbox{if } x=y,\\ 0& \mbox{otherwise.} ...9 KB (1,662 words) - 07:05, 15 November 2011
- :<math>\mbox{BMI} = \frac{78}{1.83 ^2} = 23.3</math> :<math>\mbox{BMI} = \frac{172}{72 ^2}\times 703 = 23.3</math> ...7 KB (1,048 words) - 14:58, 12 May 2015
- ...athcal{F}=\left\{T\in {X\choose k+1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } S\subset T\right\}</math>. ...athcal{F}=\left\{T\in {X\choose k-1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } T\subset S\right\}</math>. ...24 KB (4,365 words) - 11:50, 5 June 2013
- ...athcal{F}=\left\{T\in {X\choose k+1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } S\subset T\right\}</math>. ...athcal{F}=\left\{T\in {X\choose k-1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } T\subset S\right\}</math>. ...25 KB (4,389 words) - 09:05, 12 January 2011
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...10 KB (1,796 words) - 02:51, 19 July 2011
- T_{ij} & \mbox{if }j\in T, i\not\in T, \mbox{ and }T_{ij} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...25 KB (4,523 words) - 13:54, 27 December 2015
- ...athcal{F}=\left\{T\in {X\choose k+1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } S\subset T\right\}</math>. ...athcal{F}=\left\{T\in {X\choose k-1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } T\subset S\right\}</math>. ...25 KB (4,408 words) - 01:20, 10 November 2011
- :<math>\mbox{pH} = -\log_{10} \left[ \mbox{H}^+ \right]</math> ...4 KB (678 words) - 15:24, 23 August 2017
- &\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}]\\ ...22 KB (4,084 words) - 10:22, 6 March 2013
- :: <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\,]\\ ...15 KB (2,745 words) - 10:19, 4 January 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 ...5 KB (941 words) - 11:44, 17 July 2014
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...22 KB (3,809 words) - 05:34, 19 March 2014
- T_{ij} & \mbox{if }j\in T, i\not\in T, \mbox{ and }T_{ij} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...32 KB (5,780 words) - 13:32, 2 December 2017
- T_{ij} & \mbox{if }j\in T, i\not\in T, \mbox{ and }T_{ij} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...32 KB (5,780 words) - 02:49, 24 November 2016
- T_{ij} & \mbox{if }j\in T, i\not\in T, \mbox{ and }T_{ij} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...32 KB (5,780 words) - 07:54, 28 November 2019
- ...athcal{F}=\left\{T\in {X\choose k+1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } S\subset T\right\}</math>. ...athcal{F}=\left\{T\in {X\choose k-1}\,\,\bigg|\,\, \exists S\in\mathcal{F}\mbox{ such that } T\subset S\right\}</math>. ...32 KB (5,800 words) - 07:57, 21 May 2014
- 1& \mbox{if }e_i\in G,\\ 0& \mbox{otherwise}. ...20 KB (3,641 words) - 03:06, 19 July 2011
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...30 KB (5,292 words) - 07:49, 3 August 2011
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...23 KB (4,153 words) - 08:30, 12 October 2010
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...23 KB (4,153 words) - 08:18, 16 August 2011
- 1 & a_i\mbox{ and }a_j\mbox{ are compared}\\ 0 & \mbox{otherwise} ...26 KB (4,811 words) - 10:33, 11 March 2013
- &\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}]\\ ...26 KB (4,800 words) - 06:38, 3 March 2014
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...24 KB (4,172 words) - 15:38, 19 March 2013
- 1 & \mbox{if }X\ge t,\\ 0 & \mbox{otherwise.} ...29 KB (5,238 words) - 05:34, 13 November 2015
- T\setminus\{i\} & \mbox{if }i\in T \mbox{ and }T\setminus\{i\} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...25 KB (4,480 words) - 04:58, 17 November 2010
- T\setminus\{i\} & \mbox{if }i\in T \mbox{ and }T\setminus\{i\} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...25 KB (4,480 words) - 08:23, 16 August 2011
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,922 words) - 12:14, 28 October 2011
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,922 words) - 11:23, 25 April 2013
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,922 words) - 13:39, 2 April 2014
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,926 words) - 05:36, 31 October 2016
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,926 words) - 08:59, 23 October 2019
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,926 words) - 08:33, 24 November 2015
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,926 words) - 12:04, 12 November 2017
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...27 KB (4,933 words) - 02:57, 24 April 2024
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...27 KB (4,933 words) - 15:56, 27 April 2023
- \mbox{minimize } \mbox{subject to: } ...17 KB (3,066 words) - 06:06, 18 April 2013
- \min\{A(i,p),w_{i+1}+A(i,p-p_{i+1})\} & \mbox{if }p_{i+1}\le p,\\ A(i,p) & \mbox{otherwise}. ...20 KB (3,484 words) - 05:14, 11 June 2010
- 1 & S\mbox{ is a clique},\\ 0 & \mbox{otherwise}. ...14 KB (2,752 words) - 05:32, 19 March 2014
- :"<math>\mbox{Is }x\in S?</math>" ...3 KB (519 words) - 01:30, 24 July 2011
- T_{ij} & \mbox{if }j\in T, i\not\in T, \mbox{ and }T_{ij} \not\in\mathcal{F},\\ T & \mbox{otherwise;} ...50 KB (8,991 words) - 12:23, 21 May 2023
- 1 & S\mbox{ is a clique},\\ 0 & \mbox{otherwise}. ...21 KB (3,837 words) - 09:44, 1 April 2013
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...8 KB (1,547 words) - 08:58, 16 October 2011
- 1 & \mbox{if }X_i\le m,\\ 0 & \mbox{otherwise.} ...10 KB (1,840 words) - 03:10, 19 July 2011
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...27 KB (4,865 words) - 07:47, 24 March 2014
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...27 KB (4,865 words) - 08:14, 24 March 2014
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. F_{n-1}+F_{n-2} & \mbox{if }n\ge 2,\\ ...20 KB (3,444 words) - 04:53, 7 October 2010
- 1& \mbox{if } x=y,\\ 0& \mbox{otherwise.} ...16 KB (2,886 words) - 07:49, 13 November 2011
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,338 words) - 12:57, 11 September 2016
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,338 words) - 09:04, 12 September 2017
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,338 words) - 13:15, 6 September 2019
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,338 words) - 12:04, 14 September 2015
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...25 KB (4,460 words) - 17:41, 23 March 2023
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. f_{n-1}+f_{n-2} & \mbox{if }n\ge 2,\\ ...25 KB (4,460 words) - 11:41, 6 March 2024
- 1 & S\mbox{ is a clique},\\ 0 & \mbox{otherwise}. ...11 KB (2,031 words) - 01:33, 24 July 2011
- ...\Pr\left[\boldsymbol{X}_{[i+1,n]}=\boldsymbol{a}_{[i+1,n]}\right] \qquad (\mbox{independence})\\ ...\Pr\left[\boldsymbol{X}_{[i+1,n]}=\boldsymbol{a}_{[i+1,n]}\right] \qquad (\mbox{Lipschitz condition})\\ ...26 KB (4,623 words) - 08:28, 31 March 2014
- \Pr\left(G\text{ 包含子图 }K_k\right)=\mbox{$\Pr\left(\bigcup_{S\in{[n]\choose k}}(K_S\subseteq G)\right)$}\le {n\choos ...7 KB (923 words) - 03:13, 22 April 2024
- \Pr\left(G\text{ 包含子图 }K_k\right)=\mbox{$\Pr\left(\bigcup_{S\in{[n]\choose k}}(K_S\subseteq G)\right)$}\le {n\choos ...7 KB (923 words) - 04:29, 19 April 2023
- 1& \mbox{if }e_i\in G,\\ 0& \mbox{otherwise}. ...30 KB (5,461 words) - 09:28, 16 September 2020
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. ...15 KB (2,781 words) - 06:17, 29 September 2021
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. ...15 KB (2,781 words) - 16:38, 26 September 2023
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. ...15 KB (2,781 words) - 15:47, 3 October 2022
- \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, & ...24 KB (4,382 words) - 07:27, 21 April 2014
- \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, & ...24 KB (4,382 words) - 10:07, 24 May 2013
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...40 KB (7,253 words) - 03:36, 19 October 2021
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...40 KB (7,253 words) - 12:53, 11 October 2022
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...40 KB (7,253 words) - 06:10, 8 October 2019
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...40 KB (7,253 words) - 10:53, 10 October 2023
- \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. \Pr[\mbox{collision occurs}]\le\epsilon. ...16 KB (2,812 words) - 06:21, 21 November 2011
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...30 KB (5,432 words) - 18:28, 2 September 2010
- :<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: ...43 KB (7,673 words) - 09:03, 22 September 2016
- :<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: ...43 KB (7,750 words) - 15:39, 15 September 2017
- :<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: ...43 KB (7,705 words) - 07:31, 5 September 2022
- :<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: ...43 KB (7,705 words) - 08:44, 24 August 2021
- :<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: ...43 KB (7,705 words) - 11:24, 8 September 2020
- :<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: ...43 KB (7,705 words) - 05:26, 16 September 2019
- :<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: ...43 KB (7,708 words) - 10:34, 12 September 2023
- :<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: ...43 KB (7,745 words) - 01:16, 10 September 2018
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...37 KB (6,690 words) - 05:31, 20 September 2017
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...37 KB (6,690 words) - 02:23, 19 September 2018
- ...t[G(n,\frac{1}{2})\mbox{ is connected }\right]\ge\Pr\left[G(n,\frac{1}{3})\mbox{ is connected }\right]</math>. ...t[G(n,\frac{1}{2})\mbox{ is connected }\right]\ge\Pr\left[G(n,\frac{1}{3})\mbox{ is connected }\right]</math>. ...37 KB (6,516 words) - 08:40, 7 June 2010
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...37 KB (6,763 words) - 09:43, 24 May 2013
- ...t[G(n,\frac{1}{2})\mbox{ is connected }\right]\ge\Pr\left[G(n,\frac{1}{3})\mbox{ is connected }\right]</math>. ...t[G(n,\frac{1}{2})\mbox{ is connected }\right]\ge\Pr\left[G(n,\frac{1}{3})\mbox{ is connected }\right]</math>. ...29 KB (4,888 words) - 09:13, 16 December 2011
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. F_{n-1}+F_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,348 words) - 11:46, 6 March 2013
- 1& \mbox{if } x=y,\\ 0& \mbox{otherwise.} ...21 KB (3,794 words) - 09:47, 10 September 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> ...21 KB (3,854 words) - 05:30, 20 September 2017
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...21 KB (3,854 words) - 09:28, 16 September 2020
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...21 KB (3,854 words) - 02:21, 19 September 2018
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...21 KB (3,854 words) - 09:32, 16 September 2020
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...39 KB (7,173 words) - 03:22, 4 November 2010
- & (\mbox{for independent random variables}) :<math>\mathbf{E}[X_{ij}]=\Pr[\mbox{ball }j\mbox{ is thrown to bin }i]=\frac{1}{n}</math> ...21 KB (3,868 words) - 05:58, 26 November 2016
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,354 words) - 11:26, 8 September 2020
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,354 words) - 13:38, 18 September 2018
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,354 words) - 05:43, 13 September 2022
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,354 words) - 08:06, 6 September 2021
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,354 words) - 13:18, 6 September 2019
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,348 words) - 12:54, 17 September 2017
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...30 KB (5,347 words) - 05:55, 26 November 2016
- 1& \mbox{if } x=y,\\ 0& \mbox{otherwise.} ...20 KB (3,617 words) - 01:24, 8 June 2010
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...19 KB (3,458 words) - 07:33, 12 March 2014
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...19 KB (3,458 words) - 06:18, 20 March 2013
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...19 KB (3,458 words) - 06:51, 12 October 2015
- :: <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\,]\\ ...34 KB (6,244 words) - 15:28, 8 June 2013
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. F_{n-1}+F_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,298 words) - 05:54, 20 March 2013
- :<math>\underbrace{(x_0+x_1)(x_0+x_1)\cdots (x_0+x_1)}_{n\mbox{ elements}}=(x_0+x_1)^n</math>. F_{n-1}+F_{n-2} & \mbox{if }n\ge 2,\\ ...24 KB (4,298 words) - 06:51, 26 February 2014
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...28 KB (5,169 words) - 11:26, 13 September 2015
- :<math>\Pr[u\mbox{ beats all }v\in S]=2^{-k}</math>. Therefore, <math>\Pr[u\mbox{ does not beats all }v\in S]=1-2^{-k}</math> and ...26 KB (4,583 words) - 04:53, 7 October 2010
- \mbox{minimize } \mbox{subject to: } ...31 KB (5,481 words) - 03:52, 9 November 2010
- p & \mbox{if }u\neq v\mbox{ and }u\sim v,\\ 0 & \mbox{if }u\neq v\mbox{ and }u\not\sim v,\\ ...28 KB (4,914 words) - 08:26, 7 June 2010
- :<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: ...49 KB (8,708 words) - 08:53, 14 September 2023
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...25 KB (4,555 words) - 08:25, 31 March 2014
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 13:22, 16 February 2023
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 04:31, 17 February 2014
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 10:39, 27 February 2024
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 06:09, 31 August 2015
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 11:03, 6 March 2013
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,924 words) - 05:21, 16 September 2019
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,926 words) - 13:07, 1 September 2011
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,926 words) - 07:43, 1 August 2017
- 1 & \mbox{if }x_i\in T\\ 0 & \mbox{if }x_i\not\in T. ...39 KB (6,926 words) - 09:09, 30 December 2016
- :: <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\,]\\ ...35 KB (6,195 words) - 08:39, 7 June 2010
- \frac{1}{d_+(u)}& \mbox{if }(u,v)\in E,\\ 0& \mbox{otherwise}. ...40 KB (7,046 words) - 10:00, 13 December 2015
- \frac{1}{d_+(u)}& \mbox{if }(u,v)\in E,\\ 0& \mbox{otherwise}. ...40 KB (7,046 words) - 08:04, 2 June 2014
- \frac{1}{d_+(u)}& \mbox{if }(u,v)\in E,\\ 0& \mbox{otherwise}. ...40 KB (7,049 words) - 15:11, 8 June 2013
- * Each <math>H_i=\{x\in\{\text{true},\text{false}\}^n\mid x\mbox{ satisfies }C_i\}</math> is the set of satisfying assignments for the <math \frac{1}{Z(G)} & \mbox{if }M\mbox{ is a matching in }G,\\ ...23 KB (4,076 words) - 15:50, 12 May 2014
- :: <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\,]\\ ...37 KB (6,824 words) - 02:20, 29 December 2015
- ::<math>f(x)=1 \Leftrightarrow \exists y\in\{0,1\}^{p(|x|)}, \mbox{such that } V(x,y)=1\,</math>. 1 & \mbox{if }i\sim j,\\ ...37 KB (6,579 words) - 08:26, 7 June 2010
- ::<math>X_0=0\quad \mbox{ and } \quad X_i=\sum_{j\le i}Z_j</math>. &= X_{i-1}+\mathbf{E}[Z_{i}] &\quad (\mbox{independence of coin flips})\\ ...50 KB (9,096 words) - 06:09, 8 December 2015
- :: <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\,]\\ ...41 KB (7,547 words) - 09:24, 22 May 2023
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...37 KB (6,665 words) - 12:21, 19 September 2023
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. ...31 KB (5,704 words) - 08:39, 5 May 2014
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. ...31 KB (5,704 words) - 05:36, 13 November 2015
- \exists x_0\in \mathcal{X}, \mbox{such that } \mathbf{E}_{A:\mathcal{Q}} \left[ T(A, x_0) \right] \tau(x) & \mbox{if }k=1\\ ...25 KB (4,263 words) - 08:43, 7 June 2010
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \forall 1\le i\le t, &\quad \mbox{let }r_i = (a\cdot i+b)\bmod p. ...37 KB (6,743 words) - 09:07, 13 November 2011
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \forall 1\le i\le t, &\quad \mbox{let }r_i = (a\cdot i+b)\bmod p. ...18 KB (3,232 words) - 07:32, 21 November 2011
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \forall 1\le i\le t, &\quad \mbox{let }r_i = (a\cdot i+b)\bmod p. ...42 KB (7,662 words) - 08:41, 7 June 2010
- Y_i=(X_0+i\cdot X_1)\bmod p &\quad \mbox{for }i\in[p]. \forall 1\le i\le t, &\quad \mbox{let }r_i = (a\cdot i+b)\bmod p. ...39 KB (7,106 words) - 09:54, 24 May 2013
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...29 KB (5,077 words) - 04:54, 7 October 2010
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,205 words) - 01:11, 22 September 2011
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,227 words) - 06:15, 30 September 2019
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,227 words) - 12:45, 16 March 2023
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,227 words) - 11:45, 15 October 2017
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,227 words) - 07:00, 29 September 2016
- r_k &= \mbox{number of }k\mbox{-subsets of }B\mbox{ such that no two elements have a common coordinate}\\ ...33 KB (6,227 words) - 09:51, 19 March 2024
- \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. \Pr[\mbox{collision occurs}]\le\epsilon. ...38 KB (6,912 words) - 15:45, 3 October 2022
- \mathcal{H}=\{h_{a}\mid a\in[2^v]\mbox{ and }a\mbox{ is odd}\}. \Pr[\mbox{collision occurs}]\le\epsilon. ...48 KB (8,716 words) - 08:15, 15 October 2023
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...22 KB (3,591 words) - 03:54, 17 February 2014
- 1& \mbox{if } a=b,\\ 0& \mbox{otherwise.} ...22 KB (3,591 words) - 10:45, 4 March 2013
- \Pr[h\mbox{ is perfect for }S]\ge\frac{1}{2} ...10 KB (1,895 words) - 06:20, 21 November 2011
- \quad\mbox{and}\\ ...14 KB (2,413 words) - 02:32, 25 November 2011
- \quad\mbox{and}\\ ...14 KB (2,413 words) - 15:11, 12 May 2013
- 1& \mbox{if } x=y,\\ 0& \mbox{otherwise.} ...29 KB (4,994 words) - 01:21, 29 August 2011
- ...wer set of <math>S</math>, and let <math>{S\choose k}=\{A\mid A\subseteq S\mbox{ and }|A|=k\}</math> be the '''<math>k</math>-uniform''' of <math>S</math>. :<math>R=\{\sigma((i+j)\bmod n)\mid j\in[k]\}, \quad\mbox{ or equivalently }R=\sigma(A_i)</math>. ...33 KB (6,039 words) - 08:41, 7 June 2010
- 0 & \mbox{otherwise.} ...18 KB (3,527 words) - 05:10, 9 November 2016
- 0 & \mbox{otherwise.} ...18 KB (3,527 words) - 05:55, 12 November 2019
- 0 & \mbox{otherwise.} ...18 KB (3,527 words) - 08:55, 4 May 2023
- 0 & \mbox{otherwise.} ...18 KB (3,527 words) - 06:10, 22 November 2017
- 0 & \mbox{otherwise.} ...19 KB (3,541 words) - 07:47, 25 December 2015
- 0 & \mbox{otherwise.} ...21 KB (3,921 words) - 08:23, 13 November 2010
- 0 & \mbox{otherwise.} ...21 KB (3,922 words) - 01:04, 3 November 2011
- 0 & \mbox{otherwise.} ...21 KB (3,922 words) - 08:56, 20 May 2013
- 0 & \mbox{otherwise.} ...21 KB (3,922 words) - 10:31, 16 April 2014
- :"<math>\mbox{Is }x\in S?</math>" ...25 KB (4,512 words) - 05:52, 16 September 2019
- :"<math>\mbox{Is }x\in S?</math>" ...25 KB (4,512 words) - 07:51, 29 September 2020
- :"<math>\mbox{Is }x\in S?</math>" ...25 KB (4,512 words) - 09:09, 20 September 2018
- :"<math>\mbox{Is }x\in S?</math>" ...25 KB (4,512 words) - 15:48, 3 October 2022
- :"<math>\mbox{Is }x\in S?</math>" ...25 KB (4,512 words) - 06:13, 9 September 2021