Q. P.

Code:

(2½ Hours)
[Total Marks: 75]

N. B.: (1) All questions are compulsory.

(2) Make suitable assumptions wherever necessary and state the assumptions made.
(3) Answers to the same question must be written together.
(4) Numbers to the right indicate marks.
(5) Draw neat labeled diagrams wherever necessary.
(6) Use of Non-programmable calculators is allowed.

1. Attempt any three of the following: 15

a. Define Universal Existential Statement and Existential Universal Statement. Give
examples of each.
Solution: A universal existential statement is a statement that is universal because its first
part says that a certain property is true for all objects of a given type, and it is
existential because its second part asserts the existence of something.
e.g.
All real numbers have additive inverses.
Or: For all real numbers r , there is an additive inverse for r .
Or: For all real numbers r, there is a real number s such that s is an additive inverse
for r.
An existential universal statement is a statement that is existential because its first
part asserts that a certain object exists and is universal because its second part says
that the object satisfies a certain property for all things of a certain kind.
Some positive integer is less than or equal to every positive integer.
Or: There is a positive integer m that is less than or equal to every positive integer.
Or: There is a positive integer m such that every positive integer is greater than or
equal to m.
Or: There is a positive integer m with the property that for all positive integers
n,m ≤ n.

b. Define Cartesian product. Let R denote the set of all real numbers. Describe R x
R.
Solution Given sets A and B, the Cartesian product of A and B, denoted A × B and read
“A cross B,” is the set of all ordered pairs (a, b), where a is in A and b is in B.
Symbolically:
A × B = {(a, b) | a ∈ A and b ∈ B}.
R × R is the set of all ordered pairs (x, y) where both x and y are real numbers. If
horizontal and vertical axes are drawn on a plane and a unit length is marked off,
then each ordered pair in R × R corresponds to a unique point in the plane, with
the first and second elements of the pair indicating, respectively, the horizontal and
vertical positions of the point. The term Cartesian plane is often used to refer to a
plane with this coordinate system, as illustrated in Figure:
 Q. P. Code:

Figure: A Cartesian Plane

