Principles and first applications
Elementary combinatorial analysis
Article REF: AF200 V1
Principles and first applications
Elementary combinatorial analysis

Author : Louis COMTET

Publication date: April 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?

1. Principles and first applications

1.1 Founding principles of Combinatorics

We usually note │A│ for the number of elements, or effective, or cardinal of a finite part A of a reference set E. Other notations are in use, such as # (A) or Card (A).

  • Recall that, for two parts A and B of E, the notation AB , the union of A and B, designates the set of x such that x ∊ Aoux ∊ B.

  • The notation A \B, difference of A and B, designates the set of x such that x ∊ A and x Ï B.

  • If...

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?


Ongoing reading
Principles and first applications

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 us