Set, Relation, Mapping

(Syllabus: Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary
Relation, Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product of
Functions, Bijective functions, Inverse and Composite Function, Size of a Set, Finite and infinite
Sets, Countable and uncountable Sets, Cantor’s diagonal argument and The Power Set theorem,
Schroeder-Bernstein theorem.)

1. Define a SET with proper examples according to the classical set theory. What are the different
set operations usually performed - explain with examples. (wbut 23)

2. Define subset of a set.

3. Define power set of a set. If a finite set S has n elements, then what is the cardinality of its power
set.

4. Define the union of two sets

5. What do you mean by the symmetric difference of set A and B? (wbut 23)

6. Write the De Morgan’s laws of SET operations. (wbut 23)

7. Write the Absorption laws in respect of SET Theory? (wbut 23)

8. What is the cartesian product of two sets?

9. If |A| = m and |B| = n, then what is |A × B| =?

10. If A = {1, 3, 5}, B = {1, 3, 8}, then find

(i) A × B (ii) B × A (iii) (A × B) − (B × A) (iv) A∆B
(v) Also verify that A∆B = (A ∪ B) − (A ∩ B)

11. If A, B, C are subsets of a universal set U . Prove that A − (B ∪ C) = (A − B) ∩ (A − C).

12. Define a relation between two sets A and B. (wbut 23)

13. What is total number of relations defined on a set A having n number of elements?

14. Define a relation on a set A. A relation R on the set of integers Z is defined by R = {(a, b) : a, b ∈
Z, |a − b| ≤ 5}. Is the relation reflexive, symmetric and transitive? (wbut 07)

15. How many reflexive and symmetric relations are possible on a set with n elements? (wbut 23)

16. Determine the nature of the relation R on the set Z defined by aρb if and only if a, b ∈ Z and
ab ≥ 0.

17. Show that the following relation R on Z is an equivalence relation:

R = {(a, b) : a, b ∈ Z, a2 + b2 is a multiple of 2} (wbut 08)

18. Define the function with a example. Define domain, co-domain and range of a function.
(x2 +1−x)
19. Find the domain of the function f (x) = (x2 −5x+6)
.

20. Find the domain of the function f (x) = cos−1 2x−3

3 .

21. What is composition of mapping?

1
22. If f (x) = x − 1 and g(x) = x+1 , find gof , f of and gof (1/2).

23. Check whether the function f : R → R defined by f (x) = sin x is injective, surjective or bijective.
24. What Is an inverse function? How do you obtain inverse of a function? Explain with example.
(wbut 23)
√
25. Find the inverse function of f (x) = log(x + x2 + 1).
x−2
26. Show that f : R − {3} → R − {1} given by f (x) = x−3 is a bijective map and find its inverse.

27. State Schroder-Bernstein Theorem.

28. What do you mean by finite and Infinite sets. Also, explain the concepts of finite countable sets,
infinite countable sets and Infinite uncountable sets with proper examples. (wbut 23)

Mathematical Induction
(Syllabus: Principles of Mathematical Induction)

1. Prove by induction: n2 + n is even where n is a positive integer. (wbut 23)

2. Prove by mathematical induction that 3n < n! for all positive integers n ≥ 6. (wbut 24)

3. Use Mathematical Induction to prove that n < 2n for every positive integer n.

4. Use Mathematical Induction to prove that n3 − n is divisible by 3 for every positive integer n.

Theory of Numbers
(Syllabus: The Well Ordering Principle, Recursive definition, The Division algorithm: Prime Num-
bers, The Greatest Common Divisor: Euclidean Algorithm, The Fundamental Theorem of Arith-
metic.)

1. State the well ordering principle.

2. Define prime numbers and composite numbers.

3. State the fundamental theorem of arithmetic.

4. Prove that the number of prime numbers is infinite. (wbut 14, 23)

5. State and prove the theorem of division algorithm. (wbut 24)

6. show that the product of any r consecutive natural number is divisible by r!. (wbut 14)

7. Define the gcd of two numbers.

8. For any positive integer m, prove that gcd(ma, mb) = m.gcd(a, b). (wbut 14)

9. If gcd(a, b) = 1, prove that gcd(a + b, a2 − ab + b2 ) = 1 or 3. (wbut 14)

10. Find integers u and v satisfying gcd(272, 119) = 272u + 119v. (wbut 14)

11. Find two integers u and v satisfying 63u + 55v = 1.

12. Find the gcd(595, 252) and express it in the form 252m + 595n.

13. Determine the Recursive formula for the sequence 3, 9, 21, ..... Also find the 11th term. (wbut 24)
 Counting Techniques
(Syllabus: Basic counting techniques-inclusion and exclusion, pigeon-hole principle, permutation and
combination)

1. Explain the sum rule principle and product rule principle with example.