c. Find the number of integers between 1 and 250 that are divisible by 2 or 3 or 5 or
7.
Ans: 193
d. Prove that (𝐴 ∪ 𝐵) ∩ (𝐴 ∩ 𝐵)′ = (𝐴 − 𝐵) ∪ (𝐵 − 𝐴)
Solution 𝐿𝐻𝑆 = (𝐴 ∪ 𝐵) ∩ (𝐴 ∩ 𝐵)′
= (𝐴 ∪ 𝐵) ∩ (𝐴′ ∪ 𝐵 ′ ) De Morgan’s Law
= [𝐴 ∩ (𝐴′ ∪ 𝐵 ′ )] ∪ [𝐵 ∩ (𝐴′ ∪ 𝐵 ′ )] Distributive Law
′) ′ ′ ′
= [(𝐴 ∩ 𝐴 ∪ (𝐴 ∩ 𝐵 )] ∪ [(𝐵 ∩ 𝐴 ) ∪ (𝐵 ∩ 𝐵 )] Distributive Law
= [∅ ∪ (𝐴 ∩ 𝐵 ′ )] ∪ [∅ ∪ (𝐵 ∩ 𝐴′ )]
= (𝐴 ∩ 𝐵 ′ ) ∪ (𝐵 ∩ 𝐴′ )
= (𝐴 − 𝐵) ∪ (𝐵 − 𝐴)
= 𝑅𝐻𝑆
e. Write the negation of each of the following statements as simply as possible:
i. If she works, she will earn money.
ii. He swims if and only if the water is warm.
iii. If it snows, then they do not drive the car.
iv. John is 6 feet tall and he weighs at least 120 kg.
v. The train was late or Amol’s watch was slow.
Solution i. She works or she will not earn money.
ii. He swims if and only if the water is not warm.
iii. It snows and they drive the car.
iv. John is not 6 feet tall or he weighs less than 120 kg.
v. The train was not late and Amol’s watch was not slow.
f. Define the following:
i. Argument, Premises
ii. Syllogism
iii. Explain Modus Ponens and Modus Tollens with examples.
Solution i. An argument is a sequence of statements, and an argument form is a
sequence of statement forms. All statements in an argument and all
statement forms in an argument form, except for the final one, are called
premises (or assumptions or hypotheses). The final statement or statement
form is called the conclusion. The symbol ∴, which is read “therefore,” is
normally placed just before the conclusion.
 Q. P. Code:
ii. An argument form consisting of two premises and a conclusion is called a
syllogism. The first and second premises are called the major premise and
minor premise, respectively.
iii. The most famous form of syllogism in logic is called modus ponens. It has
the following form:
If p then q.
p
∴q
Here is an argument of this form:
If the sum of the digits of 371,487 is divisible by 3,
then 371,487 is divisible by 3.
The sum of the digits of 371,487 is divisible by 3.
∴ 371,487 is divisible by 3.
The term modus ponens is Latin meaning “method of affirming” (the
conclusion is an affirmation).

Another valid argument form is called modus tollens. It has the following
form:
If p then q.
∼q
∴ ∼p
Here is an example of modus tollens:
If Zeus is human, then Zeus is mortal.
Zeus is not mortal.
∴ Zeus is not human.
Modus tollens is Latin meaning “method of denying” (the conclusion is a
denial).

2. Attempt any three of the following: 15

a. Let
Q(n) be “n is a factor of 8,”
R(n) be “n is a factor of 4,”
S(n) be “n < 5 and n ≠ 3,”
and suppose the domain of n is Z+, the set of positive integers. Use the ⇒ and ⇔
symbols to indicate true relationships among Q(n), R(n), and S(n).
Solution 1. The truth set of Q(n) is {1, 2, 4, 8} when the domain of n is Z+.
The truth set of R(n) is {1, 2, 4}. Thus it is true that every element in the truth set
of R(n) is in the truth set of Q(n), or, equivalently, ∀n in Z+, R(n) → Q(n). So
R(n) ⇒ Q(n), or, equivalently
n is a factor of 4 ⇒ n is a factor of 8.
2. The truth set of S(n) is {1, 2, 4}, which is identical to the truth set of R(n), or,
equivalently,
∀n in Z+, R(n) ↔ S(n). So R(n) ⇔ S(n), or, equivalently,
n is a factor of 4 ⇔ n < 5 and n ≠ 3.
 Q. P. Code:
Moreover, since every element in the truth set of S(n) is in the truth set of Q(n), or,
equivalently, ∀n in Z+, S(n) → Q(n), then S(n) ⇒ Q(n), or, equivalently,
n < 5 and n ≠ 3 ⇒ n is a factor of 8.
b. Define necessary and sufficient conditions and only if as applied to universal
conditional statements. Rewrite the following statements as formal and informal
quantified conditional statements. Do not use the word necessary or sufficient.
i. Squareness is a sufficient condition for rectangularity.
ii. Being at least 35 years old is a necessary condition for being President
of the United States.

Solution • “∀x, r (x) is a sufficient condition for s(x)” means “∀x, if r (x) then s(x).”
• “∀x, r (x) is a necessary condition for s(x)” means “∀x, if ∼r (x) then ∼s(x)”
or, equivalently, “∀x, if s(x) then r (x).”
• “∀x, r (x) only if s(x)” means “∀x, if ∼s(x) then ∼r (x)” or, equivalently, “∀x,
if r (x) then s(x).”
i. A formal version of the statement is
∀x, if x is a square, then x is a rectangle.
Or, in informal language:
If a figure is a square, then it is a rectangle.
ii. Using formal language, you could write the answer as
∀ people x, if x is younger than 35, then x cannot be President of the United States.
Or, by the equivalence between a statement and its contrapositive:
∀ people x, if x is President of the United States, then x is at least 35 years old.
c. A college cafeteria line has four stations: salads, main courses, desserts, and
beverages. The salad station offers a choice of green salad or fruit salad; the main
course station offers spaghetti or fish; the dessert station offers pie or cake; and
the beverage station offers milk, soda, or coffee. Three students, Uta, Tim, and
Yuen, go through the line and make the following choices:
Uta: green salad, spaghetti, pie, milk
Tim: fruit salad, fish, pie, cake, milk, coffee
Yuen: spaghetti, fish, pie, soda
Write each of following statements informally and find its truth value.
i. ∃ an item I such that ∀ students S, S chose I.
ii. ∃ a student S such that ∀ items I, S chose I.
iii. ∃ a student S such that ∀ stations Z, ∃ an item I in Z such that S chose I.
iv. ∀ students S and ∀ stations Z, ∃ an item I in Z such that S chose I.
Solution i. There is an item that was chosen by every student. This is true; every student
chose pie.
ii. There is a student who chose every available item. This is false; no student
chose all nine items.
iii. There is a student who chose at least one item from every station. This is
true; both Uta and Tim chose at least one item from every station.
iv. Every student chose at least one item from every station. This is false; Yuen
did not choose a salad.
 Q. P. Code:
d. Define a prime number and composite number. Give symbolic definitions of the
same. Disprove the following by giving two counter examples:
i. For all real numbers a and b, if a < b then a2 < b2.
ii. For all integers n, if n is odd then (n – 1)/2 is odd.
iii. For all integers m and n, if 2m + n is odd then m and n are both odd.
Solution An integer n is prime if, and only if, n>1 and for all positive integers r and s, if
n=rs, then either r or s equals n. An integer n is composite if, and only if, n>1 and
n=rs for some integers r and s with 1<r<n and 1<s<n.
In symbols:
n is prime ⇔ ∀positive integers r and s, if n = rs
then either r = 1 and s = n or r = n and s = 1.
n is composite ⇔ ∃positive integers r and s such that n = rs and 1 < r < n and
1 < s < n.
i. a = – 2 , b = 1; a = – 3 , b = 2 (Any values can be taken)
ii. n=5; n=7 (Any values can be taken)
iii. m=2, n=1; m=4, n=3 (Any values can be taken)
e.
Solution If n and d are integers and d _= 0 then
n is divisible by d if, and only if, n equals d times some integer.
Instead of “n is divisible by d,” we can say that
n is a multiple of d, or
d is a factor of n, or
d is a divisor of n, or
d divides n.
The notation d | n is read “d divides n.” Symbolically, if n and d are integers and
d ≠ 0:
d | n ⇔ ∃an integer k such that n = dk.
Proof: Suppose a, b, and c are any integers such that a | b and a | c. [We must show
that a | (b + c).]
By definition of divides, b = ar and c = as for some integers r and s. Then
b + c = ar + as = a(r + s) by algebra.
Let t = r + s. Then t is an integer (being a sum of integers),
and thus b + c = at where t is an integer. By definition of divides, then, a | (b + c)
[as was to be shown].
Similarly,
Suppose a, b, and c are any integers such that a | b and a | c. [We must show that a
| (b + c).]
By definition of divides, b = ar and c = as for some integers r and s. Then
b - c = ar - as = a(r - s) by algebra.
Let t = r - s. Then t is an integer (being a sum of integers),
 Q. P. Code:
and thus b - c = at where t is an integer. By definition of divides, then, a | (b - c)
[as was to be shown].

f. Use the quotient-remainder theorem with d = 3 to prove that the product of any
three consecutive integers is divisible by 3. Use the mod notation to rewrite the
result
Solution Proof: Suppose n, n + 1, and n + 2 are any three consecutive integers. [We must
show that n(n + 1)(n + 2) is divisible by 3.]
By the quotient-remainder theorem, n can be written in one of the three forms, 3q,
3q + 1, or 3q + 2 for some integer q. We divide into cases accordingly.
Case 1 (n = 3q for some integer q): In this case,
n(n + 1)(n + 2)
= 3q(3q + 1)(3q + 2) by substitution
= 3· [q(3q + 1)(3q + 2)] by factoring out a 3.
Let m = q(3q + 1)(3q + 2).
Then m is an integer because q is an integer, and sums and products of integers are
integers. By substitution,
n(n + 1)(n + 2) = 3m where m is an integer.
And so, by definition of divisible, n(n + 1)(n + 2) is divisible by 3.
Case 2 (n = 3q + 1 for some integer q): In this case,
n(n + 1)(n + 2)
= (3q + 1)((3q + 1) + 1)((3q + 1) + 2)
by substitution
= (3q + 1)(3q + 2)(3q + 3)
= (3q + 1)(3q + 2)3(q + 1)
= 3· [(3q + 1)(3q + 2)(q + 1)] by algebra.
Let m = (3q + 1)(3q + 2)(q + 1). Then m is an integer because q is an integer,
and sums and products of integers are integers. By substitution,
n(n + 1)(n + 2) = 3m where m is an integer.
And so, by definition of divisible, n(n + 1)(n + 2) is divisible by 3.
Case 3 (n = 3q + 2 for some integer q): In this case,
n(n + 1)(n + 2)
= (3q + 2)((3q + 2) + 1)((3q + 2) + 2)
by substitution
= (3q + 2)(3q + 3)(3q + 4)
= (3q + 2)3(q + 1)(3q + 4)
= 3· [(3q + 2)(q + 1)(3q + 4)] by algebra
 Q. P. Code:
Let m = (3q + 2)(q + 1)(3q + 4). Then m is an integer because q is an integer,
and sums and products of integers are integers. By substitution,
n(n + 1)(n + 2) = 3m where m is an integer.
And so, by definition of divisible, n(n + 1)(n + 2) is divisible by 3.
In each of the three cases, n(n + 1)(n + 2) was seen to be divisible by 3. But by
the quotient-remainder theorem, one of these cases must occur. Therefore, the
product of any three consecutive integers is divisible by 3.
For all integers n, n(n + 1)(n + 2) mod 3 = 0.

3. Attempt any three of the following: 15

a. i. Write the following as a single summation:
𝑛 𝑛

3 ∑(2𝑘 − 3) + ∑(4 − 5𝑘)

𝑘=1 𝑘=1
ii. Write the following as a single product:
𝑛 𝑛
𝑘 𝑘+1
(∏ ) ∙ (∏ )
𝑘+1 𝑘+2
𝑘=1 𝑘=1
iii. Find 1(1!) + 2(2!) + 3(3!) + ⋯ + 𝑚(𝑚‼); 𝑚 = 2
iv. Find
1 2 3 𝑘
( )( )( )…( );𝑘 = 3
1+1 2+1 3+1 𝑘+1
v. Prove that for all nonnegative integers n and r with r + 1 ≤ n,
𝑛 𝑛−𝑟 𝑛
( )= ( )
𝑟+1 𝑟+1 𝑟
Solution i. ∑𝑛𝑘=1(𝑘 − 5)
𝑘
ii. ∏𝑛𝑘=1
𝑘+2
iii. 5
iv. ¼
v.

b. Prove that 72𝑛 + (23𝑛−3 )(3𝑛−1 ) is divisible by 25 ∀𝑛 ∈ 𝑁

 Q. P. Code:
Solution

c. Determine the sequence whose recurrence relation is 𝑎𝑛 = 4𝑎𝑛−1 + 5𝑎𝑛−2 with

𝑎1 = 2 𝑎𝑛𝑑 𝑎2 = 6
Solution

d. i. Define G: J5 × J5 → J5 × J5 as follows: For all (a, b) ∈ J5 × J5,

𝐺(𝑎, 𝑏) = ((2𝑎 + 1) 𝑚𝑜𝑑 5, (3𝑏 − 2) 𝑚𝑜𝑑 5)
Find: 𝐺(4, 4), 𝐺(2, 1), 𝐺(3, 2), 𝐺(1, 5)
ii. Let F and G be functions from the set of all real numbers to itself. Define
the product functions F ·G: R → R and G· F: R → R as follows: For all x
∈ R,
(𝐹 · 𝐺)(𝑥) = 𝐹(𝑥) · 𝐺(𝑥)
 Q. P. Code:
(𝐺 · 𝐹)(𝑥) = 𝐺(𝑥) · 𝐹(𝑥)
Does 𝐹 · 𝐺 = 𝐺 · 𝐹? Explain.
Solution i. (4,0), (0,1), (2,4), (3,3)
ii. F ·G and G· F are equal because for all real numbers x,
(F ·G)(x) = F(x) ·G(x) by definition of F ·G
= G(x) · F(x) by the commutative law for multiplication of real
numbers
= (G· F)(x) by definition of G · F.
e. i. Define Floor: R → Z by the formula 𝐹𝑙𝑜𝑜𝑟(𝑥) = ⌊𝑥⌋, for all real
numbers x.
• Is Floor one-to-one? Prove or give a counterexample.
• Is Floor onto? Prove or give a counterexample.
ii. Let S be the set of all strings of 0’s and 1’s, and define
l: S → Znonneg by
l(s) = the length of s, for all strings s in S.
• Is l one-to-one? Prove or give a counterexample.
• Is l onto? Prove or give a counterexample.

Solution i. ⌊𝑥⌋= that unique integer n such that n ≤ x <n + 1.

• Floor is not one-to-one:
Floor(0) = 0 = Floor (1/2) but 0 ≠ 1/2.
• Floor is onto: Suppose m ∈ Z. [We must show that there exists a real
number y such that Floor(y)=m.] Let y =m.
Then Floor(y) = Floor(m) = m since m is an integer.
(Actually, Floor takes the value m for all real numbers in
the interval m ≤ x < m + 1.) Hence there exists a real number y such that
Floor(y) = m.
ii.

f. Let X = {a, c, b}, Y = {x, y, z}, and Z = {u, v,w}. Define f : X → Y and g: Y → Z
by the arrow diagrams below.
 Q. P. Code:

Find: 𝑔 𝑜 𝑓, (𝑔 𝑜 𝑓)−1 , 𝑓 −1 , 𝑔−1 , 𝑓 −1 𝑜 𝑔−1 .

𝐻𝑜𝑤 (𝑔 𝑜 𝑓)−1 𝑎𝑛𝑑 𝑓 −1 𝑜 𝑔−1 𝑎𝑟𝑒 𝑟𝑒𝑙𝑎𝑡𝑒𝑑?

Solution

4. Attempt any three of the following: 15

a Draw the directed graph for the following relations:
i. A relation 𝑅 𝑜𝑛 𝐴 = {0, 1, 2, 3} by 𝑅 = {(0, 0), (1, 2), (2, 2)}.
ii. Let A = {2, 3, 4, 5, 6, 7, 8} and define a relation 𝑅 𝑜𝑛 𝐴 as follows:
𝐹𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∈ 𝐴, 𝑥 𝑅 𝑦 ⇔ 𝑥 | 𝑦.
Solution i.

ii.
 Q. P. Code:

b Determine whether the following relations are reflexive, symmetric, transitive or

none of these. Justify your answer.
i. R is the “greater than or equal to” relation on the set of real numbers:
𝐹𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∈ 𝑹, 𝑥 𝑅 𝑦 ⇔ 𝑥 ≥ 𝑦.
ii. D is the relation defined on R as follows:
𝐹𝑜𝑟 𝑎𝑙𝑙 𝑥, 𝑦 ∈ 𝑅, 𝑥 𝐷 𝑦 ⇔ 𝑥𝑦 ≥ 0.
Solution i. R is reflexive: R is reflexive ⇔ for all real numbers x,x R x. By definition
of R, this means that for all real numbers x, x ≥ x. In other words, for all
real numbers x, x > x or x = x. But this is true.
R is not symmetric: R is symmetric ⇔ for all real numbers x and y, if x R y
then y R x. By definition of R, this means that for all real numbers x and y,
if x ≥ y then y ≥ x. But this is false. As a counterexample, take x = 1 and y
= 0. Then x ≥ y but y not ≥ x because 1 ≥ 0 but 0 not ≥ 1.
R is transitive: R is transitive ⇔ for all real numbers x, y, and z, if x R y and
y R z then x R z. By definition of R, this means that for all real numbers x, y
and z, if x ≥ y and y ≥ z then x ≥ z. But this is true by definition of ≥ and
the transitive property of order for the real numbers.
ii. D is reflexive: For D to be reflexive means that for all real numbers x,x D
x. But by definition of D, this means that for all real numbers x, xx = x2 ≥
0, which is true.
D is symmetric: For D to be symmetric means that for all real numbers x
and y, if x D y then y D x. But by definition of D, this means that for all real
numbers x and y, if xy ≥ 0 then yx ≥ 0, which is true by the commutative
law of multiplication.
D is not transitive: For D to be transitive means that for all real numbers x,
y, and z, if x D y and y D z then x D z. By definition of D, this means that
for all real numbers x, y, and z, if xy ≥ 0 and yz ≥ 0 then xz ≥ 0. But this is
false: there exist real numbers x, y, and z such that xy ≥ 0 and yz ≥ 0 but xz
not ≥ 0. As a counterexample, let x = 1, y = 0, and z = −1. Then x D y and
y D z because 1·0 ≥ 0 and 0· (−1) ≥ 0. But x _D z because 1· (−1) not ≥ 0.
 Q. P. Code:
c Let R be the set of all real numbers and define a relation R on R × R as follows:
For all (a, b) and (c, d) in R × R, (a, b) R (c, d) ⇔ either a < c or both a = c
and b ≤ d.
Is R a partial order relation? Prove or give a counterexample.
Solution

d Imagine that the diagram shown below is a map with countries labeled a–g. Is it
possible to color the map with only three colors so that no two adjacent countries
have the same color? To answer this question, draw and analyze a graph in which
each country is represented by a vertex and two vertices are connected by an edge
if, and only if, the countries share a common border.
 Q. P. Code:

Solution

Vertex e has maximal degree, so color it with color #1. Vertex a does not share an
edge with e, and so color #1 may also be used for it. From the remaining uncolored
vertices, all of d, g, and f have maximal degree. Choose any one of them, say d, and
use color #2 for it. Observe that vertices b, c, and f do not share an edge with d, but
c and f share an edge with each other, which means that color #2 may be used for
only one of c or f . So color b with color #2, and choose to color f with color #2
because the degree of f is greater than the degree of c. From the remaining uncolored
vertices, g has maximal degree, so color it with color #3. Then observe that because
g does not share an edge with c, color #3 may also be used for c. At this point, all
vertices have been colored.
e i. Find the adjacency matrix of the following graph:

ii. Find directed graphs that have the following adjacency matrix:
1 0 1 2
0 0 1 0
[ ]
0 2 1 1
0 1 1 0
Solution i.

ii.
 Q. P. Code:
f For the following either draw the graph as per the specifications or explain why no
such graph exists:
i. Graph, circuit-free, nine vertices, six edges
ii. Tree, six vertices, total degree 14
iii. Tree, five vertices, total degree 8
iv. Graph, connected, six vertices, five edges, has a nontrivial circuit
v. Graph, two vertices, one edge, not a tree

Solution i. One such graph is

ii. There is no tree with six vertices and a total degree of 14. Any tree with six
vertices has five edges and hence a total degree of 10, not 14.
iii. One such tree is shown.

iv. No such graph exists. A connected graph with six vertices and five edges is
a tree. Hence such a graph cannot have a nontrivial circuit.

v.

5. Attempt any three of the following: 15

a. There are four bus lines between A and B and three bus lines between B and C. In
how many ways can a man travel
i. by bus from A to C by way of B?
ii. round-trip by bus from A to C by way of B?
iii. round-trip by bus from A to C by way of B if he does not want to use a
bus line more than once?
Solution i. 12
ii. 144
iii. 72
b. i. How many ways can the letters of the word ALGORITHM be arranged in
a row? 9! = 362, 880.
ii. How many ways can the letters of the word ALGORITHM be arranged in
a row if A and L must remain together (in order) as a unit? 8! = 40320
iii. How many ways can three of the letters of the word ALGORITHM be
selected and written in a row? 504
iv. How many ways can six of the letters of the word ALGORITHM be selected
and written in a row if the first letter must be A? 6720
v. How many ways can the letters of the word ALGORITHM be arranged in
a row if the letters GOR must remain together (in order) as a unit? 7! = 5040
c. i. If 4 cards are selected from a standard 52-card deck, must at least 2 be of
the same suit? Why?
 Q. P. Code:
No. For instance, the aces of the four different suits could be selected.
ii. If 5 cards are selected from a standard 52-card deck, must at least 2 be of
the same suit? Why?

iii. A small town has only 500 residents. Must there be 2 residents who have
the same birthday? Why?

iv. Given any set of four integers, must there be two that have the same
remainder when divided by 3? Why?
Yes. There are only three possible remainders that can be obtained when an integer
is divided by 3: 0, 1, and 2. Thus, by the pigeonhole principle, if four integers are
each divided by 3, then at least two of them must have the same remainder. More
formally, call the integers n1, n2, n3, and n4, and consider the function R that sends
each integer to the remainder obtained when that integer is divided by 3:
 Q. P. Code:

v. Given any set of three integers, must there be two that have the same
remainder when divided by 3? Why?
No. For instance, {0, 1, 2} is a set of three integers no two of which have the same
remainder when divided by 3.
d. i. How many distinguishable ways can the letters of the word HULLABALOO
be arranged in order?

ii. How many distinguishable orderings of the letters of HULLABALOO

begin with U and end with L?

iii. How many distinguishable orderings of the letters of HULLABALOO

contain the two letters HU next to each other in order?

e. A bakery produces six different kinds of pastry, one of which is eclairs. Assume
there are at least 20 pastries of each kind.
i. How many different selections of twenty pastries are there? 53130
ii. How many different selections of twenty pastries are there if at least three
must be eclairs? 26,334
iii. How many different selections of twenty pastries contain at most two
eclairs? 26, 796

f. A drug-screening test is used in a large population of people of whom 4% actually

use drugs. Suppose that the false positive rate is 3% and the false negative rate is
2%. Thus a person who uses drugs tests positive for them 98% of the time, and a
person who does not use drugs tests negative for them 987% of the time.
i. What is the probability that a randomly chosen person who tests positive
for drugs actually uses drugs?
ii. What is the probability that a randomly chosen person who tests negative
for drugs does not use drugs?
 Q. P. Code:

_____________________________