Lectures related to WordPress, Prometheus et Kibana

Mathematical Analysis: Functions and Composition

Covers the analysis of functions, composition, and mathematical induction.

Tangent to Graph of a Function

Explores finding the equation of the tangent line to a function's graph at a point.

Graph and Diagonal

Discusses the graph of a relation and the concept of separation.

Real Functions of Two Real Variables

Explores real functions of two real variables, illustrating domains, images, and graphs.

Excel Exercise: Trends

Explores trend analysis in Excel using rent data from 1995 to 2023.

Cayley Graphs: Properties and Applications

Explores the properties and applications of Cayley graphs in group theory and network analysis.

Stein Algorithm: Polynomial Identity Testing

Explores the Stein algorithm for polynomial identity testing and the minimization of a cut problem.

Restriction, Prolongement et Graphe d'une Fonction

Explains the relationship between two functions through restriction and prolongation, emphasizing the importance of defining a function by its graph.

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Reservoirs and Dams: Hydraulic Construction and Sizing

Explores sizing reservoirs and dams using cumulative flow curves and tank dimensioning for dry and rainy periods.

Untitled

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Properties of X/G

Explores the properties of the quotient space X/G when X is compact and sometimes separated.

Advanced Analysis II: Tangent Plan and Differentiability

Explores tangent planes and differentiability in advanced analysis, emphasizing the properties of tangent planes and the conditions for differentiability.

Derivative: Application Examples

Explores examples of using derivatives to find tangent lines and points on graphs.

Functions and Integers

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

Modular Programming: Managing Project Complexity

Covers modular programming principles, focusing on managing project complexity through effective code structuring and dependency management.

An Example: Graph of a Function

Analyzes a function's graph, discussing local and global extrema and concavity intervals.

Terminologie: Functions Graph Discussion

Covers the terminology related to the graph of a function and intervals.

Differentiable Functions and Lagrange Multipliers

Covers differentiable functions, extreme points, and the Lagrange multiplier method for optimization.