Discrete Mathematics HW2

1.7
6)

An odd number can be represented as 2n-1, where n is a natural number. The product of any two
odd numbers 2n-1 and 2N-1 is 4nN-2n-2N+1, which can be expressed as 2(2nN-n-N+1)-1. Since
the product of two odd numbers is always greater than zero, let's denote 2nN-n-N+1 as M. M is
a natural number greater than 0, so the product of any two odd numbers can be expressed as
2M+1, where M is a natural number, and this is an odd number.

8)

Let n=ｍ 2. If n+2=M2, then we know (n+2)-n=2=M2-m2=(M-m)(M+m). The number 2 is 2*1 and
M+m>M-m>0, which means M+m=2, M-m=1. By using these two equations, you can obtain the
result of M = 3/2. M should be natural number, so n+2 is not a perfect square.

18)

I give a proof by contraposition. If m and n are odd number, m*n is odd number by proof of
exercise 1.7.6. So, my proof is complete.

28)

An even number can be represented as 2N, where N is a natural number. So, we know
7n+4=14N+4=2(7N+2). If 7n+4 is an even number, 7n+4=2((7/2)n+2)=2N, where N is natural
number. So, (7/2)n should be a natural number and we can assume that n is even number.
Therefore I prove that if n is a positive integer, then n is even if and only if 7n + 4 is even.

1.8
6)

There are three cases. First case is that a is the smallest number. In this case, min(a,min(b,c))=a
and min(min(a,b),c)=min(a,c)=a as well. Second case is that b is the smallest number. In this case,
min(a,min(b,c))=min(a,b)=b and min(min(a,b),c)=min(b,c)=b as well. Last case is that c is the
smallest number. In this case, min(a,min(b,c))=min(a,c)=b and min(min(a,b),c)=c as well. Since one
of the three has to be smallest we have checked all the cases.

26)

Let x=1 and y=1, we know

√ x2 + y2
2 √
=
1 > x+ y = 1 . So, i conjecture that the quadratic mean is
2 2 2

always greater than or equal to the arithmetic mean. Then I have to prove
√ x2 + y2 x + y .
2
≥
2
The proof is that

√ x2 + y2 x + y
2
≥
2
 2
x+ y ( x + y )
≥
2 4
2 2 2 2
2 x +2 y ≥ x +2 xy + y

( x− y )2 ≥ 0
2
When x=y, ( x− y ) =0.

36)
3
a a
If there are coprime integer a, b and √3 2=
, then 2= 3 , 2 b3=a3. Because a is integer, a should
b b
3 3
be multiple of 2. We assume that a=2k, where k is an integer, we know that 2 b =8 k ,
3 3
b =2(2 k ). Because b is integer, b should be multiple of 2. This is contradiction with our assume,
so √ 2 is irrational.
3

2.1
8)

Each of the sets is a subset of itself. Other cases are B⊆ A ,C ⊆ A ,C ⊆ D .

20)

Let A={1}, B={{1}}.

22)

a) 0 b) 1 c) 2 d) 3

32)

It means that A=∅ or B= ∅ . If neither A nor B were empty, there should be elements of a ∈ A
and b ∈ B . But A × B= ∅ , so we know A=∅ or B= ∅ .

40)

We can assume x,y where x is in A but not in B and y is in B but not in A. Then (x,y) is an element
of A × B , but it is not an element of B× A . Therefore A × B ≠ B × A .

2.2
4)

A ⊆ B.
a) {a, b, c, d, e, f, g, h} = B b) {a, b, c, d, e} = A

c) Because of A ⊆ B, the answer is ∅. d) {f, g, h}

10)

a) A−∅ = { x| x ∈ A ∧ x ∉ ∅ }={ x∨x ∈ A ∧T }={ x∨x ∈ A }=A

b) ∅ − A={x ∨x ∈ ∅ ∧ x ∉∈ A }={x∨F ∧ x ∉ A }={x∨F }= ∅

14)

A=( A−B)∪( A ∩ B)={1 ,5 , 7 , 8 }∪{3 , 6 , 9 }={1, 3 , 5 ,6 ,7 , 8 , 9 }.

B=(B− A)∪( A ∩ B)={2 , 10 }∪{3 , 6 , 9 }={2, 3 , 6 , 9 ,10 }.
22)

a) Because of A ⊆ B, if x ∈ A , then x ∈ B . Therefore A ∪ B= { x∨x ∈ A ∧ x ∈ B }= { x|x ∈ B }=B .

b) Always A ∩ B⊆ A is true and Because of A ⊆ B, if x ∈ A , then x ∈ B . Therefore A ⊆ A ∩ B is

also true, A ∩ B= A .

32)

a) We cannot conclude that A = B. If A and B are both subsets of C but A ≠ B , it satisfies

assumption but A = B is false.

b) We cannot conclude that A = B. If A ∩C=B∩ C is true but A-C={∅ } and B-C={1,2}, it satisfies
assumption but A = B is false.

