Nombres de FeigenbaumEn mathématiques, les nombres de Feigenbaum ou constantes de Feigenbaum sont deux nombres réels découverts par le mathématicien Mitchell Feigenbaum en 1975. Tous deux expriment des rapports apparaissant dans les diagrammes de bifurcation de la théorie du chaos. vignette|droite|Exemple de diagramme de bifurcation (en abscisse, r désigne le paramètre μ). Les diagrammes de bifurcation concernent les valeurs limites prises par les suites de type où f est une fonction réelle, définie positive et trois fois dérivable sur [0, 1] et possédant un maximum unique sur cet intervalle (c’est-à-dire sans maximum relatif), noté f.
Optimization problemIn mathematics, computer science and economics, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories, depending on whether the variables are continuous or discrete: An optimization problem with discrete variables is known as a discrete optimization, in which an object such as an integer, permutation or graph must be found from a countable set.
Patience sortingIn computer science, patience sorting is a sorting algorithm inspired by, and named after, the card game patience. A variant of the algorithm efficiently computes the length of a longest increasing subsequence in a given array. The algorithm's name derives from a simplified variant of the patience card game. The game begins with a shuffled deck of cards. The cards are dealt one by one into a sequence of piles on the table, according to the following rules. Initially, there are no piles.