2. Explain the difference between a permutation and a combination, and provide an example of each.

3. How many seven letter word can be formed using the letters of the word BENZENE.

4. Find the number of ways that a party of seven persons can arrange themselves (i) in a row of
seven chairs (ii) around a circular table.

5. State the first form of Pigeonhole Principle and then prove that in a Party where guests are
handshaking among themselves, there will always be at least-two guests who have shaken hands
the same number of times. (wbut 24)

6. Consider six people. Any two of them are either friends or strangers. Find the number of selected
persons where the persons are either mutual friends or mutual stranger.

7. Let S be a square where each side has length 2 inches. Find the minimum number of points to
be chosen from the interior of S such that distance between two of the points will be less than
√
2 inches.

8. A drawer contains ten black and ten white socks. You reach in and pull some out without looking
at them. What is the least number of socks you must pull out to be sure to get a matched pair?
Explain how the answer follows from the pigeonhole principle. (wbut 24)

9. State the principle of inclusion and exclusion.

10. Using principle of inclusion and exclusion show that for any three sets A, B and C,

n(A ∪ B ∪ C) = n(A) + n(B) + n(C)

if they are pairwise mutually disjoint.

11. By principle of inclusion and exclusion find the number of 10 combinations of the elements of the
set S containing 5 a’s, 4 b’s, 5 e’s and 7 d’s. (wbut 24)

12. Five speakers A, B, C, D and E speak in a meeting one after the other. Find the probability that
A speaks before B. (wbut 23)

13. There are 5 white balls, 4 red balls, and 3 blue balls in a box. If you draw 2 balls at random from
the box, what is the probability that both balls are either white or red? (wbut 23)

14. In how many ways can you invite one or more of your five friends to your birthday party? (wbut
23)

15. Find the total number of integers between 1 and 1000 which are neither perfect square nor perfect
cubes.

Group Theory
(Syllabus: Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation,
Semi Groups, Monoids, Groups, Congruence Relation and Quotient Structures, Free and Cyclic
Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups)

1. What is a binary operation on a set A? Explain with an example.

 2. Define groupoid and give an example.

3. What is semigroup? Give an example.

4. Define monoid with an example.

5. Define group. What do you mean by Abelian group. (wbut 24)

6. What is the order of a group?

7. Show that the non-zero rational numbers form an abelian group under multiplication. What is
the identity element and what are its inverse? (wbut 03)
a+b
8. Let G = {a ∈ R : −1 < a < 1}. Define a binary operation ∗ on G by a ∗ b = 1+ab for all a, b ∈ G.
Show that (G, ∗) is a group. (wbut 19)

9. Show that the set G of all non-zero real numbers form a commutative group under the operation
∗ defined by a ∗ b = ab
2 , for all a, b ∈ G. (wbut 08)

10. Prove that the set D of all odd integers forms a commutative group w.r.t. the composition ∗
defined by a ∗ b = a + b − 1 for all a, b ∈ D. (wbut 08)

11. Prove that the identity element and the inverse of an element in a group (G, o) are unique.
(wbut-08)

12. Prove that in a group (G, ◦), (a ◦ b)−1 = b−1 ◦ a−1 , for all a, b ∈ G. (wbut 08)

13. Prove: In a group (G, ◦) for all a, b ∈ G, the equations a◦x = b and y ◦a = b have unique solutions
which are x = a−1 ◦ b and y = b ◦ a−1 . (wbut 05)

14. Show that all roots of the equation x4 = 1 forms a commutative group under the operation
multiplication. (wbut 05,07)

15. Show that the set G of all order pairs (a, b) with a ̸= 0, of real numbers a, b forms a group with
operations ‘◦’ defined by (a, b) ◦ (c, d) = (ac, bc + d). (wbut 07,15)

16. Let G be a group. If a, b ∈ G such that a4 = e, the identity element of G and ab = ba2 , prove
that a = e. (wbut 07)

17. Show that a group (G, ◦) is abelian if and only if (a ◦ b)2 = a2 ◦ b2 for all a, b ∈ G. (wbut 06,14)

18. In a group G, prove that (ab)2 = a2 b2 if and only if (ab)−1 = a−1 b−1 where a, b ∈ G. (wbut 06)

19. Which of the following set is closed under numerical multiplication:

(a) {1, −1, 0, 2} (b) {1, i} (c) {1, ω, ω 2 } (d) {ω, 1}

20. Suppose a group G contains elemets a and b such that O(a) = 4, O(b) = 2 and a3 b = ba. Then
O(ab) is
(a) 2 (b) 5 (c) ∞ (d) 6

21. Define subgroup.

22. Given Z, the group of integers with addition and H, a subset of Z consisting all multiples of a
positive integer m, i.e. km (k = 0, ±1, ±2). Show that H is a subgroup of G. (wbut 03)

