Computer Sciences > GATE 2014 SET-3 > Groups
There are two elements x, y in a group (G, *) such that every element in the group can be written as a product of some number of x's and y's in some order. It is known that
x * x = y * y = x * y * x * y = y * x * y * x = e
where e is the identity element. The maximum number of elements in such a group is _________.

Explanation

Correct : 4 to 4

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science