Online Course
Mathematical Thinking in Computer Science
University of California, San Diego and Higher School of Economics via Coursera

194

 Write review
Overview
Class Central Tips
In the course, we use a trythisbeforeweexplaineverything approach: you will be solving many interactive (and mobile friendly) puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yourself.
Prerequisites:
1. We assume only basic math (e.g., we expect you to know what is a square or how to add fractions), common sense and curiosity.
2. Basic programming knowledge is necessary as some quizzes require programming in Python.
Syllabus
Why some arguments are convincing and some are not? What makes an argument convincing? How to establish your argument in such a way that there is no possible room for doubt left? How mathematical thinking can help with this? In this week we will start digging into these questions. We will see how a small remark or a simple observation can turn a seemingly nontrivial question into an obvious one. Through various examples we will observe a parallel between constructing a rigorous argument and mathematical reasoning.
How to Find an Example?
How can we be certain that an object with certain requirements exist? One way to show this, is to go through all objects and check whether at least one of them meets the requirements. However, in many cases, the search space is enormous. A computer may help, but some reasoning that narrows the search space is important both for computer search and for "bare hands" work. In this module, we will learn various techniques for showing that an object exists and that an object is optimal among all other objects. As usual, we'll practice solving many interactive puzzles. We'll show also some computer programs that help us to construct an example.
Recursion and Induction
We'll discover two powerful methods of defining objects, proving concepts, and implementing programs — recursion and induction. These two methods are heavily used in discrete mathematics and computer science. In particular, you will see them frequently in algorithms — for analysing correctness and running time of algorithms as well as for implementing efficient solutions. For some computational problems (e.g., exploring networks), recursive solutions are the most natural ones. The main idea of recursion and induction is to decompose a given problem into smaller problems of the same type. Being able to see such decompositions is an important skill both in mathematics and in programming. We'll hone this skill by solving various problems together.
Logic
We have already invoked mathematical logic when we discussed how to make convincing arguments by giving examples. This week we will turn mathematical logic full on. We will discuss its basic operations and rules. We will see how logic can play a crucial and indispensable role in creating convincing arguments. We will discuss how to construct a negation to the statement, and you will see how to win an argument by showing your opponent is wrong with just one example called counterexample!. We will see tricky and seemingly counterintuitive, but yet (an unintentional pun) logical aspects of mathematical logic. We will see one of the oldest approaches to making convincing arguments: Reductio ad Absurdum.
Invariants
"There are things that never change". Apart from being just a philosophical statement, this phrase turns out to be an important idea that can actually help. In this module we will see how it can help in problem solving. Things that do not change are called invariants in mathematics. They form an important tool of proving with numerous applications, including estimating running time of programs and algorithms. We will get some intuition of what they are, see how they can look like, and get some practice in using them.
Solving a 15Puzzle
In this module, we consider a well known 15puzzle where one needs to restore order among 15 square pieces in a square box. It turns out that the behaviour of this puzzle is determined by mathematics: it is solvable if and only if the corresponding permutation is even. We will learn the basic properties of even and odd permutations. The task is to implement a program that determines whether a permutation is even or odd. There is also a more difficult bonus task: to implement a program that actually computes a solution (sequence of moves) for a given position assuming that this position is solvable.
Taught by
Alexander S. Kulikov, Michael Levin and Vladimir Podolskii
Tags
Related Courses

Introduction to Discrete Mathematics for Computer Science
University of California, San Diego

Introduction to Graph Theory
University of California, San Diego , Higher School of Economics
4.0 
Advanced Algorithms and Complexity
University of California, San Diego , Higher School of Economics
3.0 
Number Theory and Cryptography
University of California, San Diego , Higher School of Economics

Delivery Problem
University of California, San Diego

Introduction to Mathematical Thinking
Stanford University
4.4
Reviews
4.5 rating, based on 2 reviews

Anonymous completed this course.
A pretty decent introduction to proofs in general. It covers a basic view of different types of proofs. It's a great introduction to the specialization. Also, it's got a few fun puzzle to solve along with the lectures and quizzes. Pretty neat. 
PAZHAMALAI M UEE14227 completed this course, spending 3 hours a week on it and found the course difficulty to be easy.
Lots of interactive quizzes and challenges makes the course more interesting. More classical problems in computer science, has been explained.