Search results

Page title matches

• Recurrence relation
  A '''recurrence relation''' is a relation between an entry in a [[sequence]] of [[number]]s or other ...'n''</sub> to stand for the amount in the account in year ''n''. Then, the recurrence relation becomes ''a''_''n''+1 = ''a''_''n'' + 0.06''a''<sub>''n
  3 KB (462 words) - 15:50, 14 December 2008
• Recurrence relation/Definition
  157 bytes (23 words) - 15:35, 14 December 2008
• Recurrence relation/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Recurrence relation]]. Needs checking by a human.
  613 bytes (77 words) - 19:56, 11 January 2010

Page text matches

• Lucas sequence/Related Articles
  *[[Recurrence relation]]
  136 bytes (13 words) - 17:46, 17 February 2008
• Recurrence relation
  A '''recurrence relation''' is a relation between an entry in a [[sequence]] of [[number]]s or other ...'n''</sub> to stand for the amount in the account in year ''n''. Then, the recurrence relation becomes ''a''_''n''+1 = ''a''_''n'' + 0.06''a''<sub>''n
  3 KB (462 words) - 15:50, 14 December 2008
• Continuant (mathematics)/Related Articles
  {{r|Recurrence relation}}
  449 bytes (56 words) - 15:40, 11 January 2010
• Pascal's triangle/Related Articles
  {{r|Recurrence relation}}
  540 bytes (68 words) - 19:23, 11 January 2010
• Lucas sequence
  ==Recurrence relation== ...s sequences ''U''(''P'',''Q'') and ''V''(''P'',''Q'') are defined by the [[recurrence relation]]s
  4 KB (776 words) - 20:44, 20 February 2010
• Recurrence relation/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Recurrence relation]]. Needs checking by a human.
  613 bytes (77 words) - 19:56, 11 January 2010
• Graph coloring/Related Articles
  {{r|Recurrence relation}}
  509 bytes (65 words) - 16:58, 11 January 2010
• Partition (mathematics)/Related Articles
  {{r|Recurrence relation}}
  633 bytes (79 words) - 19:23, 11 January 2010
• Perrin number
  The '''Perrin numbers''' are defined by the recurrence relation
  828 bytes (104 words) - 04:32, 19 May 2008
• Partition (mathematics)
  ...number''', denoted ''B''_''n''. These may be obtained by the [[recurrence relation]]
  2 KB (336 words) - 07:17, 16 January 2009
• Continuant (mathematics)
  ...ub> and ''c''₁,...,''c''_''n''-1. In this case the [[recurrence relation]] becomes
  2 KB (293 words) - 17:21, 13 January 2013
• Fibonacci number
  ...ers in the series. In mathematical terms, it is defined by the following [[recurrence relation]]:
  5 KB (743 words) - 13:10, 27 July 2008
• Gamma function
  This relation is called the ''recurrence formula'' or ''recurrence relation'' of the gamma function. The equation <math>f(z+1) = z f(z)</math> is an ex The recurrence relation is not the only functional equation satisfied by the gamma function. Anothe
  32 KB (5,024 words) - 12:05, 22 December 2008
• Factorial
  For integer values of the argument, the factorial can be defined by a [[recurrence relation]]. If ''n'' labelled objects have to be assigned to ''n'' places, then the
  22 KB (3,358 words) - 09:31, 10 October 2013
• Fractal
  ...he entire fractal in distorted and degenerate forms. Fractals defined by [[recurrence relation]]s are usually quasi-self-similar but not exactly self-similar.
  14 KB (2,043 words) - 12:19, 11 June 2009
• Graph coloring
  If <math>e</math> not a loop, then the chromatic polynomial satisifes the [[recurrence relation]]
  14 KB (2,315 words) - 00:35, 9 February 2010
• Archive:Monthly Write-a-Thon/October 1, 2008
  *[[User:Jitse Niesen|Jitse]] made a start on [[recurrence relation]] because he taught this yesterday. And he also uploaded a map for [[Tanzan
  32 KB (5,104 words) - 15:04, 15 April 2024