Discrete Mathematics

Assignment 4
Gur Prasad Srivastava
cs23m511
Pages 110-111
Problems 9,19,33,41
Pages 132-134
Problems 5,9,21,33,37
Page 141
Problem 1

9. Use a proof by contradiction to prove that the sum of an irrational number and a
rational number is irrational.

Let r be a rational number

Let i be a irrational number

Proposition to be proven is
s = r + i is an irrational number
To prove this by contradiction, we suppose that s is a rational number

Axiom - The difference between two rational numbers always is a rational number

To prove this also assume 2 rational numbers which are represented by (1) a/b and (2)
c/d with a,b,c,d being integers and b,d not equal to 0.

Then:

a c ad bc (ad - bc)
— - — = —- - —- = —————
b d bd bd bd

Since ad, bc, and bd are integers since integers are closed under the operation of
multiplication and ad-bc is an integer since integers are closed under the operation of
subtraction, then (ad-bc)/bd is a rational number since it is in the form of 1 integer
divided by another and the denominator is not equal to 0 since b and d were not equal to
0. Thus a/b - c/d is a rational number.
Here we conclude that rational numbers are closed in subtraction.
So, s - r is also a rational number
But if we subtract r from our original equation
s-r= r+i-r
Which mean
s=i
This indicates that s is a rational number so there is a contradiction to our assumption that i is
irrational so our assumption that s is an irrational number is incorrect hence we prove that s is
an irrational number.
19. Show that if n is an integer and n3 + 5 is odd, then n is even
using
a) a proof by contraposition.
b) a proof by contradiction.

(a) using a proof by contraposition [ P → Q = ~Q → ~P]

Now we need to prove that If n is odd then n3 + 5 is even

Let’s assume that n is odd. Then we can say n = 2k + 1 for some integer k.
Then
n3 + 5 = (2k + 1)3 + 5 = 8k3 + 12k2 + 6k + 1 + 5 = 2(4k3 + 6k2 + 3k + 3) which means this is an
even number. So our statement becomes true that if n is odd then n3 + 5 is even and then its
contrapositive is also true which proves that if n is an integer and n3 + 5 is odd, then n is even.

(b) using a proof by contradiction

Suppose that n3 + 5 is odd and n is also odd. We know that the multiplication of 2 odd numbers
is also an odd number. Now since n is odd, we know that n2 is also odd (n x n) and from here we
know that n3 is also odd (n2 x n). This makes it clear that n3 + 5 is also odd. Now, We also know
that the difference between two odd numbers is always even. Now we subtract n3 from n3 + 5
we get 5 which is not an even number and is a contradiction. So we conclude that n is not odd.
Hence we conclude that if n is an integer and n3 + 5 is odd, then n is even.

33. Show that these statements about the integer x are equivalent:
(a) 3x + 2 is even
(b) x + 5 is odd
(c) x2 is even.

We will prove all statements are true for both when x is even and when x is odd

First we suppose x is even then we can say x = 2k for some integer

3(2k) +2 = 2(3k+1) which is even
2k + 5 = 2(k+2) + 1 which is odd
(2k)2 = 4k2 = 2(2k2) which is even

Now we also need to prove that all statements are true when x is odd. For that we try to prove
using its contrapositive: Q → P = ~P → ~Q
assume that x is odd then x = 2k + 1
3(2k + 1) + 2 = 6k + 3 + 2 = 2(3k +2) + 1 which is odd
(2k + 1) + 5 = 2(k+3) which is even
(2k + 1)2 = 4k2 + 1 + 4k = 2(2k2 + 2k) + 1 which is odd.

So we can now claim that all these statements about the integer x are equivalent.
41. Prove that at least one of the real numbers a1, a2,...,an is greater than or equal to the
average of these numbers. What kind of proof did you use?

We will use Proof by contradiction here.

Let’s assume A be the average of these numbers i.e.
(1) A = (a1 + a2 + ... + an) / n
Assume there are no numbers greater than or equal to the average of the real numbers a1,
a2,...,an.
i.e.
ai < A for all i = 1,2,...n
i.e. a1 < A ; a2 < A ; .. ; an < A
Which indicates
a1 + a2 + .. + an < n.A
i.e.
(a1 + a2 + ... + an) / n < A

From (1)
A<A
which is a contradiction so our assumption is false and there is at least one of the real numbers
a1, a2, …, an is greater than or equal to the average of these numbers.

Pages 132-134
Problems 5,9,21,33,37

Q5 Prove that if x and y are real numbers, then max(x, y) + min(x, y) = x + y. [Hint: Use a
proof by cases, with the two cases corresponding to x ≥ y and x<y, respectively.]

Using proof by cases, first case to be considered x ≥ y

