Abstract
Let Xn = { } 1,2,…,n be a finite n -element set and let Sn An and Dn , be the Symmetric, Alternating and Dihedral groups of Xn , respectively. In this thesis we obtained and discussed formulae for the number of even and odd permutations (of an n − element set) having exactly k fixed points in the alternating group and the generating functions for the fixed points. Further, we give two different proofs of the number of even and odd permutations (of an n − element set) having exactly k fixed points in the dihedral group, one geometric and the other algebraic. In the algebraic proof, we further obtain the formulae for determining the fixed points. We finally proved the three families; F(2r,4r + 2), F(4r +3,8r + 8) and F( ) 4r +5,8r +12 of the Fibonacci groups F( ) m ,n to be infinite by defining Morphism between Dihedral groups and the Fibonacci groups.
Chapter One: Introduction
1.1 Background of the Study
Climate change poses a significant threat to agriculture globally, with r...
Background of the Study:
Teacher leadership has emerged as a transformative force in the field of education, especially in...
Abstract
In this study, an attempt was made to determining the acceptability of locally manufactured cosmetic product by...
Background of the Study
Political networks in Nigeria play a crucial role in the allocation of resource...
Background of the Study
Financial transactions are a fundamental aspect of modern economies, and the security, efficiency,...
Background of the study
Traditional medicine remains a central component of healthcare in many Nigerian communities, inclu...
Background of the study
Anaphylaxis is a severe, life-threatening allergic reaction that requires immediate medical inte...
ABSTRACT
Performance appraisals allow the organization to tell the employee something about their rates of growth, their...
Background of the Study
Inventory control systems are integral to effective retail man...