Discrete Math March 17

CF F23C CCF F59 197 E39 2F3 3E7 59AAA5 DE
1 E 2 5 D 5
F2 23CC CF5 5919 97E 392 F3E E759 9AAA5D E54 413
3C F 91 7E 392 F3 75 A 5D E5 13 CC
23 C 59 97 39 F E7 9A A5 E 41 C F2
C F5 1 E 2 3E 5 A D 5 3 C 3
CC CF5 919 97E3 392F F3E 759 9AA 5D E54 413C CCF F23C CCF
9 7 7 A 5 E
Q1
CF F591 197 E39 92F3 3E7 59A A5 DE 541 13CC CF2 23CC CF5 5919
5 9 E 3 2 F E 5 D 5 3 3 9
F5 919 7E3 92 3E 759 9AAA5D E54 413 CCF F23 CCF F59 197 7E39
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
59 97 39 F E7 9A A5 E 41 C F2 C F5 1 7E 92 3
19 E 2 3E 5 A D 5 3 C 3 C 9 97 3 F E7
19 7E3 392F F3E 759 9AA 5D E54 413C CCF F23C CCF F591 197 E39 92F3 3E7 59A
7 7 E E 5
iv.
iv.
iv.
iii.
i.
v.
iii.
ii.
i.
iii.
ii.
i.
iii.
ii.
i.
vi.
ii.
97 E39 92F3 3E7 59AAA5 5DE 541 13C CF2 23C CF5 5919 97E 392 2F3E E75 9AAA5D
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3 7 9A 5 E
E3 92F 3E 759 AA 5D E54 13C CF 23C CF 591 97E 39 2F3 E7 59A A5 DE 541
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E 59 A D 54 3C CF N.B:
S×S
S×T
T×S
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 75 A 5D E5 13 C 23
T×T
59 A DE 54 3C CF 3C CF 91 97E 39 F3 75 9A A5 E 41 CC F2 CC
AA 5D 5 13 C 23 C 59 97 3 2F E7 9A A DE 54 3C F 3C F
data set.
Is C ⊆ C?
Is C ⊆ A?
Is B ⊆ A?
6.
5.
4.
3.
2.
1.
5D E5 413 CC F23 CC F59 197 E3 92F 3E7 59A A5 5DE 54 13C CF 23C CF 591
E5 413 CC F23 CC F59 19 E3 92F 3E 59 A DE 54 13C CF 23C CF 591 97E
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
3C F 3C F 91 7E 39 F3 75 A 5D E5 13 CC F2 CC F5 19 E3 2F
CF 23C CF 59 97 39 2F3 E7 9A A5 E 41 CC F2 3C F5 919 7E 92 3E
23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 392 F3 75
CC F5 19 E3 2F 3E 59 A D 54 3C CF 3C CF 59 97 39 F3 E7 9A
F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2F E7 59A A5
𝑝 → 𝑞 = ¬𝑝 ∧ 𝑞
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
97 39 F3 E7 9A A5 E 41 C F2 C F5 19 7E 92 3E 75 AA 5D E5
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3 7 9A 5 E 41
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
Is C a proper subset of A?
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E 59 A D 54 3C CF
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 75 A 5D E5 13 C 23 Attempt any three of the following:
d. Prove the following using truth table

a. A × (B ∪C) b. (A × B) ∪(A × C)
a. Let A = {c, d, f, g}, B = {f, j}, and C = {d, g}.
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
The train is late or my watch is fast.

𝑝 ↔ 𝑞 = (¬𝑝 ∧ 𝑞) ∨ (¬𝑞 ∧ 𝑝)
𝑝 ∧ (𝑞 ∨ 𝑟) = (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟)
1
All questions are compulsory.
Sam is an orange belt and Kate is a red belt.

91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
indicate the number of elements that are in each set:

92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
Numbers to the right indicate marks.
[Time: 2½ Hours]
The connector is loose or the machine is unplugged.

41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
c. Use De Morgan’s laws to write negations for the statements below

413CCF23CCF59197E392F3E759AA5DE5
e. Let A = {a, b}, B = {1, 2}, and C = {2, 3}. Find each of the following sets.
Use of Non-programmable calculators is allowed.
Draw neat labeled diagrams wherever necessary.

