Some classic problems
Advanced combinatorial analysis
Article REF: AF201 V1
Some classic problems
Advanced combinatorial analysis

Author : Louis COMTET

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

Logo Techniques de l'Ingenieur You do not have access to this resource.
Request your free trial access! Free trial

Already subscribed?

2. Some classic problems

2.1 Rectilinear combinations. Fibonacci numbers

We are now interested in various aspects of the combinations (or parts) of a finite set N, │N │ = n, whose elements are numbered from 1 to n. We now identify N with the segment of integers [1, n] .

Definition 6. A A⊂〚1, n〛 part is said to be dispersed...

You do not have access to this resource.
Logo Techniques de l'Ingenieur

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?

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
Contact our team FAQ