c) Considering the two conditions, We can conclude that A = B. If x ∈ U−C is true, there are two
cases. First case is x ∈ A and x ∈ B , second case is x ∉ A and x ∉ B . If x ∈ C is true, there are
two cases. First case is x ∈ A and x ∈ B , second case is x ∉ A and x ∉ B . In all possible cases(
x ∈ U−C or x ∈ C ), A equals B.
,56)
+ ¿¿
a) All the sets are subsets of A 1, which is the set of positive integers, Z . Therefore
∞ +¿ ¿ n n ∞ n
∪ i=1 A i= A 1=Z . Because of ∩ i=1 Ai ⊆ ∩
i=1 A n, ∩ i=1 A i=li mn → ∞ ∩ i=1 A n=li mn →∞ An= ∅ .
b) All the sets are subsets of the set of natural numbers N(the nonnegative integers).
∪i=1 A i= {0 , 1 , 2, … , n }, ∪i=1 A i=li mn →∞ { 0 , 1 ,2 , … , n }=N .
n ∞
Because of
∩i=1 A i= { 0 ,1 } ∩ { 0 , 2 } ∩ … ∩ { 0 , n }={0 }, ∩i=1 A i={0 }.
n ∞

c) All the sets are subsets of the set of positive real numbers R + and A1 ⊂ A 2 ⊂ A 3 ∙ ∙∙ . Therefore
∞ n +¿¿ n
∪i=1 A i=li mn → ∞ ∪ i=1 An =R , ∩ i=1 A i= A 1=(0 ,1).

d) If i≥ 1, we know Ai ⊂ A 1. Therefore ∪i=1 A i= A 1=(1 , ∞) . Because of ∩ i=1 A i ⊆ ∩i=1 A n= An ,

∞ n n

∞ n
∩i=1 A i=li mn → ∞ ∩i=1 A n=li mn →∞ An=li mn → ∞ (n , ∞ )=∅ .

2.3
6)
+ ¿¿
+ ¿× Z ¿ + ¿¿
a) The domain is the set of all pairs of positive integers, Z .The range is Z .
+ ¿¿
b) The domain is Z . The range is {1,2,3,4,5,6,7,8,9}.

c) The domain is the set of all bit strings. The range is Z.

d) The domain is given as Z+. Clearly the range is Z+ as well.

e) The domain is the set of all bit strings. The range is { λ ,1 , 11,111 , ∙∙ ∙} . it is also possible that the
string doesn't contain any 1's. In this case λ is the empty string.

8)

a) 1 b) 2 c) −1 d) 0 e) 3 f) −2 g) 1 h) 2

30)

a) {1} b) {−1, 1, 5, 9, 15} c) {0, 1, 2} d) {0, 1, 5, 16}

48)

There are three cases. First, if x is the midway between the two integers n and n+1, we know
1 1
x=n+ and ⌊ x+ ⌋ =⌊ n+ 1 ⌋ =n+1. Therefore we can conclude that when x is the midway
2 2
1
between the two integers, ⌊ x+ ⌋ is equal to the larger of two integers. Second, if x is closer to
2
1 1 1
the integer n, we know n ≤ x< n+ and n+ ≤ x+ <n+1. Therefore we can conclude that when
2 2 2
1
x is closer to the integer n, ⌊ x+ ⌋ =n. Third, if x is closer to the integer n+1, using the same
2
1
method when x=n, we can conclude that ⌊ x+ ⌋ =n+1.
2

2.4
10)

a) a 0=−1 , a1=2 , a2=−4 ,a 3=8 , a 4=−16 , a 5=32 , a6=−64

b) a 0=2 , a1=−1 , a2=−3 , a3=−2 , a 4=1 , a5=3 , a 6=2 , a7=−1

15 31 63
c) a 0=1 , a1=3 , a2 =27 , a3=2187 , a4=14348907=3 , a5=617673396283947=3 , a6=3

d) a 0=−1 , a1=0 , a 2=1 , a3=3 , a 4=13 , a5 =74 , a6 =539

e) a 0=1 , a1=1 , a2=2 , a3 =2 , a4 =1, a 5=1 , a6=2 , a7 =2 , a8=1

18)

a) Let a n represents the amount in the account at the end of n years. Then we know that
a n=1.09 an−1 and a 0=1000.
n
b) By a’s recurrence relation, the answer is a n=1000(1.09) .
100
c) a 100=1000 (1.09) ≈5,529,041 .
34) We write the sums explicitly for each case.

a) (1-1) + (1-2) + (2-1) + (2-2) + (3-1) + (3-2) = 3

b) (0+0) + (0+2) + (0+4) + (3+0) + (3+2) + (3+4) + (6+0) + (6+2) + (6+4) + (9+0) + (9+2) +
(9+4) = 78

c) (0 + 1 + 2) + (0 + 1 + 2) + (0 + 1 + 2) = 9
d) (0 + 0 + 0 + 0) + (0 + 1 + 8 + 27) + (0 + 4 + 32 + 108) = 180