Search result for Math and Logic Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 87 courses
By Category ![]()
By Subject![]()
By Language![]()
Get Course Alerts by Email
Mathematics for economists
by Kirill Bukin- 4.1
-
![]()
![]()
![]()
![]()
![]()
Approx. 26 hours to complete
This course is an important part of the undergraduate stage in education for future economists. It's also useful for graduate students who would like to gain knowledge and skills in an important part of math. It gives students skills for implementation of the mathematical knowledge and expertise to the problems of economics....
Numerical Methods for Engineers
by Jeffrey R. Chasnov- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 40 hours to complete
Numerical Methods for Engineers covers the most important numerical methods that an engineer should know. We derive basic algorithms in root finding, matrix algebra, integration and interpolation, ordinary and partial differential equations. We learn how to use MATLAB to solve numerical problems. Access to MATLAB online and the MATLAB grader is given to all students who enroll....
Mathematical Biostatistics Boot Camp 1
by Brian Caffo, PhD- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 13 hours to complete
This class presents the fundamental probability and statistical concepts used in elementary data analysis. It will be taught at an introductory level for students with junior or senior college-level mathematical training including a working knowledge of calculus. A small amount of linear algebra and programming are useful for the class, but not required....
Introduction to Galois Theory
by Ekaterina Amerik- 4.3
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
A very beautiful classical theory on field extensions of a certain type (Galois extensions) initiated by Galois in the 19th century. Explains, in particular, why it is not possible to solve an equation of degree 5 or more in the same way as we solve quadratic or cubic equations. ). PREREQUISITES...
Introduction to Calculus
by David EasdownTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 59 hours to complete
The focus and themes of the Introduction to Calculus course address the most important foundations for applications of mathematics in science, engineering and commerce. The course emphasises the key ideas and historical motivation for calculus, while at the same time striking a balance between theory and application, leading to a mastery of key threshold concepts in foundational mathematics....
Introduction to Complex Analysis
by Dr. Petra Bonfert-TaylorTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
This course provides an introduction to complex analysis which is the theory of complex functions of a complex variable. Each module consists of five video lectures with embedded quizzes, followed by an electronically graded homework assignment. Additionally, modules 1, 3, and 5 also contain a peer assessment. Introduction to Complex Numbers...
Jacobi modular forms: 30 ans après
by Valery Gritsenko- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 30 hours to complete
This is a master course given in Moscow at the Laboratory of Algebraic Geometry of the National Research University Higher School of Economics by Valery Gritsenko, a professor of University Lille 1, France. Jacobi forms are holomorphic functions in two complex variables. They are modular in one variable and abelian (or double periodic) in another variable....
Introduction to Enumerative Combinatorics
by Evgeny Smirnov- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 111 hours to complete
Enumerative combinatorics deals with finite sets and their cardinalities. In other words, a typical problem of enumerative combinatorics is to find the number of ways a certain pattern can be formed. In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan numbers etc....
Games without Chance: Combinatorial Game Theory
by Dr. Tom Morley- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 14 hours to complete
This course will cover the mathematical theory and analysis of simple games without chance moves. Week 1: What is a Combinatorial Game? Introduction to Two Players Left and Right What is a Combinatorial Game? Example Problem Example Problem Solution Start Here Consent Form Syllabus Course Logistics About The Instructor Get More From Georgia Tech...
Analytic Combinatorics
by Robert Sedgewick- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
Analytic Combinatorics teaches a calculus that enables precise quantitative predictions of large combinatorial structures. This course introduces the symbolic method to derive functional relations among ordinary, exponential, and multivariate generating functions, and methods in complex analysis for deriving accurate asymptotics from the GF equations. All the features of this course are available for free....
Previous
