Assignment 1

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Indian Institute of Technology Roorkee

Spring Semester 2023-24


MAC-102 (Discrete Mathematics)
Assignment 1

(1) Classify each of the following statements as True, False or not a valid mathematical state-
ment.
(a) An integer is a rational number.
(b) Let x denote a real number.
(c) Where is New Castle?
(d) Suppose this statement
√ is false.
(e) 4 = 2 + 2 and 7 < 50.
(f) 9 =√32 or 3.14 < π.
√ 3 2
(g) 3 is rational or (−4) √ = 16.
(h) 4 = 2 + 2 =⇒ 7 ≤ √50
(i) 4 = 2 + 2 ⇐⇒ 7 ≤ √ 50
(j) 4 ̸= 2 + 2 =⇒ 7 ≤ √50
(k) 4 ̸= 2 + 2 ⇐⇒ 7 ≤ 50
(l) If a and b are integers with a − b ≥ 0 and b − a ≥ 0 then a = b.
(m) A non-zero matrix is invertible.
n
(n) n+1 is not an integer for any n.
(2) Write down the negation of the following ststements in clear and concise english. (Do not
simply write ”It is not the case that”)
(a) x = ±1
(b) For every real number x, there is an integer n such that n > x.
(c) ∃ a planar graph that cannot be coloured with atmost four colours.
(d) For all integers a and b, there exist integers q and r such that b = aq + r.
(e) There exists an infinite set whose proper sets are all finite.
(3) Write down the converse and contrapositive of each of the following implications.
(a) If ab and ab are integers, then ac is an integer.
(b) Every Eulerian graph is connected.
(c) If there exist real numbers x and y with x ̸= y and x2 + xy + y 2 + x + y = 0, then f
is not onto.
(4) Rewrite the following statements using the quantifiers (∀, ∃) as appropriate.
(a) Not all continuous functions are differentiable.
(b) There is no largest real number.
(c) Every positive integer is the product of primes.
(d) Not every polynomial has a real root.
(5) Consider the assertions
A : For every real number x, there exists an integer n such that n ≤ x < n + 1.
B : There exists an integer n such that n ≤ x < n + 1 for every real number x.
One of these assertions is true and the other is false. Which one is which? Explain.
(6) Prove the following:
(a) There exists no smallest positive real number.
(b) There exists irrational numbers a and b such that ab is rational.
(c) Between any two rational numbers, there is another rational number.
(d) Let n be an integer. n is odd if and only if n3 is odd.
(7) (a) Suppose m and n are integers such that n2 + 1 = 2m. Prove that m is the sum of the
squares of two integers.
(b) Given that 43732 + 1 = 2(9561565), write 9561565 as the sum of squares.
(8) Write a proof or find a counterexample to the following statements:
(a) 2x2 + 3y 2 > 0 for all real numbers x and y.
1
2

(b) For each real number x, there exists a real number y such that xy = 1.
(c) a and b are real numbers with ab rational =⇒ a is rational and b is rational.
(d) Let f (n) = n2 + n + 41, then f (n) is prime.
(9) Each of the integers 31, 331, 3331, 33331, 333331, 3333331 is prime. Does this imply that
any integer comprised of a list of 3’s followed by 1 is a prime?
(10) Construct truth tables for following statements.
(a) (∼ (p∨ ∼ q)) ∧ (∼ p ∨ r)
(b) (p =⇒ (q =⇒ r)) =⇒ ((p ∧ q) ∨ r).
(11) Determine the truth value of the statement, if p, q, r, s are all true.
[p =⇒ (q∧ ∼ r)] ∨ [r ⇐⇒ (∼ s ∨ q)]
(12) (a) Show that [(p =⇒ q) ∧ (q =⇒ r)] =⇒ (p =⇒ r) is a tautology.
(b) Explain in words why the answer in above part makes sense.
(13) Check whether [p ∨ (∼ r =⇒ ∼ s)] ∨ [(s =⇒ (∼ t ∨ p)) ∨ (∼ q =⇒ r)] is a tautology,
fallacy or neither.
(14) Is p∨q (∨ denotes exclusive or) logically equivalent to ∼ (p ⇐⇒ q)?
(15) Show without using truth tables that ∼ p =⇒ (p =⇒ q) is a tautology.
(16) Simplify [∼ (p ∨ q)] ∨ [∼ p ∧ q].
(17) Prove that for any integer n ≥ 1
(a) 22n − 1 is divisible by 3.
(b) 5n + n + 1 is divisible by 7.
(18) ni=2 (xi − xi−1 ) = xn − x1 for n ≥ 2.
P
(19) Use the strong form of induction to prove that for any natural number n ≥ 2, n is either
prime or the product of prime numbers.
(20) Prove that for every integer n ≥ 2, the number of lines obtained by joining n distinct
points in the plane, no three of which are collinear is n(n−1)
2
.

You might also like