23. Prove that intersection of any two subgroups of a group (G, ◦) is a subgroup of G. (wbut 07,08,15)

24. Is the union of any two subgroups of a group is necessarily a subgroup? If not give a counterex-
ample. (wbut 08)

25. Let G be an abelian group. Prove that the subset S = {p ∈ G : p = p−1 } forms a subgroup of G.
(wbut 05)
26. Define a cyclic group. Give an example of a cyclic group. (wbut 12,05)

27. Prove that every cyclic group is an abelian group. (wbut 13,12,04)

28. Show that the set G = {0, 1, 2, 3, 4, 5, 6} form a cyclic group under the operation multiplication
modulo 7. Find all generators of this group. (wbut 03,08)

29. Show that a cyclic group of prime order has no proper non-trivial subgroup. (wbut 05)

30. State and prove the Lagrange’s Theorem. (wbut 04,14)

31. Every group of prime order is cyclic. (wbut 07,14)

32. Define the normal subgroup.

33. Let H be a subgroup of a group G. then H is normal in G is and only if xhx−1 ∈ H for all h ∈ H
and for all x ∈ G. (wbut 04)

34. If G is a group and H is a subgroup of index 2 in G, prove that H is a normal subgroup of G.

(wbut 05,15)

35. Prove that the set of matrices

  
x 0
H= : x ∈ R, x ̸= 0
0 x

forms a normal subgroup of GL(2, R), the gorup of all real non-singular 2 × 2 matrices. (wbut 08)

36. Let G be a group in which for some integer n > 1, (ab)n = an bn for all a, b ∈ G. Show that
a) Gn = {xn : x ∈ G} is a normal subgroup of G.
b) Gn−1 = {xn−1 : x ∈ G} is a normal subgroup of G. (wbut 24)

37. Define a permutation and a permutation group.

   
1 2 3 4 5 1 2 3 4 5
38. Let A = and B = be two permutations. Show that AB ̸=
2 3 1 5 4 1 3 4 5 2
BA. (wbut 04)

39. Define homomorphism of group.

40. Define isomorphism of groups.

41. Show that the mapping f : (Z, .) → (R, .) defined by f (x) = x2 for all x ∈ Z is a monomorphism
but not isomorphism. (wbut 07)

42. If ϕ : G → H is a homomorphism and G is abelian, then Im(ϕ) = {ϕ(g) : g ∈ G} is abelian.

(wbut 24)

43. Prove that any group of order 15 is cyclic. (wbut 24)

44. Let G be a group and let a ∈ G. Prove that the mapping ϕa : G → G defined by ϕa (x) = axa−1
is an isomorphism on G. (wbut 19)
 Ring and Field
(Syllabus: Algebraic Structures with two Binary Operation, Rings, Integral Domain and Fields.)

1. Define a ring with an example.

2. Define a commutative ring with unity. Give an example.

3. Prove that the set of all even integers forms a commutative ring. (wbut 12)

4. If two operations ∗ and ◦ on the set Z of integers are defined as follows:

a ∗ b = a + b − 1, a ◦ b = a + b − ab

Prove that the set (Z, ∗, ◦) is a commutative ring with identity. (wbut 15)

5. In a ring (R, +, .) prove that (−a).(−b) = a.b for all a, b in R. (wbut 03)

6. In a ring R, if x3 = x for all x ∈ R, then show that R is commutative. (wbut 24)

7. Define trivial and non-trivial ring.

8. What do you mean by a ring with or without zero divisors?

9. A ring R satisfies cancellation laws if and only if R is without zero divisor. (wbut 04)

10. Define subring with an example.

 
a 0
11. Show that the set of matrices is a subring of the ring of 2 × 2 matrices over the field of
b 0
real numbers. (wbut 06)

12. Prove that the intersection of two subrings is a subring. (wbut 04, 12)

13. If (R, +, .) is a ring such that a2 = a for all a ∈ R, prove that a + a = 0 for all a ∈ R, i.e., each
element of R is its own additive inverse. (wbut 06)

14. If in a ring R with unity, (xy)2 = x2 y 2 for all x, y ∈ R, then show that R is commutative. (wbut
07)

15. Find the idempotent elements in the ring (Z6 , +, .). (wbut 05)

16. Define an integral domain and give an example. (wbut 04)

17. Examine whether the set of all even integers forms an integral domain with respect to ordinary
addition and multiplication. (wbut 05)

18. Define a field with an example. (wbut 03)

19. Prove that the ring of integers is not a field. (wbut 08)

20. Prove that every finite integral domain is a field. (wbut 03, 04, 06, 08, 12)

21. Prove that in a field F , the equations a.x = b and y.a = b have unique solutions where a, b ∈ F
and a ̸= 0. (wbut 08)