Series and combinatorial developments
Advanced combinatorial analysis

Article REF: AF201 V1

Series and combinatorial developments
Advanced combinatorial analysis

Author : Louis COMTET

Publication date: July 10, 2001 | Lire en français

You do not have access to this resource.

Request your free trial access! Free trial

Already subscribed?Log in!

3. Series and combinatorial developments

3.1 Pair series

The binomial formula (Newton's), seen in [AF 200], § 2.5 , gave the development : ${(1 + x)}^{n} = \sum_{k = 0}^{n} (\begin{array}{l} n \\ k \end{array}) x^{k},$

valid for any x in xml...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Series and combinatorial developments

Previous
page Some classic problems

Article included in this offer

"Mathematics"

( 165 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details

References

(1) - BERMAN (G.), FRYER (K.) - Introduction to Combinatorics, - Academic Press, 1992. ISBN 70-182646.
(2) - CARR (G.) - Formulas and Theorems in Pure Mathematics, - Chelsea Reprint, 1970. ISBN 0-8284-0239-6.

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Outline
Full outline