CHRIST (Deemed to be University), Bengaluru – 560 029

Department of Mathematics
MID SEMESTER EXAMINATION – September 2023
MAT102-1 Introductory Algebra Answer key
SECTION A
Answer ALL the questions 4× 3 = 12 Marks
Q. No Questions Marks
For each of these sentences, determine whether an inclusive or or an exclusive
1. 1M
or, is intended.
(i) Experience with C++ or Java is required. Inclusive OR each
(ii) Lunch includes soup or salad. Exclusive OR
(iii) To enter the country, you need a passport or a voter registration card.
Inclusive OR
OR
Determine the truth value of the following statements.
(i) If monkeys can fly, then 1 + 1 = 3. TRUE 1M
(ii) 0 > 1 if and only if 2 > 1. FALSE
(iii) If 1 + 1 = 3, then dogs can fly. TRUE each
Write the negation of the following statements (Do not simply use the phrase “It
2.
is not the case that.”)
(i) All dogs have fleas.
Let F(x) be “x has fleas,” and let the domain of discourse be dogs. Our
original statement is ∀x F(x).
Its negation is ∃x ¬F(x). In English, this reads “There is a dog that does
not have fleas.”

(ii) There is a horse that can add.

Let H(x) be “x can add,” where the domain of discourse is horses. Then 1M
our original statement is ∃x H(x).
each
Its negation is ∀x ¬H(x). In English, this is rendered most simply as “No
horse can add.”

(iii) No monkey can speak French.

Let F(x) be “x can speak French,” and let the domain of discourse be
monkeys. Our original statement is ¬∃x F(x) or ∀x ¬F(x).
Its negation is ∃x F(x). In English this reads “There is a monkey that can
speak French.

Translate these statements into English, where R(x) is “x is a rabbit,” and H(x) is
3.
“x hops” and the domain consists of all animals.
(i) ∀x (R(x) → H(x)) 1M
If an animal is a rabbit, then that animal hops. (Alternatively, every each
rabbit hops.)
 (ii) ∃x (R(x) → H(x))
There exists an animal such that if it is a rabbit, then it hops. (Note that
this is trivially true, satisfied, for example, by lions, so it is not the sort
of thing one would say.)

(iii) ∃x (R(x) ∧ H(x))

There exists an animal that is a rabbit and hops. (Alternatively, some
rabbits hop. Alternatively, some hopping animals are rabbits.)

If 𝛼 and 𝛽 are the roots of the equation 𝑥 2 − 6𝑥 + 8 = 0, then find the values of
4. 1.5 M
The roots are 2 and 4, so here α=2 and β=4
each
(i) 𝛼2 + 𝛽 2 = 2^2+4^2 = 20
1 1 3
(ii) 𝛼 + 𝛽 = ½ +¼ = 4
OR
2
If the roots of the equation 3𝑥 + 9𝑥 + 2 = 0 are in the ratio 𝑚: 𝑛. then find
𝑚 𝑛
√ 𝑛 + √𝑚 .

3M

SECTION B
Answer ALL the questions 4 X 7 = 28 Marks

Q. No Questions Marks
5. Using the truth table, verify the distributive law of disjunction over
conjunction.
 p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r) 2M

5M

6. Are these system specifications consistent? “The router can send packets to
the edge system only if it supports the new address space. For the router to
support the new address space, it is necessary that the latest software release
be installed. The router can send packets to the edge system if the latest
software release is installed. The router does not support the new address
space.”

Let us consider the proposition:

s : The router can send packets to the edge system;
a : The router supports the new address space";
r : The latest software release is installed.

we can symbolize the argument as 4M

❖ Since a is false, the first conditional statement tells us that s must be

false.
❖ From the previous point we deduce from the third conditional statement
that r must be false.
❖ If indeed all three propositions are false, then all four specifications are 3M
true.
❖ so they are consistent.

OR
 Show that ¬(p ∨ (¬p ∧ q)) and ¬p ∧ ¬q are logically equivalent by developing
a series of logical equivalences.
Proof :
Let us consider Left hand side
1 M for
each step
=7M

7. Prove that an equation of 𝑛𝑡ℎ degree has n roots and no more.

1M

2M
 2M

2M
(second
part)

8. (i) State the converse, contrapositive, and inverse of “I go to the beach

whenever it is a sunny summer day”.
There are many ways to express the implications as its mentioned in the
textbook. From the given statement, it is clear that we can write the
following 1M
p : It is a sunny summer day
q: I go to the beach

Converse: Whenever I go to the beach, it is a sunny summer day.

3M
Contrapositive: Whenever I do not go to the beach, it is not a sunny
summer day.
 Inverse: Whenever it is not a sunny day, I do not go to the beach.

