# Search results

**Create the page "Generating" on this wiki!** See also the search results found.

## Page title matches

- ...a [[sequence]] which is of interest. Therefore the power series (i.e. the generating function) is <math>c_0 + c_1 x + c_2 x^2 + \cdots </math> and the sequence ...and <math>B</math> is the generating function for <math>b</math>, then the generating function for <math>c</math> is <math>AB</math>.3 KB (476 words) - 10:55, 9 November 2017
- #REDIRECT [[Generating function]]33 bytes (3 words) - 12:35, 6 July 2007

## Page text matches

- ...counting problems can be approached by a variety of techniques, such as [[generating functions]] or the [[Principle of Inclusion-Exclusion|principle of inclusio716 bytes (92 words) - 23:01, 22 April 2020
- * [[Generating function]]3 KB (566 words) - 20:27, 21 June 2020
- ...k Tiefenbruck]] and is supported by the [[San Diego Math Circle]]. [[user:generating | Andy Niedermaier]] was a coach for 2007-2009, and [[user:MCrawford | Math2 KB (378 words) - 16:34, 5 January 2010
- ...a [[sequence]] which is of interest. Therefore the power series (i.e. the generating function) is <math>c_0 + c_1 x + c_2 x^2 + \cdots </math> and the sequence ...and <math>B</math> is the generating function for <math>b</math>, then the generating function for <math>c</math> is <math>AB</math>.3 KB (476 words) - 10:55, 9 November 2017
- The [[Sieve of Eratosthenes]] is a relatively simplistic [[algorithm]] for generating a list of the first few prime numbers. It is a method in which the multiple The Sieve of Sundaram is a relatively simplistic [[algorithm]] for generating all odd prime numbers, less than <math>2n+2</math>. It is a method by which6 KB (925 words) - 19:49, 12 August 2020
- ..._i=C_{i-1}+4i</math>, and note that <math>C_0=1</math>. Now we can create generating functions. <math>F(x)=\sum_{i=0}^\infty C_ix^i</math>. Also, <math>G(x)=\7 KB (1,276 words) - 21:16, 31 March 2018
- Alternatively, we can use a [[generating function]] to solve this problem. The goal is to find the generating function for the number of unique terms in the simplified expression (in te7 KB (1,182 words) - 15:06, 19 June 2018
- * [[Generating functions]]536 bytes (46 words) - 14:36, 8 December 2007
- ...for each of the terms, and obtain <math>(x+x^3+x^5\cdots)^4</math> as the generating function for the sum of the <math>4</math> numbers. We seek the <math>x^{984 KB (549 words) - 14:02, 6 July 2020
- ...+1}</math>, <math>M\geq 0</math> be the length of the longest jump made in generating <math>J_{i_0,k_0}</math>. Such a jump can only be made from a number that i7 KB (1,280 words) - 17:23, 26 March 2016
- == Generating Subset == ...ubset is said to be ''minimal'' if on removing any element it ceases to be generating.3 KB (561 words) - 00:47, 21 March 2009
- * [[Generating functions]]735 bytes (70 words) - 14:25, 8 December 2007
- We use [[generating function]]s to represent the sum of the two dice rolls: <center><math>(x+x^1 KB (210 words) - 20:10, 5 January 2008
- ...n if two squares in the row are shaded, then the row is represented by the generating function <math>ab+ac+ad+bc+bd+cd</math>, which we can write as <math>P(a,b,14 KB (2,337 words) - 21:13, 9 June 2019
- We can apply the concept of generating functions here. ...function for the next 5 games is <math>(1 + x)^{5}</math>. Thus, the total generating function for number of games he wins is6 KB (983 words) - 15:47, 22 March 2018
- * [[Generating function]]1 KB (251 words) - 15:13, 11 August 2020
- The [[generating function]] for <math>a, b, c,</math> and <math>d</math> is <math>x+x^2+x^3+1 KB (172 words) - 09:56, 18 June 2008
- ...[Jacobi theta function]], in particular the [[Jacobi triple product]]. The generating function approach and the theta function approach can be used to study many == Generating Functions ==10 KB (1,508 words) - 14:24, 17 September 2017
- ...math> to <math>M(X)</math>, and let <math>(u_{i},v_i)_{i\in I}</math> be a generating set of the equivalence relation <math>R(x,y)</math> defined as <math>f(x) =4 KB (887 words) - 13:19, 6 July 2016
- '''Corollary 4.''' Let <math>X</math> be a generating subset of <math>G</math>. Then <math>D(G)</math> is the normal subgroup ge4 KB (688 words) - 20:11, 28 May 2008