Suppose that $A, B$ and $C$ are sets. For each of the following statements either prove it is true or give a counterexample to show that it is not. By $X \subsetneq Y$ we mean that $X$ is a proper subset of $Y: X \subseteq Y$ and $X \neq Y$.
(a) $A \in B \wedge B \in C \Longrightarrow A \in C$
(b) $A \subseteq B \wedge B \subseteq C \Longrightarrow A \subseteq C$
(c) $A \subsetneq B \wedge B \subsetneq C \Longrightarrow A \subsetneq C$
(d) $A \in B \wedge B \subseteq C \Longrightarrow A \in C$
(e) $C \in \mathcal{P}(A) \Longleftrightarrow C \subseteq A$
(f) $A=\emptyset \Longleftrightarrow \mathcal{P}(A)=\emptyset$
直接用集合的包含关系做基本的计算即可验证
Which of the following conditions imply that $B=C ?$ In each case, either prove or give a counterexample.
(a) $A \cup B=A \cup C$
(b) $A \cap B=A \cap C$
(c) $A \oplus B=A \oplus C$
(d) $A \times B=A \times C$
直接用集合的包含关系做基本的计算即可验证
Suppose that $A, B$ and $C$ are sets. For each of the following statements either prove it is true or give a counterexample to show that it is not.
(a) $A \backslash(B \cup C)=(A \backslash B) \cup(A \backslash C)$
(b) $(A \backslash B) \times C=(A \times C) \backslash(B \times C)$
(c) $(A \oplus B) \times C=(A \times C) \oplus(B \times C)$
(d) $(A \cup B) \times(C \cup D)=(A \times C) \cup(B \times D)$
直接用集合的包含关系做基本的计算即可验证
(a) List, in lexicographic order, the first six strings, of ${a, b c}^{}-{a b c}^{} . \quad($ Assume $a<b<c .)$ (b) Consider the language of all binary strings whose first two characters are the same as the string’s last two characters. (Say that a string must have at least two character to satisfy this condition.) Find a way to write this language by combining finite sets (written {list-of-strings}) with union, concatenation, and star (written $\cup, \circ, *$ ). Of course you can use parentheses to make the order of operations clear. (The convention is star, then concatenation, then union.)
*5. A stupid math teacher tells Zack to write down every positive integer from 1 to 99999 . Numbers are to be written in the usual way, with no leading zeros. In carrying out this tedious exercise, how many times will Zach write the digit 1? Find an easy way to get to the answer.
*6. Find a picture-proof (in the spirit of those in Lecture 5) that $\frac{1}{4}+\frac{1}{16}+\frac{1}{64}+\frac{1}{256}+\cdots=\frac{1}{3}$.
画一个2D的图即可
real analysis代写analysis 2, analysis 3请认准UprivateTA™. UprivateTA™为您的留学生涯保驾护航。
概率论代考
离散数学代写
ECS20.A – Discrete Mathematics for Computer Science – Winter 2022
Announcements (page last updated 03/01/2022 at 3pm)
- It’s March—and week-9. How on earth did that happen?
- Q3 was not good. I will go over it in a special online session tomorrow, Wednesday, at 7pm.
- I postponed Q4 to Monday. Your last quiz. It will be open 7am-7pm. Administered once again on Gradescope.
Course information
- Syllabus – Key information – read it all
- Schedule – Lecture summaries accrue throughout the term
- When and where – Office hours and more – Subject to frequent change
- Zoom link – We use the same Zoom meeting room for everything
- Sample grading rubric – Not used for every problem
- Midterm instructions – Make sure to have a working camera
Services we use
- Canvas – Recorded lectures and more
- Piazza – For questions and announcements
- Gradescope – To turn in homework
- Overleaf – To typeset your homeworks and, optionally, to collaborate on them
- zyBook – S. Irani
- Discord page – Like Piazza, but run by students
Problem sets
- PS1 and PS1 Solutions
- PS2 and PS2 Solutions
- PS3 and PS3 Solutions
- PS4 and PS4 Solutions
- PS5 and PS5 Solutions
- PS6 and PS6 Solutions
- PS7 (due March 2 at 5pm)
Exams and practice exams
- MT Grading notes
- MT.2008 (MT itself on Gradescope) MT.2008 Solutions – practice exam
- MT.2013 and MT.2013 Solutions – practice exam
- Practice MT from Fall 2021 – yet another
Similar classes
- P. Koehl’s ECS17 from 2022.Winter – Non-major alternative to ECS20
- P. Rogaway’s ECS20 from 2021 (lectures), 2013 (lectures), 2008 (lectures), and 2000 (lectures)
- R. DeSouza’s ECS20 from 2019
- A. Meyer and A. Clipala’s MIT.6042J.2015
- T. Leighton and M. van Dijk’s MIT.6042J.2010
- G. Aloupis’s Tufts.Comp.61.2013
Books
- zyBook: ECS 020: Discrete Mathematics for Computer Science – S. Irani
- Mathematics for Computer Science (pdf) (The MIT Book) (E. Lehman, T. Leighton, A. Meyer)
- Book of Proof by R. Hammack.
Writing
- Technical Writing for Computer Scientists by M. Bellare
- Introduction to mathematical arguments (M. Hutching) (26 pages)
LaTeX
- sample.tex LaTeX file and the sample.pdf it yields
- example.tex John’s LaTeX file and the example.pdf it yields
- LaTeX tutorial that a TA recommended (but the accent should fall on the first syllable; LAY-tek)
- Quick LaTeX reference written for ECS132
Further resources
- A Mathematician’s Lament (P. Lockhart, 2002) – So rare and wonderful when another human says what I think!
- Expanded course description – Nominal definition of course contents
- ECS20 movie-day films from 2021.Spring
- Twosday puzzle – From our 2/22/2022 22:220 session – Including student solutions