Informações sobre o curso
4.5
310 classificações
69 avaliações
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível iniciante

Nível iniciante

Horas para completar

Aprox. 20 horas para completar

Sugerido: 6 weeks, 2–5 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês...

Habilidades que você terá

Mathematical InductionProof TheoryDiscrete MathematicsMathematical Logic
100% online

100% online

Comece imediatamente e aprenda em seu próprio cronograma.
Prazos flexíveis

Prazos flexíveis

Redefinir os prazos de acordo com sua programação.
Nível iniciante

Nível iniciante

Horas para completar

Aprox. 20 horas para completar

Sugerido: 6 weeks, 2–5 hours/week...
Idiomas disponíveis

Inglês

Legendas: Inglês...

Programa - O que você aprenderá com este curso

Semana
1
Horas para completar
3 horas para concluir

Making Convincing Arguments

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 non-trivial question into an obvious one. Through various examples we will observe a parallel between constructing a rigorous argument and mathematical reasoning....
Reading
10 vídeos (Total de 43 min), 4 leituras, 4 testes
Video10 videos
Proofs?3min
Proof by Example1min
Impossibility Proof2min
Impossibility Proof, II and Conclusion3min
One Example is Enough3min
Splitting an Octagon1min
Making Fun in Real Life: Tensegrities10min
Know Your Rights5min
Nobody Can Win All The Time: Nonexisting Examples8min
Reading4 leituras
Slides10min
Python10min
Slides1min
Acknowledgements1min
Quiz1 exercício prático
Tiles, dominos, black and white, even and odd6min
Semana
2
Horas para completar
5 horas para concluir

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....
Reading
16 vídeos (Total de 90 min), 5 leituras, 12 testes
Video16 videos
Narrowing the Search6min
Multiplicative Magic Squares5min
More Puzzles9min
Integer Linear Combinations5min
Paths In a Graph4min
N Queens: Brute Force Search (Optional)10min
N Queens: Backtracking: Example (Optional)7min
N Queens: Backtracking: Code (Optional)7min
16 Diagonals (Optional)3min
Warm-up5min
Subset without x and 100-x4min
Rooks on a Chessboard2min
Knights on a Chessboard5min
Bishops on a Chessboard2min
Subset without x and 2x6min
Reading5 leituras
Slides1min
N Queens: Brute Force Solution Code (Optional)10min
N Queens: Backtracking Solution Code (Optional)10min
Slides (Optional)1min
Slides1min
Quiz3 exercícios práticos
Is there...20min
Number of Solutions for the 8 Queens Puzzle (Optional)20min
Maximum Number of Two-digit Integers2min
Semana
3
Horas para completar
5 horas para concluir

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 particular, in algorithms — for analysing correctness and running time of algorithms as well as for implementing efficient solutions. You will see that induction is as simple as falling dominos, but allows to make convincing arguments for arbitrarily large and complex problems by decomposing them and moving step by step. You will learn how famous Gauss unexpectedly solved his teacher's problem intended to keep him busy the whole lesson in just two minutes, and in the end you will be able to prove his formula using induction. You will be able to generalize scary arithmetic exercises and then solve them easily using induction....
Reading
13 vídeos (Total de 111 min), 2 leituras, 7 testes
Video13 videos
Coin Problem4min
Hanoi Towers7min
Introduction, Lines and Triangles Problem10min
Lines and Triangles: Proof by Induction5min
Connecting Points12min
Odd Points: Proof by Induction5min
Sums of Numbers8min
Bernoulli's Inequality8min
Coins Problem9min
Cutting a Triangle8min
Flawed Induction Proofs9min
Alternating Sum9min
Reading2 leituras
Slides1min
Slides10min
Quiz4 exercícios práticos
Largest Amount that Cannot Be Paid with 5- and 7-Coins10min
Pay Any Large Amount with 5- and 7-Coins20min
Number of Moves to Solve the Hanoi Towers Puzzle30min
Induction18min
Semana
4
Horas para completar
3 horas para concluir

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....
Reading
10 vídeos (Total de 53 min), 2 leituras, 9 testes
Video10 videos
Counterexamples4min
Basic Logic Constructs10min
If-Then Generalization, Quantification8min
Reductio ad Absurdum4min
Balls in Boxes4min
Numbers in Tables5min
Pigeonhole Principle2min
An (-1,0,1) Antimagic Square2min
Handshakes3min
Reading2 leituras
Slides10min
Slides1min
Quiz4 exercícios práticos
Examples, Counterexamples and Logic14min
Numbers in Boxes5min
How to Pick Socks5min
Pigeonhole Principle10min
4.5
69 avaliaçõesChevron Right
Direcionamento de carreira

60%

comecei uma nova carreira após concluir estes cursos
Benefício de carreira

83%

consegui um benefício significativo de carreira com este curso

Melhores avaliações

por JVOct 16th 2017

I really liked this course, it's a good introduction to mathematical thinking, with plenty of examples and exercises, I also liked the use of other external graphical tools as exercises.

por DGJun 30th 2018

Love the quality of thought that goes into each lesson. The professors speak with acute clarity and really demonstrate and empathy for the student to truly understand the topics!

Instrutores

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Vladimir Podolskii

Associate Professor
Computer Science Department

Sobre University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

Sobre National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru...

Sobre o Programa de cursos integrados Introduction to Discrete Mathematics for Computer Science

Discrete Math is needed to see mathematical structures in the object you work with, and understand their properties. This ability is important for software engineers, data scientists, security and financial analysts (it is not a coincidence that math puzzles are often used for interviews). We cover the basic notions and results (combinatorics, graphs, probability, number theory) that are universally needed. To deliver techniques and ideas in discrete mathematics to the learner we extensively use interactive puzzles specially created for this specialization. To bring the learners experience closer to IT-applications we incorporate programming examples, problems and projects in our courses....
Introduction to Discrete Mathematics for Computer Science

Perguntas Frequentes – FAQ

  • Ao se inscrever para um Certificado, você terá acesso a todos os vídeos, testes e tarefas de programação (se aplicável). Tarefas avaliadas pelos colegas apenas podem ser enviadas e avaliadas após o início da sessão. Caso escolha explorar o curso sem adquiri-lo, talvez você não consiga acessar certas tarefas.

  • Quando você se inscreve no curso, tem acesso a todos os cursos na Especialização e pode obter um certificado quando concluir o trabalho. Seu Certificado eletrônico será adicionado à sua página de Participações e você poderá imprimi-lo ou adicioná-lo ao seu perfil no LinkedIn. Se quiser apenas ler e assistir o conteúdo do curso, você poderá frequentá-lo como ouvinte sem custo.

Mais dúvidas? Visite o Central de Ajuda ao Aprendiz.