Scribd
Upload
36 views4 pages

Question Bank For IAT 1

The document covers fundamentals of logic, including definitions and examples of propositions, tautologies, and logical equivalences. It also includes problems related to proofs, mathematical induction, divisibility, and recursive definitions. Additionally, it discusses the well-ordering principle and provides exercises on the Fibonacci sequence and binomial/multinomial concepts.

Uploaded by

ksa23ise
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
36 views4 pages

Question Bank For IAT 1

The document covers fundamentals of logic, including definitions and examples of propositions, tautologies, and logical equivalences. It also includes problems related to proofs, mathematical induction, divisibility, and recursive definitions. Additionally, it discusses the well-ordering principle and provides exercises on the Fibonacci sequence and binomial/multinomial concepts.

Uploaded by

ksa23ise
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/ 4

Module 1: Fundamentals of Logic

1. Define the following with an example for each


(a) Proposition
(b) Compound proposition
(c) Simple proposition
(d) Tautology
(e) Contradiction
(f) Contingency
(g) Logical equivalence
(h) Direct proof
(i) Indirect proof
(j) Proof by contradiction

Problems on Tautology

2. Define tautology. Determine whether the following compound statement is a tautology or not.
{( � ∨ �) → �} ↔ {¬ � → ¬(� ∨ �)}
3. Define tautology. Show that {(� ∨ �) ∧ (� → �) ∧ (� → �)} → � is a tautology by constructing the
truth table.
4. Verify that, for any three propositions p, q, r the compound proposition.
[� → (� → �)] → [(� → �) → (� → �)] is a tautology or not.

5.show that [(pr)^(qr)][(pvq)r] is topology

6.verify that [p(qr)] [(pq)(pr)] is topology

7.by constructing the truth table show that [(p Vq) r]↔ [pr)^(qr)] is tautology
8 Show that [(� → �) ∧ (� → �)] → [(� ∨ �) → �] is a tautology.
Note: 1.”↔” this Bi conditional Symbol
2. ”’⇔ “ Equivalence symbol
Problems on logical equivalence

5. By constructing truth table show that [(� ∨ �) → �] ⟺ [(� → �) ∧ (� → �)]


6. Use Truth Tables to establish the following logical equivalences
(a) ¬(� ∨ �) ⇔ ¬� ∧ ¬�
(b) (� → �) ⇔ ¬� ∨ �
(c) (�V�) ⇔ (� ∨ �) ∧ (¬� ∨ ¬�)
(d) � ↔ � ⇔ (� ∧ �) ∨ (¬� ∧ ¬�)
(e) [� → (� ∧ �)] ⇔ [(� → �) ∧ (� → �)]

Problems on proofs of theorems

7. Give direct and indirect proof of following statements “product of two odd integer is an odd integer”.
8. Prove that for all integers ′�′ and ′�′, if � and � both odd, then � + � is an even and �� is an odd by direct proof.
9. For any two odd integers m and n, show that i) m + n is even ii) mn is odd.
10. Prove directly and indirectly that “the square of an even integer is always an even integer”.
11. Define direct and indirect proof and proof by contradiction
12. Give the proof: i) indirect proof
ii)proof by contradiction for the fallowing
If n is an odd integer, then n+9 is an even integer
18. Give the proof: i) indirect proof
ii) proof by contradiction for the fallowing
“ if n is odd integer the n+9 is an even integer”
19. Prove directly and indirectly that “the square of an even integer is always even”.

Module 2
Well ordering principle:

Every non empty subset of Z+contains a smallest element. (we often express this by saying that Z+ is well
ordered).

(Principle of Mathematical induction): Model 1


� �+1 (2�+7)
1 Prove by Mathematical induction 1.3+2.4+3.5+……………. + n(n+2) = 6
2 Prove by Mathematical induction 1+2+3+4+……n= 1/n n(n+1)
�(2�−1)(2�+1)
3.Prove by Mathematical induction 12+22+32+….+(2n-1)2= 3
for all integers n≥ 1
Mathematical induction Model 2

1. 2n > n for all integers n>=1


2. .4n <(n2-7) for all positive integers n>=0
3. Let a0=1, a1=2, a2=3 and an= an-1+an-2+an-3 for n≥ 3 prove that an≤ 3� ∀ � ∈ �+
4. By Mathematical induction. Prove that (n)! ≥ 2n−1 for all integers n≥ 1

Divisibility Problems
5. 11(n+2)+ 12(2n+1) is divisible by 133 for all positive integers
6. By Mathematical induction prove that for every positive integer n 5 divides n5-n
7 Prove that (n2+3n) is divisible by 2
Recursive and Explicit forms
1.
Obtain a recursive definition for the sequence {an} in each of the fallowing i).an=5n ii).an=2-(-1)n
2. Find an explicit formula for an=a(n-1)+n , a1=4 for n>=2
3. find an explicit definition of the sequence defined recursively as follows

4.A sequence {an} defined by recursively by a1=4, then an=an-1+n, n≥ 2

find the explicit form.

5.obtain the recursive expression of the fallowing

Fibonacci sequence

1.For n≥ 0 ��� �� denote the nth Fibonacci number Prove that

2
Binomial and Multinomial

You might also like