Answer each of the following questions. Give reasons for your answers.
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
Answers to the same question must be written together.
Hellen is a math major and Hellen’s sister is a computer science major.
The dollar is at an all-time high and the stock market is at a record low.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
Please check whether you have got the right question paper.
E5 413 CC F23 CC F59 19 E3 92F 3E 59 A DE 54 13C CF 23C CF 591 97
Q.P. Code :00903
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97
3C F 3C F 91 7E 39 F3 75 A 5D E5 13 CC F2 CC F5 19 E
CF 23C CF 59 97 39 2F3 E7 9A A5 E 41 CC F2 3C F5 919 7E
23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3
CC F5 19 E3 2F 3E 59 A D 54 3C CF 3C CF 59 97 39
F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
b. Let S = {2, 4, 6} and T = {1, 3, 5}. Use the set-roster notation to write each of the following sets, and
97 39 F3 E7 9A A5 E 41 C F2 C F5 19 7E 92
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3
Make suitable assumptions wherever necessary and state the assumptions made.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 7
This computer program has a logical error in the first ten lines or it is being run with an incomplete
59 A DE 54 3C CF 3C CF 91 97E 39 F3 75
AA 5D 5 13 C 23 C 59 97 3 2F E7
5D E5 413 CC F23 CC F59 197 E3 92F 3E7 59
15
[ Marks:75]
E5 413 CC F23 CC F59 19 E3 92F 3E 59

41 CC F2 CC F5 19 7E 92 3E 759 A
3C F 3C F 91 7E 39 F3 75 A
CF 23C CF 59 97 39 2F3 E7 9A A
1 E 5
1 E 2 5 D 5
F2 23CC CF5 5919 97E 392 F3E E759 9AAA5D E54 413
3C F 91 7E 392 F3 75 A 5D E5 13 CC
23 C 59 97 39 F E7 9A A5 E 41 C F2
C F5 1 E 2 3E 5 A D 5 3 C 3
9 7 7 A 5 E
Q2
5 9 E 3 2 F E 5 D 5 3 3 9
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
59 97 39 F E7 9A A5 E 41 C F2 C F5 1 7E 92 3
19 E 2 3E 5 A D 5 3 C 3 C 9 97 3 F E7
7 7 E E 5
iv.
iv.
v.
iii.
ii.
i.
iii.
ii.
i.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
∴An Omnex is cheap.

A VX Roadster is cheap.
A Simbaru is not cheap.
c. No good car is cheap.

those statements that are false.
a. No good car is cheap.
d. No good car is cheap.

b. No good car is cheap.
A Rimbaud is a good car.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
∴A Simbaru is a good car.

∴A Rimbaud is not cheap.
∀x ∈D, if x is odd then x >0.

∈T means that (x –y)/3is an integer.
∴A VX Roadster is not good.
An Omnex is not a good car.

Attempt any three of the following:
∀x ∈D, if x is even then x ≤ 0.

Draw an arrow diagram for T.
Write T as a set of ordered pairs.

41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
f. Prove that for all integers n, n2− n + 3 is odd.

Write the domain and co-domain of T.
∀x ∈D, if x is less than 0 then x is even.

a. Let D = {−48, −14, −8, 0, 1, 3, 16, 23, 26, 32, 36}.
2
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
Is 3 T 0? Is 1T (−1)? Is (2,−1) ∈T? Is (3,−2) ∈T ?
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
men in the town and number of adult women in the town?

∀x ∈D, if the ones digit of x is 6, then the tens digit is
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
∀x ∈D, if the ones digit of x is 2, then the tens digit is 3 or 4.
are monogamous (no one is married to more than one other person).
c. Show that If r and s are any two rational numbers, then r+s2 is rational.
1 or 2.
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
each of the following arguments is valid or invalid, and justify your answers.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
e. Prove that for all integers m and n, m + n and m – n are either both odd or both even.
Q.P. Code :00903
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97
23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3
CC F5 19 E3 2F 3E 59 A D 54 3C CF 3C CF 59 97 39
F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
97 39 F3 E7 9A A5 E 41 C F2 C F5 19 7E 92
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F
b. Rewrite the statement “No good cars are cheap” in the form “∀x, if P(x) then ∼Q(x).” Indicate whether
f. Let E = {1, 2, 3} and F = {−2,−1, 0} and define a relation T from E to F as follows: For all (x, y) ∈E × F,(x, y)
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E
Determine which of the following statements are true and which are false. Provide counterexamples for
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 7
Also, assume that there are at least 100 adult men in the town. What is the least possible number of adult
d. In a certain town 2/3 of the adult men are married to 3/5 of the adult women. Assume that all marriages
59 A DE 54 3C CF 3C CF 91 97E 39 F3 75
AA 5D 5 13 C 23 C 59 97 3 2F E7
5D E5 413 CC F23 CC F59 197 E3 92F 3E7 59
15
E5 413 CC F23 CC F59 19 E3 92F 3E 59

