solve tasks as described Homework 3. Logic and Induction In question 1 you have to…
- User
solve tasks as described Homework 3. Logic and Induction
In question 1 you have to choose one correct answer from the list. In question 2 you have to choose all the correct answers from the list. In questions 3 and 5 you have to write the solution. In questions 4, 6 and 7 you have to give the answer.
Question 1. Which of the following sentences is false?
A (\quad) If "Harry Potter" was written by J. Rowling then 576 is a perfect square.
B (\quad) If 576 is a perfect square then a cat can fly.
C (\quad) If a cat can fly then Isaac Newton was an ancient Greek.
D (\quad) If Isaac Newton was an ancient Greek then 'Harry Potter' was written by J. Rowling.
Question 2. Let (x) and (y) be integers. Which of the following statements are true?
A (\quad \forall x \exists y (x^2 + y^2 \text{ is a perfect square});)
B (\quad \forall x \exists y (3xy \text{ is a perfect square});)
C (\quad \exists x \forall y (xy \text{ is a multiple of 3});)
D (\quad \forall x \exists y \left( \frac{x}{y} \text{ is a prime} \right);)
E (\quad \forall x (x^2 + x + 41 \text{ is a prime}).)
Question 3. Construct the truth tables for the logical expressions:
A (\quad (\neg A \Rightarrow B) \lor (A \land \neg B);)
B (\quad (A \lor B) \Rightarrow (\neg A \land B);).
Question 4. What is the greatest number of parts that 100 circles can cut a plane into?
Question 5. Prove that for any natural number (n), there exists a number which is written with only the digits 3 and 6 and is divisible by (2^n).
Question 6. What is the greatest value of (k) such that the number (1 + 1 \cdot 1! + 2 \cdot 2! + 3 \cdot 3! + \ldots + 99 \cdot 99!) is divisible by (7^k)?
Question 7. Suppose (a_1 = 1), (a_2 = 2) and (a_n = 4a_{n-1} - 4a_{n-2}) for any (n \geq 3). What is the greatest value of (k) such that the number (a_{100}) is divisible by (4^k)? write down only the answers
- Assistant
Question 1. Answer: B
Question 2. Answers: A, B, C
Question 3.
A. Construct the truth table for ((\neg A \Rightarrow B) \lor (A \land \neg B)):
A B ¬A ¬A ⇒ B A ∧ ¬B (\¬A ⇒ B) ∨ (A ∧ ¬B) T T F T F T T F F T T T F T T T F T F F T F F F B. Construct the truth table for ((A \lor B) \Rightarrow (\neg A \land B)):
A B A ∨ B ¬A ¬A ∧ B (A ∨ B) ⇒ (¬A ∧ B) T T T F F F T F T F F F F T T T T T F F F T F T
Question 4. Answer: 9902
Question 5.
Proof that for any natural number ( n ), there exists a number composed only of digits 3 and 6 that is divisible by ( 2^n ):
We can construct such a number using the fact that any number composed of the digits 3 and 6 is even if it ends with 6. To ensure divisibility by higher powers of 2, we can append sufficient trailing 6s.
-
Base Case (( n = 1 )): The number 6 is divisible by ( 2^1 = 2 ).
-
Inductive Step: Assume that for some ( k \geq 1 ), there exists a number composed of digits 3 and 6 that is divisible by ( 2^k ). To obtain a number divisible by ( 2^{k+1} ), append a 6 to the end of this number. Since appending a 6 (which is divisible by 2) preserves the divisibility by ( 2^k ) and makes the number divisible by ( 2^{k+1} ).
By induction, for any natural number ( n ), such a number exists.
Question 6. Answer: 0
Question 7. Answer: 49
-