3M
(ii) Use De Morgan’s law to express the negation of “Miguel has a (with
cellphone, and he has a laptop computer.” symbolic
Migul does not have a cellphone or he does not have a laptop Explanatio
computer n)

OR
Consider these statements, of which the first three are premises, and the fourth
is a valid conclusion. “All hummingbirds are richly colored”. “No large birds
live on honey.” ”Birds that do not live on honey are dull in color.”
“Hummingbirds are small.” Let P(x), Q(x), R(x), and S(x) be the statements “x
is a hummingbird,” “x is large,” “x lives on honey,” and “x is richly colored,”
respectively. Assuming that the domain consists of all birds, express the
statements in the argument using quantifiers and P (x), Q(x), R(x), and S(x).

4M

Steps Reason

(i) ∀x(P (x) → S(x)) Premise / Hypothesis

(ii) P(a) → S(a) Universal Instantiation / Universal

specification of (i)

(iii) ∀x(¬R(x) → ¬S(x)) Premise

(iv) ¬R(a) → ¬S(a) Universal specification of (iii)

(v) S(a) → R(a) Contrapositive of (iv)

(vi) P(a) →R(a) Hypothetical Syllogism of (ii) & (v)

(vii) ¬∃x(Q(x) ∧ R(x)) Premise

(viii) Q(a) ∧ R(a) Existential specification of (vii)

 (xi) R(a) Simplification of (viii)

(x) ¬(¬R(a)) Double Negation law (ix) 3M

It’s an invalid conclusion / the argument is not valid

(Note : I have assumed that “small” is the same as “not large” and that “dull
in color” is the same as “not richly colored.” )

SECTION C
Answer ALL the questions 1 X 10 = 10 Marks
Q. No Questions Marks
9. (i) Write down the negation of the statement “ If k, m, n are integers where (k-m)
and (m-n) are odd, then (k-n) is even.”
3M
(with
It is in the form ,
symbolic
Therefore its negation is explanati
“k, m, n are integers where (k-m) and (m-n) are odd and (k-n) is not even”. on)

(ii) Let L(x, y) be the statement “x loves y,” where the domain for both x and y
consists of all people in the world. Use quantifiers to express each of these
statements.
We need to be careful to put the lover first and the lovee second as arguments in the
propositional function L.
(a) Everybody loves Jerry.
∀xL(x, Jerry)
(b) There is somebody whom everybody loves.
In this case, one lovee works for all lovers, so we have to put the
existential quantifier first: ∃y∀xL(x, y).

(c) Nobody loves everybody.

We could think of this as saying that there does not exist anyone who loves
everybody (¬∃x∀y L(x, y) ), or we could think of it as saying that for each
person, we can find a person whom he or she does not love (∀x ∃y ¬L(x, y). 7M
These two expressions are logically equivalent.

(d) There is somebody whom Lydia does not love.

∃x¬L(Lydia, x)

(e) There is somebody whom no one loves.

We are asserting the existence of an individual such that everybody fails to
love that person: ∃x∀y ¬L(y, x).
 (f) There is exactly one person whom everybody loves.
∃x∀yL(y, x)
OR
a. Disprove by providing a counter-example. “If two lines in space do not
intersect, then they must be parallel.”
Students can disprove this by giving any counterexamples.
For those who are using geometrical way

3M

b. Prove by the method of contradiction: “If the heights of two triangles are
equal, then their areas are equal.”
Proof :
Let us assume that the heights of two triangles are equal, but their areas are
not equal. 1M

Let's suppose we have two triangles, Triangle A and Triangle B, with equal heights (h),
but their areas (A_A and A_B) are not equal. Mathematically, we can represent this as:

h_A = h_B (The heights are equal)

A_A ≠ A_B (The areas are not equal)
Now, let's consider the formula for the area of a triangle, which is given by:
Area = (1/2) * base * height

For Triangle A, we can write: 2M

A_A = (1/2) * b_A * h (where b_A is the base of Triangle A)
For Triangle B, we can write:
A_B = (1/2) * b_B * h (where b_B is the base of Triangle B)

Now, we have two equations for the areas of the triangles in terms of their heights and
bases.
Since we have assumed that the heights are equal (h_A = h_B), we can write:
A_A = (1/2) * b_A * h A_B = (1/2) * b_B * h —--------(1)
3M
Now, let's consider the case where the areas are not equal, as we assumed:
A_A ≠ A_B
Substituting the expressions for A_A and A_B from (1):
(1/2) * b_A * h ≠ (1/2) * b_B * h

Simplifing it, we get, b_A ≠ b_B

This implies that the bases of the two triangles are not equal, which contradicts our
1M
initial assumption that only their heights are equal (h_A = h_B).

Therefore, we have arrived at a contradiction, which means our initial assumption that
the heights of two triangles are equal, but their areas are not equal, must be false. In
other words, if the heights of two triangles are equal, then their areas must also be equal.