Telescoping (mathematics)
, in which successive segments slide into one another and disappear within the structure so that only the outermost parts remain visible, analogously illustrates telescoping in mathematics, where consecutive terms in algebraic expressions…
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
, in which successive segments slide into one another and disappear within the structure so that only the outermost parts remain visible, analogously illustrates telescoping in mathematics, where consecutive terms in algebraic expressions cancel each other out after expansion, leaving only the boundary terms. In mathematics, telescoping refers to a property of certain algebraic expressions or iterated binary operations in which successive terms cancel each other after expansion.
As a result, the overall expression simplifies significantly, since most intermediate terms eliminate one another, leaving only a small number of boundary terms from the original structure. Most commonly, expressions of the form : f(n)=g(n+1)-g(n) or : f(n)=\frac{g(n+1)}{g(n)},\quad g(n)\neq 0 are considered, where g is a function defined on the set of natural numbers.
, in which successive segments slide into one another and disappear within the structure so that only the outermost parts remain visible, analogously illustrates telescoping in mathematics, where consecutive terms in algebraic expressions cancel each other out after expansion, leaving only the boundary terms. In mathematics, telescoping refers to a property of certain algebraic expressions or iterated binary operations in which successive terms cancel each other after expansion.
As a result, the overall expression simplifies significantly, since most intermediate terms eliminate one another, leaving only a small number of boundary terms from the original structure. Most commonly, expressions of the form f(n)=g(n+1)-g(n) or f(n)=\frac{g(n+1)}{g(n)},\quad g(n)\neq 0 are considered, where g is a function defined on the set of natural numbers. f(n)=g(n+1)-g(n) . Then the sum \sum_{k=m}^{n} f(k) is telescoping. f(n)=\frac{g(n+1)}{g(n)} .
Then the product \prod_{k=m}^{n} f(k) reduces telescopically. \Delta g(n)=g(n+1)-g(n) . Then in the additive case: f(n)=\Delta g(n) . This is analogous to the Newton–Leibniz formula: \sum_{k=m}^{n}\Delta g(k)=g(n+1)-g(m) . Similarly for products: \prod_{k=m}^{n}\frac{g(k+1)}{g(k)}=\frac{g(n+1)}{g(m)},\quad g(k)\neq 0 . f(n)=\frac{1}{n(n+1)} Decomposition: f(n)=\frac{1}{n}-\frac{1}{n+1} so for g(n)=-\frac{1}{n} we have f(n)=g(n+1)-g(n) . Thus: \sum_{k=1}^{n}\frac{1}{k(k+1)}=1-\frac{1}{n+1} . f(n)=\frac{n+1}{n} with g(n)=n , so \prod_{k=1}^{n}\frac{k+1}{k}=n+1 . f(n)=\frac{F_{n+1}}{F_n} . Then: \prod_{k=1}^{n}\frac{F_{k+1}}{F_k}=\frac{F_{n+1}}{F_1}=F_{n+1} .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1359201653 under CC BY-SA 4.0; modifications have been made.