41 CC F2 CC F5 19 7E 92 3E 759 A
3C F 3C F 91 7E 39 F3 75 A
CF 23C CF 59 97 39 2F3 E7 9A A
1 E 5
1 E 2 5 D 5
F2 23CC CF5 5919 97E 392 F3E E759 9AAA5D E54 413
3C F 91 7E 392 F3 75 A 5D E5 13 CC
23 C 59 97 39 F E7 9A A5 E 41 C F2
C F5 1 E 2 3E 5 A D 5 3 C 3
9 7 7 A 5 E
Q4
Q3
5 9 E 3 2 F E 5 D 5 3 3 9
f.
c.
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
a.
b.
59 97 39 F E7 9A A5 E 41 C F2 C F5 1 7E 92 3
19 E 2 3E 5 A D 5 3 C 3 C 9 97 3 F E7
7 7 E E 5
ii.
i.
e. Explain
iii.
ii.
i.
iv.
v.
ii.
i.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
v) Hamiltonian Cycle
a. Define the following:
Cardinality
Onto function
One-one function
weighted graph given below:

i) Trail ii) Connected Graph
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
Composite function
Inverse of a function
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C

Define G: R × R → R × R as follows:
G(x, y) = (y−2x) for all (x, y) ∈R × R.

41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
ii) Spanning Tree
3
Is G onto? Prove or give a counterexample.

91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
Is g onto? Prove or give a counterexample.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
d. Define g: Z → Z by the rule g(n) = 4n − 5, for all integers n.
Is G one-to-one? Prove or give a counterexample.

Prove that n! + 2 is divisible by 2, for all integers n ≥ 2.
Prove that 7n− 1 is divisible by 6, for each integer n ≥ 0.
Is g one-to-one? Prove or give a counterexample.
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
f (x)=(x + 4)2mod 5 and g(x)=(x2+ 3x + 1) mod 5. Is f = g? Explain.
iv) Hamiltonian Graph

91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
Q.P. Code :00903
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97
Let A = {0, 1, 2, 3, 4}, and define functions f : A→A and g : A→A as follows: For each x ∈ A,
23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3

CC F5 19 E3 2F 3E 59 A D 54 3C CF 3C CF 59 97 39
F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
97 39 F3 E7 9A A5 E 41 C F2 C F5 19 7E 92
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3
b. Find Shortest Path from vertex v1 to all the vertices by applying Dijkstra’s Algorithm for the complete
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 7
59 A DE 54 3C CF 3C CF 91 97E 39 F3 75
AA 5D 5 13 C 23 C 59 97 3 2F E7
5D E5 413 CC F23 CC F59 197 E3 92F 3E7 59
15
15
E5 413 CC F23 CC F59 19 E3 92F 3E 59

41 CC F2 CC F5 19 7E 92 3E 759 A
3C F 3C F 91 7E 39 F3 75 A
CF 23C CF 59 97 39 2F3 E7 9A A
1 E 5
1 E 2 5 D 5
F2 23CC CF5 5919 97E 392 F3E E759 9AAA5D E54 413
3C F 91 7E 392 F3 75 A 5D E5 13 CC
23 C 59 97 39 F E7 9A A5 E 41 C F2
C F5 1 E 2 3E 5 A D 5 3 C 3
9 7 7 A 5 E
Q5
5 9 E 3 2 F E 5 D 5 3 3 9
f.
c.
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
a.
b.
59 97 39 F E7 9A A5 E 41 C F2 C F5 1 7E 92 3
19 E 2 3E 5 A D 5 3 C 3 C 9 97 3 F E7
d. i.
ii.
7 7 E E 5
iv.
iii.
ii.
i.
iii.
ii.
i.
iii.
ii.
i.
ii.
i.
iii.
ii.
i.
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
one repeated digit?

91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
rule be used to solve this problem?


41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
4
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
numbers would not have any repeated digits?
What is the probability of obtaining no heads?

If R and S are reflexive, is R ∩ S reflexive? Why?
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C

If R and S are transitive, is R ∩ S transitive? Why?
If R and S are symmetric, is R ∩ S symmetric? Why?
e. Prove that for all integers n ≥ 2, P(n + 1, 2) − P(n, 2) = 2P(n, 1).

What is the probability of obtaining exactly one head?
What is the probability of obtaining at least one head?

What is the probability of obtaining exactly two heads?
What can you say about the initial and final vertices of P? Why?

41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97 39
coin is tossed twice and that the results of the tosses are independent.
Draw all nonisomorphic graphs with six vertices, all having degree 2.

91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F 3E 59 A D
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C
each other in order and also the letters ON next to each other in order?
e. Let S = {(0, 0), (0, 3), (1, 0), (1, 2), (2, 0), (3, 2)}. Find St, the transitive closure of S.
Q.P. Code :00903
41 CC F2 CC F5 19 7E 92 3E 759 AA 5D 54 13 C 23 C 59 97
What is the probability that a five-digit integer chosen at random is divisible by 5?
How many seven-digit telephone numbers would have at least one repeated digit?
Draw four nonisomorphic graphs with six vertices, two of degree 4 and four of degree 3.
23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3

