Skip to content

Mathematical Analysis 1

A course of the Operations Research and Mathematics series · all the courses

Teaching material conceived and developed by Fabio Furini, associate professor at DIAG, Sapienza University of Rome.

The course lecture notes, online: definitions, theorems with their proofs, examples worked out step by step, exercises and interactive graphs to watch mathematics move.

Start Exercises Lab Quiz Downloads

Try it now

More apps in the lab

The parts of the course

  • 1 · Logic and proof methods


    Logical symbols and implications, the contrapositive, necessary and sufficient conditions, proofs by contradiction, mathematical induction.

    The chapters

  • 2 · Numbers and sets


    Sets, real numbers and supremum, roots and logarithms, summations, binomial coefficients, infinite sets, complex numbers.

    The chapters

  • 3 · Binary relations


    Properties of relations, directed graphs, equivalence and order relations: functions are special relations.

    The chapter

  • 3 · Functions


    Elementary functions and their graphs: powers, exponentials and logarithms, trigonometric and hyperbolic functions, composite and inverse functions.

    The chapters

  • 4 · Limits of sequences


    Sequences and limits, Euler's number, comparisons and asymptotic estimates, hierarchies of infinities, recursive sequences.

    The chapters

  • 4 · Limits of functions and continuity


    Limits and asymptotes, standard limits, continuous functions, zeros theorem and bisection, Weierstrass and intermediate values.

    The chapters

  • 5 · Derivatives


    The derivative and the rules of differentiation, Fermat and Lagrange, L'Hôpital, second derivative, Taylor, curve sketching, Newton's method.

    The chapters

  • 6 · Series


    Numerical series, convergence tests for series with non-negative terms, series with terms of varying sign, series of functions.

    The chapters

  • 7 · Integrals


    Riemann integral, fundamental theorem of calculus, integration techniques, areas, improper integrals and the integral test.

    The chapters

Don't miss

  • Exercises with solutions


    Exercises for every chapter, each with its worked solution that opens with a click.

    The exercises

  • Self-assessment quiz


    A new mock exam at every start: 13 questions, 33 points, with the solution and the link to the notes. Downloads also has the full question bank.

    Test yourself

  • Interactive lab


    Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.

    The lab

  • Lecture notes in PDF


    Lecture notes, exercise books and slides in PDF, with the same numbering as the website.

    Downloads

  • Full index


    All the chapters with their sections on one page, and how each chapter is organized.

    The index


The series

All the courses of the series are built the same way: lecture notes online and in PDF, exercises with solutions, an interactive lab and self-assessment quizzes.

  • Mathematical Analysis 1 · this course

    real numbers, functions, limits, derivatives and series, with interactive graphs

  • Linear Algebra

    vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab

  • Algorithms

    number representation, pseudo-code, sorting and searching, analysis and recursive algorithms

  • Linear Programming

    polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab

  • Integer Linear Programming

    LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut

  • Convex Optimization

    convex sets and functions, convex optimization problems, with interactive graphs

  • Network Optimization

    graphs, spanning trees, shortest paths, network flows, the network simplex and project management

  • Combinatorial Optimization Problems

    knapsack, bin packing, coloring, TSP, scheduling and lot sizing: the problems, their formulations and ad hoc algorithms

  • Dynamic Programming

    principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting

  • Heuristic Algorithms

    constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems

  • Approximation Algorithms

    performance guarantees, approximation schemes and limits of approximation for combinatorial problems

  • LP Modelling

    linear programming models of managerial problems, solved with Python and Gurobi

  • NLP Modelling

    nonlinear programming models, from portfolios to machine learning, with Python and Gurobi

  • MIP Modelling

    integer linear programming models, from the formulation to the solution with solvers


Teaching material by Fabio Furini — DIAG, Sapienza University of Rome.

Questo sito è disponibile anche in italiano.