Scribd
Upload
35 views2 pages

Set 1

Mathematical induction is a method of proof that shows a statement holds for all natural numbers. It has a basis step showing it holds for the first case, and an inductive step showing that if it holds for some number k, it must hold for k+1. The document provides an example using mathematical induction to prove an equation involving sums and factorials. The document also defines some mathematical concepts like equivalence relations, lattices, functions, partially ordered sets, and groups. It provides examples to illustrate these concepts and asks problems about them, like using algorithms to find spanning trees or Euler circuits in graphs. It asks the reader to represent set operations using arrays, use divisibility to draw a

Uploaded by

Sarwesh Maharzan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views2 pages

Set 1

Mathematical induction is a method of proof that shows a statement holds for all natural numbers. It has a basis step showing it holds for the first case, and an inductive step showing that if it holds for some number k, it must hold for k+1. The document provides an example using mathematical induction to prove an equation involving sums and factorials. The document also defines some mathematical concepts like equivalence relations, lattices, functions, partially ordered sets, and groups. It provides examples to illustrate these concepts and asks problems about them, like using algorithms to find spanning trees or Euler circuits in graphs. It asks the reader to represent set operations using arrays, use divisibility to draw a

Uploaded by

Sarwesh Maharzan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Group A

Answer any TWO questions. [2×12=24]

1. What do you understand by mathematical induction? Show that: 12 + 22 + 32 + … +


𝑥(𝑥+1)(2𝑥+1)
𝑥2 = by using mathematical induction.
6
2. (a) Define equivalence relation. Let 𝐴 = ℤ, the set of integers and let 𝑅 the relation on 𝐴
defined by 𝑎𝑅𝑏 if and only if 𝑎 ≤ 𝑏. is 𝑅 an equivalence relation?
(b) Define Lattices. If (𝐿1 , ≤) and (𝐿2 , ≤)are lattices, then show that (𝐿, ≤) is a lattice,
where 𝐿 = 𝐿1 × 𝐿2 and the partial order ‘≤’ of 𝐿 is the product partial order.
3. The small town of Social Circle maintains a system of walking trails between the
recreational areas in town. The system is modeled by the following weighted graph.
D 2 H
6
B
3 2
3
C 5 6
2 E
A 5 4 3

F 4 G

Group B

Answer any SEVEN questions. [7×8=56]

4. Define Characteristic function. Let 𝑈 = {𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓, 𝑔, ℎ, 𝑖, 𝑗}, 𝐴 = {𝑎, 𝑏, 𝑑, ℎ} and 𝐵 =


{𝑎, 𝑏, 𝑐, 𝑑, }. Represent the set 𝐴 ∪ 𝐵 by an array of zeros and ones. Use the Euclidean
algorithm to compute 𝐺𝐶𝐷 (98, 273).
5. State Pigeonhole Principle. Show that if 30 dictionaries in a library contain a total of
61,327 pages, then one of the dictionaries must have at least 2045 pages. How many
distinguishable permutations of the letters in the word BIRATNAGAR are there?
6. Use Warshall’s algorithm to find the transitive closure of the relation 𝑅 defined on 𝐴 =
{1, 2, 3, 4,5} given by
1 1 0 0 0
1 1 0 0 0
𝑀𝑅 = 0 0 1 1 0
0 0 1 1 0
(0 0 0 0 1 )
7. What are functions? Explain one to one function with example. Is the function 𝑓: ℝ → ℝ
defined by 𝑓 (𝑥 ) = 𝑥 3 onto?
8. Use Fleury’s algorithm to construct an Euler circuit for the following graph.
B F
C E
A G

H
D

9. Define Partially Ordered Sets. Let 𝐴 = {1, 2, 3, 4, 12}. Consider the partial order of
divisibility on 𝐴 such that if 𝑎 and 𝑏 in 𝐴, 𝑎 ≤ 𝑏 if and only if 𝑎|𝑏. Draw the Hase
diagram of the Poset (𝐴, ≤).
10. Apply Prim’s algorithm to find a spanning tree for a symmetric relation whose graph is
given below:
b
a

c d

11. Define group. Show that, the set of all real numbers ℝ with the operation of ordinary
addition is an abelian group.
12. Write short note on (Any Two)
(a) Biconditional Statement
(b) Tree searching
(c) Combination

You might also like