How many five-digit integers (integers from 10,000 through 99,999) are divisible by 5?
CC F5 19 E3 2F 3E 59 A D 54 3C CF 3C CF 59 97 39
F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2
91 7E 92 F3 75 A 5D E5 13 CC 23 CC 59 19 E3 2F
97 39 F3 E7 9A A5 E 41 C F2 C F5 19 7E 92
E3 2F E 59 A D 54 3C CF 3C CF 91 7E 39 F3
92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F
F3 75 A 5 E5 41 CC F2 CC F5 19 E3 2F 3E
How many distinguishable ways can the letters of the word MILLIMICRON be arranged in order?
E7 9A A5 DE 41 3C F2 3C F5 91 7E 92 3E 7
--------------------------------------------------------------------------------------------------------------------------------------------
Bob, Cyd, and Dan. Suppose that Bob is not qualified to be treasurer and Cyd’s other commitments make
it impossible for her to be secretary. How many ways can the officers be chosen? Can the multiplication
of T . Among all the paths in S, choose a path P with the most edges. (Why is it possible to find such a P?)
f. Three officers—a president, a treasurer, and a secretary— are to be chosen from among four people: Ann,
What is the probability that a randomly chosen seven-digit telephone number would have at least
d. A coin is loaded so that the probability of heads is 0.7 and the probability of tails is 0.3. Suppose that the
How many distinguishable orderings of the letters of MILLIMICRON contain the letters CR next to
the following argument: Let T be a nontrivial tree and let S be the set of all paths from one vertex to another
How many distinguishable orderings of the letters of MILLIMICRON begin with M and end with N?
If any seven digits could be used to form a telephone number, how many seven-digit telephone
c. Prove that every nontrivial tree has at least two vertices of degree 1 by filling in the details and completing
59 A DE 54 3C CF 3C CF 91 97E 39 F3 75
AA 5D 5 13 C 23 C 59 97 3 2F E7
5D E5 413 CC F23 CC F59 197 E3 92F 3E7 59
15
E5 413 CC F23 CC F59 19 E3 92F 3E 59

41 CC F2 CC F5 19 7E 92 3E 759 A
3C F 3C F 91 7E 39 F3 75 A
CF 23C CF 59 97 39 2F3 E7 9A A
1 E 5

Discrete Math March 17

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Math March 17

Uploaded by

Copyright:

Available Formats

CF F23C CCF F59 197 E39 2F3 3E7 59AAA5 DE

d. Prove the following using truth table

The train is late or my watch is fast.

F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2F E7 59A A5

Sam is an orange belt and Kate is a red belt.

indicate the number of elements that are in each set:

The connector is loose or the machine is unplugged.

c. Use De Morgan’s laws to write negations for the statements below

CF 23C CF 59 97 39 2F3 E7 9A A5 E 41 CC F2 3C F5 919 7E 92 3E

Hellen is a math major and Hellen’s sister is a computer science major.

E5 413 CC F23 CC F59 19 E3 92F 3E 59

∴An Omnex is cheap.

c. No good car is cheap.

those statements that are false.

a. No good car is cheap.

d. No good car is cheap.

∴A Simbaru is a good car.

∀x ∈D, if x is odd then x >0.

∴A VX Roadster is not good.

An Omnex is not a good car.

∀x ∈D, if x is even then x ≤ 0.

E5 413 CC F23 CC F59 19 E3 92F 3E 59 A DE 54 13C CF 23C CF 591 97E

f. Prove that for all integers n, n2− n + 3 is odd.

∀x ∈D, if x is less than 0 then x is even.

23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 392 F3 75

men in the town and number of adult women in the town?

E5 413 CC F23 CC F59 19 E3 92F 3E 59

weighted graph given below:

Attempt any three of the following:

G(x, y) = (y−2x) for all (x, y) ∈R × R.

ii) Spanning Tree

Is G onto? Prove or give a counterexample.

Is G one-to-one? Prove or give a counterexample.

Is g one-to-one? Prove or give a counterexample.

iv) Hamiltonian Graph

23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3

E5 413 CC F23 CC F59 19 E3 92F 3E 59

one repeated digit?

rule be used to solve this problem?

Attempt any three of the following:

numbers would not have any repeated digits?

What is the probability of obtaining no heads?

92 3E 759 AA 5D E5 13 C 23 C 59 97 39 2F E7 59A A5 DE 541 3C

e. Prove that for all integers n ≥ 2, P(n + 1, 2) − P(n, 2) = 2P(n, 1).

What is the probability of obtaining at least one head?

E5 413 CC F23 CC F59 19 E3 92F 3E 59 A DE 54 13C CF 23C CF 591 97E

F5 919 7E3 92 3E 759 AA 5D E54 13 CF 23 CF 59 197 E39 2F E7 59A A5

23 C 59 197 E39 2F E7 59A A5 DE 541 3C F2 3C CF 91 7E 3

E5 413 CC F23 CC F59 19 E3 92F 3E 59

You might also like