Professional Documents
Culture Documents
McGraw.Hill.Discrete.Mathematics.and.Its.Applications.7th.Edition.2011:
Tools:
Xem các bước làm chứng mình bằng các lệnh equivalent law:www.mhhe.com/rosen
Source:
Kimberly Brehm
Def: propositional logic is an subject studies about how to modify and join small propositions to create more
complex propositions. It also studies about relations, properties of proposition
what is an propositional?
what is argument?
TO PROVE THAT IF THE PREMISES IS TRUE THEN THE CONCLUSION MUST BE TRUE. for example below:
when you read this, this mean that prove whenever let m and n are perfect square then mn must also be perfect
square. In general form: prove p→q means prove that let p is true then it makes q must also be true
To deprive conclusion from statements we already have, we use rules of inference which are templates for
constructing valid arguments. Rules of inference are
our basic tools for establishing the truth of statements.
an argument is compose of premises and conclusion, the conclusion must be derived from the premises
Def:
Modus ponen
Explain: If the premises p→q is true and premises p is also true then by the rule of implication , q must be true
Explain: if the premises p→q is true but the premises q is false then by the rule of implication, for p→q to be true
and q is false at the same time, p must be false
explain: https://www.youtube.com/watch?
v=HcS4lqXxrV4&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3&index=25
How to use rule of inference to derive conclusion out of extreme complex proposition , PAGE 73: Using Rules of
Inference to Build Arguments || REREAD IT
Source:
https://www.youtube.com/watch?v=28lebQ60TCc&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3&index=26
https://www.youtube.com/watch?v=CqOn_n1PoQ4&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3&index=27
use the rule of inference directly on the premises( note that let all the premises be true, dont care about there
truth value while drawing out a conclusion out the them)
https://www.youtube.com/watch?v=AJe3ATDFIjQ&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3&index=28
https://www.youtube.com/watch?v=z205Y7D40Lk&list=PLBlnK6fEyqRhqJPDXcvYlLfXPh37L89g3&index=29
An valid argument is an argument where it is impossible for all premises is true but the conclusion is false
Note:
the validity of argument are not related to the the truth value of the conclusion: argument is valid but doesn’t
imply the conclusion is true.
One of the way to check the validity of the argument is the conclusion is false and try to see if all the premises are
true. if not→valid, if can→ invalid
def:
Several common fallacies arise in incorrect arguments. These fallacies resemble rules of inference, but are
based on contingencies rather than tautologies. These are discussed here to show the distinction between
correct and incorrect reasoning
Universal instantiation:
Universal generalization
Existential instantiation:
Existential generalization:
Làm thêm nhiều bài để tìm ra phương pháp làm bài hiểu quả
Note:
The error occurs in step (5), because we cannot assume, as is being done here, that the c that makes P true is
the same as the c that makes Q true
Propositional Satisfiability:
A compound proposition is satisfiable if there is an assignment of truth values to its variables that makes it true. When no
such assignments exists, that is, when the compound proposition is false for all assignments of truth values to its variables,
the compound proposition is unsatisfiable.
Predicate logic:
def: Predicate logic composes of two part variable and predicate(property that variable holds). For example: “x is
greater than 3", x is the variable and "is greater than 3" is the predicate
The statement can involve multiple variables: Q(x,y) for x+1=y is sound
The predicate logic is different from propositional logic by “predicate doesn’t have truth value until the variable
is assign” and “propositional doesn’t have variable and its truth value is already known.
Quantifiers( định lượng): coi bên notion introduction to mathematical thinking để hiểu rõ hơn
Universal quantifier:
Def:
The universal quantification of P(x) for a particular domaiṇ( a set of value) is the proposition that asserts that P (x)
is true for all values of x in this domain
this means:
Existential quantifier:
Def:
Ex:
Note:
Why????
Statements involving predicates and quantifiers are logically equivalent if and only if they have the same truth
value no matter which predicates are substituted into these statements and which domain of discourse is used for
the variables in these propositional functions. We use the notation S ≡ T to indicate that two statements S and T
involving predicates and quantifiers are logically equivalent
Why just proving by showing p:“if A then B and if B then A” instead of including q:“ if A is F then B F and If B F
then A F” to assure that there is no case f:“ A is false when B is true”. Because if we already prove p is true,
then it also implicitly prove that q is false. By the equivalence rule:
Tautology: Is an compound proposition which is always true under any possible value
Contradiction: Is an compound proposition which is always false under any possible value
Contingency: Is an compound proposition which is sometime true and sometime false under any possible value
Satisfiability : a compound proposition is satisfiable when there is at least one case where the proposition is true in the
true table
Proof page 83
A theorem: is a statement which has been proved true by a special kind of logical argument called a rigorous
proof. Ex: Pythagoras Theorem
Axiom: In mathematics or logic, an axiom is an unprovable rule or first principle accepted as true because it is
self-evident or particularly useful. Ex: Nothing can both be and not be at the same time and in the same respect
Direct Proofs(The following discussion will give the most common techniques for proving conditional statements.
Later we will discuss methods for proving other types of statements.):
Ex:
Def:
Proofs by Contradiction:
def:
Set
Equal set:
Subsets:
Theorem 1
C1
Phương pháp: Biến đổi tương đương X thuộc A thành X thuộc B( coi trong set operation)
ex:
Ex:
Example:
union:
intersection:
Complement
Not belong
Ánh xạ (FUNCTION):
file:///C:/Users/Phung/Desktop/TaiLieudiscretemath/TaiLieuCTRR/chapter2%20[Compatibility%20Mode].pdf
Ex:
F(A)=B (F:a→b)
Def:
Tính chất:
Ảnh của hàm hợp nhỏ(f:A→B, B) bằng miền của hàm hợp lớn(g:B→C, C)
COUNTING
OVERCOUNTING
Làm bài đơn giản lại(số nhỏ lại) để đếm tay, rồi so sánh kết quả với công thức đã tìm ra
UNDERCOUNTING
Làm bài đơn giản lại(số nhỏ lại) để đếm tay, rồi so sánh kết quả với công thức đã tìm ra
đề:
NOTE:
Use sigma sign
Example:
Counting:file:///C:/Users/Phung/Desktop/TaiLieudiscretemath/TaiLieuCTRR/chapter3%20[Compatibility%20Mode].pd
Product rule:
Procedure
Ex:
Step 2: task 1→task 3 all have 26 ways(26 upper letter), task 4→6 all have 10 ways( 0,1,..,9)
step 3: 26x26x26x10x10x10
The sum rule more like a method to find number of ways for task ith in product rule
Note: whenever use SUM RULE check if Subtraction rule could be used(there is an overlap between two
ways)
def
Note:
How to use:
Ex
step3: how many card must be placed into the box in order to exist at least one box such that box is
equal or greater than [N/K] cards
step4:
note:
def
finding the number of ways to arrange a specified number of distinct elements of a set of a particular size,
where the order of these elements matters
Chỉnh hợp:
def
Có tính sắp xếp, the number of ways to arrange a subset of size k from set of size n. Hay nói theo cách
khác chỉnh hợp bằng=tông của( số tập con * số hoán vị của tập còn đó)
Đề bài theo dạng “cho 2 tập hợp hợp A và B, độ dài A nhỏ hơn B, tập B đề bài đã cho biết rõ các
phần tử bên trong và A là tập chưa xác định. Hãy tính số cách tạo tập hợp A chập k từ tập hợp B
có độ dài n, tập A có thứ tự(ordered set) và các phần tử không lặp lại.
Ex:
Def:
The number of ways to choose a subset of size k from set of size n unorderedly. Hay nói theo cách khác
là số tập con của một tập hợp
Hiểu sâu:
Cho 2 tập B và A, độ dài tập A nhỏ hơn tập B, tập A chưa xác định, các phần tử trong tập B đã
được xác định. Hãy tính số cách tạo ra tập A chập k từ tập B có độ dài n. Tập A không có thứ
tự(unordered set)
Ex:
PP1:
3. Kiểm tra xem kết quả đếm bằng tay giống kết quả của chỉnh hợp, tổ hợp,…..
2. Check if the number of way to create A from B follow What type of counting technique
Ex:
Tập B là vị trí các bit của dãy n bits{1,2,3,…,n}. Tập A là tập không thứ tự có độ dài là r(Nếu phần
tử 1 của B thuộc A ⇒ vị trí 1 sẽ có bit 1)⇒ Bài toán có thể ép theo tổ hợp
Def: number of way to create subset A with size of k from set B size of n. The subset A can be repeated and must be
unordered.
Formula:
https://www.youtube.com/watch?v=Z1Lk7rTLzs0&t=272s
C1: cứ mỗi lần gặp thì nghĩ tới phần deeper understanding(qui về | và *) ⇒ giúp hiểu sâu hơn
C2: qui về X1+X2+X3=k. x1≥0,x2≥0,x3≥0,..xn≥0
Def:
Ex:
Formula
C1:
Ex: instead of using the product rule to directly count, count the number of cases have no @