2020 Math Skills Seminar
Osnova sekce
-
This is the webpage of the English version of the course taught by Andreas Feldmann, which takes place on Mondays at 14:00 to 15:30. Please only register for this course and sign up for the zoom sessions below if you are registered for the English version of the Mathematical Skills seminar held by Andreas Feldmann in SIS (see link below).
-
zoom registration link URL
Please register for the zoom sessions via this link before the first lecture.
Once you registered you will obtain a confirmation email. The email contains your personal link to the zoom sessions and the passcode. You need to use this link to participate in the lectures.
-
-
Q&A Fórum
Questions by the students will be answered by the teacher (or other students)
-
-
propositions, negation, conjunction, disjunction, exclusive or, conditional, logical equivalence
-
Quiz 1 Test
-
-
different ways how to express implication in English, converse, inverse, contrapositive, biconditional, proving equivalence, De Morgan laws, propositional functions
-
Quiz 2 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
proof by contrapositive, universal and existential quantification, bound and free variables, scope of a quantification
-
Quiz 3 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
composing quantified propositions, nested quantification, scope of a quantifier, unique quantification, De Morgan laws for quantification
-
Quiz 4 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
translating mathematical statements into quantified propositions, repetition: expressing restrictions on the domain using propositions
-
Quiz 5 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
Terminology: theorem, lemma, corollary, conjecture, axiom; direct proof and indirect proof by contrapositive of implications
-
Quiz 6 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
proof by contradiction, proof of equivalence, exhaustive proof, proof by cases, without loss of generality
-
Quiz 7 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
Cantor's Theorem (proof by contradiction), the Four Colour Theorem (exhaustive proof)
-
Quiz 8 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
without loss of generality, constructive and non-constructive existence proofs (winning strategy for Chomp), pigeonhole principle
-
Quiz 9 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
generalized pigeonhole principle and applications
-
Quiz 10 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
Erdös-Szekeres theorem, Ramsey theorem, induction
-
Quiz 11 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
wrong induction "proofs", strong induction
-
Quiz 12 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
fundamental theorem of arithmetic, Fibonacci numbers, proof by picture
-
Quiz 13 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-
-
-
Quiz 14 Test
Note: you win points by answering correctly, but you can also lose points by answering incorrectly (your total points will never be below 0). This means that if you are unsure, you are better off not answering instead of guessing.
-