Here max(x,y) will be x and min(x,y) will be y as x ≥ y.
so therefore,
max(x,y) + min(x,y) = x + y as desired.
Now considering case x < y
Here max(x,y) is y and min(x,y) will be x
So therefore,
max(x,y) + min(x,y) = y + x = x + y as desired.
So in all cases we get the same result hence it is proven that
if x and y are real numbers, then max(x, y) + min(x, y) = x + y.
Q9 Prove the triangle inequality, which states that if x and y are real numbers, then
|x|+|y|≥|x + y| (where |x| represents the absolute value of x, which equals x if x ≥ 0 and
equals −x if x < 0).

To provide this we will have to consider all possible combinations of x and y i.e. x and y are +ves
and -ves and then in each x ≥ y and x < y and if in all cases we are able to prove that |x|+|y|≥|x +
y| then we can say that we have a proof.

Let’s go case by case

1. x is +ve and y is +ve
|x|+|y| = x + y = |x + y| - supports proof.
2. x is -ve and y is -ve
|x|+|y| = ( – x ) + ( – y ) = – ( x + y ) = |x + y| - supports proof.
3. x is +ve and y is -ve
a. x ≥ – y [note: y is a negative number here]
x+y≥0
So |x + y| = x + y (by definition of |x| given in the question)
Now, x + y where y is negative number is a quantity smaller than x
On the other hand, |x| + |y| = x + |y| is a positive number bigger than x
means , |x + y| < x < |x| + |y|

b. x < – y [note: y is a negative number here]

|x + y| = – ( x + y ) = ( – x) + ( – y) : this number is smaller than equal to (
– y) because ( – x) is a non-positive quantity
|x| + |y| = |x| + ( – y) is a positive number which is bigger than equal to ( –
y)
So, we have |x + y| ≤ ( – y ) ≤ |x| + |y|

Now we can repeat the entire 3rd case with x and y swapped but addition is commutative so x
and y can be used for proof interchangeably.
Hence we conclude the proof as we have shown equivalence in all possible cases.

Q21 Show that if n is an odd integer, then there is a unique integer k such that n is the
sum of k − 2 and k + 3.

Given: n is an odd integer

To prove: There exists a unique integer k such that n is the sum of k−2 and k+3.
First We have to Prove Existence and Then we will prove Uniqueness.
We will first determine an integer k for which the statement holds.
n = (k − 2) + (k + 3)
n = 2k + 1
Thus k = (n – 1)/2
Now we need to check that this value is also an integer.
Since n is an odd integer, there exists an integer y such that: n = 2y + 1
From this, we substitute this value into n in above equation
k = (2y + 1 – 1)/2
k=y
This proves k is an integer.
To Prove uniqueness let y be an integer such that
n = (y – 2) + ( y + 3)
But we know there exist k such that n = (k – 2) + (k +3)
So,
(k − 2) + (k + 3) = (y – 2) + ( y + 3)
2k + 1 = 2y + 1
k = y.
This proves that if n is odd then there is a unique integer k such that n is the sum of k − 2 and k
+ 3.

Q33 Prove that there are no solutions in positive integers x and y to the equation x4 + y4 =
625.

As x and y are positive integers, and 625 can be written as 54; we check from 1 to 4 if the sum
of x4 and y4 could be 625. As 44 = 256 so even if x and y both are 4 then also their sum is 512
which is less than 625. So it is clear that x4 + y4 = 625 has no solution.

Q37 Prove that between every two rational numbers there is an irrational number.

Assume x and y are two arbitrary rational numbers such that y > x
We assert that z = x + (y – x) / √2 is an irrational number that lies between x and y.

1/√2 is an irrational number number that lies between 0 and 1

0 < 1/√2 < 1

Now as y > x that means y – x > 0

0 < 1/√2 (y – x) < (y – x)
Adding x in all terms we get

x < x + (y – x) / √2 < x + (y – x)
i.e.
x < x + (y – x) / √2 < y

This means z = x + (y – x) / √2 lies between x and y.

Page 141 Q1
(1) Q ^ (P V ~Q)

P Q Q ^ (P V ~Q)

T T T

T F F

F T F

F F F

1. Disjunctive Normal Form

Q ^ (P V ~Q)
Open brackets
(Q ^ P) V (Q ^ ~Q) is DNF
2. Conjunctive Normal Form = (Q) ^ (P V ~Q) is already in conjunctive normal form
3. Principal Disjunctive Normal Form
Q ^ (P V ~Q)
(Q ^ P) V (Q ^ ~Q)
(Q ^ P)
Principal Disjunctive Normal Form = (Q ^ P)
4. Principal Conjunctive Normal Form
Q ^ (P V ~Q)
(Q V (P ^ ~P)) ^ (P V ~Q)
(Q V P) ^ (Q V ~P) ^ (P V ~Q) is PCNF