Scribd
Upload
10 views10 pages

Selected Solutions For Midterm Review

The document presents a series of logical proofs and mathematical statements, including the validity of conclusions based on given premises. It demonstrates the process of checking the validity of conclusions using logical reasoning, such as Modus Ponens and Modus Tollens. Additionally, it includes exercises related to set theory and properties of integers.

Uploaded by

esin tan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views10 pages

Selected Solutions For Midterm Review

The document presents a series of logical proofs and mathematical statements, including the validity of conclusions based on given premises. It demonstrates the process of checking the validity of conclusions using logical reasoning, such as Modus Ponens and Modus Tollens. Additionally, it includes exercises related to set theory and properties of integers.

Uploaded by

esin tan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Selected Solutions for

Midterm Review
Solution2
• Let E: I will complete my degree in engineering
G: I learn to play the guitar
B: I will join a heavy metal band
Fm: I will be famous
• Hence, Premise 1) E
Premise 2) G -> B
Premise 3) B -> Fm
Premise 4) E-> ┐B

• Let’s check the validness for the conclusion ┐G.


Sol2 (Validness Check for ┐G )
• Since ┐G is the conclusion, ┐G≡T. Hence, G≡F.
• It is given that E is a premise. It follows that E≡T.
• From the fact that E-> ┐B is a premise and E≡T, then ┐B≡T. Thus, B≡F.
• We can infer that G≡F, since G -> B is a premise and B≡F.
• It is possible to deduce that Fm can be either T or F, since B -> Fm is a
premise and B≡F.
• All the premises are checked and there is no contradiction. Therefore,
the conclusion of ┐G is valid.
Sol2 (Proof of ┐G )
STEP REASON
1) E From premise 1
2) E-> ┐B From premise 4
3) ┐B Modus Ponens (MP) from Step 1 & 2
4) G -> B From premise 2
5) ┐G Modus Tollens (MT) from Step 3 & 4
Sol2 (Validness Check for G)
• Alternatively, let’s check the validness of G.
• Since G is the conclusion, G≡T.
• It is given that E is a premise. It follows that E≡T.
• From the fact that E-> ┐B is a premise and E≡T, then ┐B≡T. Thus, B≡F.
• However, there is a contradiction. Consider premise 2. G -> B was
given, and we know that G≡T. We also found that B≡F which made the
premise 2 False. Hence, any premise must be true, that is a
contradiction.
• Therefore, the conclusion of G is invalid that means it is impossible to
conclude G through the given premises.
Solution3
• Let’s assume that there is a solution to the equation.
• 𝑥2 − 𝑦2 =1
1
• 𝑥 − 𝑦 𝑥 + 𝑦 = 1. It follows that 𝑥 − 𝑦 =
𝑥+𝑦
• Since 𝑥, 𝑦 ∈ 𝑍 + , 𝑥 + 𝑦 > 1 and hence, 𝑥 − 𝑦 ∉ 𝑍 + . #CONTRADICTION
Answer6
• A) False. Since there is NO integer less than EVERY integer.
• B) True. Since for EVERY integer, THERE EXISTS an integer greater than
it.
• The rest is exercise…
Answer7
• Let’s prove that 𝑎2 − 2𝑎 + 5 𝑖𝑠 𝑒𝑣𝑒𝑛 → 𝑎 𝑖𝑠 𝑜𝑑𝑑
• 𝑎2 − 2𝑎 + 5 = 2k, k ∈ 𝑍
• 𝑎 𝑎 − 2 + 5. It follows that 𝑎 𝑎 − 2 is odd. Hence, a is odd
• Prove the opposite side (𝑎 𝑖𝑠 𝑜𝑑𝑑 → 𝑎2 −2𝑎 + 5 𝑖𝑠 𝑒𝑣𝑒𝑛) as an
exercise…
Answer8
• a) We must show that 𝐴\𝐵 ∩ 𝐶 ⊂ 𝐶\B ∩ 𝐴
• Take 𝑥 ∈ 𝐴\𝐵 ∩ 𝐶. It follows that 𝑥 ∈ 𝐴\B 𝑎𝑛𝑑 𝑥 ∈
𝐶. 𝑇ℎ𝑒𝑛, 𝑤𝑒 𝑐𝑎𝑛 𝑖𝑛𝑓𝑒𝑟 𝑡ℎ𝑎𝑡 𝑥 ∈ 𝐴 𝑎𝑛𝑑 𝑥 ∉ 𝐵 𝑎𝑛𝑑 𝑥 ∈ 𝐶. 𝐻𝑒𝑛𝑐𝑒 𝑥 ∈
𝐶\B ∩ 𝐴.
• Show that 𝐴\𝐵 ∩ 𝐶 ⊃ 𝐶\B ∩ 𝐴 as an exercise…
• b) Exercise…
Answer12
• https://math.stackexchange.com/questions/213391/how-to-
construct-a-bijection-from-0-1-to-0-1

You might also like