Mots en English pour '(combinatorics) A method of solving recurrence relations.'
Vous trouverez ci-dessus des mots liés à "(combinatorics) A method of solving recurrence relations.". Placez le pointeur ou le focus sur un mot pour voir sa définition, puis ajustez la recherche si nécessaire.
Résultats de recherche
noun
- (mathematics) more broadly, any recurrence relation
- (mathematics) An equation involving an ordered sequence of real numbers (a_nₙ₌₁ ᪲) and some of its differences, where the first difference is defined as Δ(a_n)=a_n+1-a_n, and the kᵗʰ difference is defined recursively as Δᵏ(a_n)=Δᵏ⁻¹(a_n+1)-Δᵏ⁻¹(a_n),.
adj
- of or relating to a recursion
- (computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time
- (mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms
- drawing upon itself, referring back.
- (computing theory, not comparable, of a set) whose characteristic function is recursive (4)
- (computing, not comparable) of a program or function that calls itself
prefix
noun
- (mathematics) more broadly, any recurrence relation
- (mathematics) An equation involving an ordered sequence of real numbers (a_nₙ₌₁ ᪲) and some of its differences, where the first difference is defined as Δ(a_n)=a_n+1-a_n, and the kᵗʰ difference is defined recursively as Δᵏ(a_n)=Δᵏ⁻¹(a_n+1)-Δᵏ⁻¹(a_n),.
adj
- of or relating to a recursion
- (computing theory, not comparable, of a function) which can be computed by a theoretical model of a computer, in a finite amount of time
- (mathematics, not comparable) of an expression, each term of which is determined by applying a formula to preceding terms
- drawing upon itself, referring back.
- (computing theory, not comparable, of a set) whose characteristic function is recursive (4)
- (computing, not comparable) of a program or function that calls itself