You are on page 1of 1

CS201 : Discrete Mathematics

Semester II, 2010-11, CSE, IIT Kanpur


Assignment - 3 (due on 1st March)

Note : Give complete details of the analysis of your solution.


1. Let G be a nonempty set closed under associative product, which in addition satisfies
(a) There exists an e G such that a.e = a for all a G.
(b) Given a G, there exists an element y(a) G such that a.y(a) = e.
Prove that G must be a group under this product.
2. Suppose a finite set G is closed under an associative product and that both cancellation laws
hold for G. Prove that G must be a group.
3. Let G be an abelian group. Let n be any positive integer relatively prime to o(G). Prove
that for each element a G, there exists an x G such that a = xn .
4. (Wilsons theorem)
Using group theory and elementary number theory, prove that (n 1)! + 1 is divisible by n
if and only if n is prime.
5. A coloring of a cube is an assignment of colors from the set {red, blue,green} to its faces. For
a stationary cube, there are thus 36 distinct coloring. However, we shall consider a cube which
can rotate in 3-D space. In this scenario, any two colorings c1 , c2 of the cube are rotationally
distinct if we cant get c1 from c2 by any rotations performed on c2 in 3-D space. Show that
the number of rotationally distinct colourings of the faces of a cube using three colours is 57
(i.e., each of the 36 possible coloring can be derived by appropriate rotations on one of these
colorings).
6. Let G be the set of all real numbers under addition. Let G0 be the set of all non-zero real
numbers under multiplication. Prove that G is not isomorphic to G0 .

You might also like