Posts

Showing posts with the label Circular Permutations

Equilateral and Equiangular Polygons

A polygon is a 2 dimensional geometric figure bound with straight sides. A polygon is called Equilateral if all of its sides are congruent. Common examples of equilateral polygons are a rhombus and regular polygons such as equilateral triangles and squares.  Now, a polygon is equiangular if all of its internal angles are congruent.  Some important facts to consider The only equiangular triangle is the equilateral triangle If P is an equilateral polygon that has more than three sides, it does not have to be equiangular. A rhombus with no right angle is an example of an equilateral but non-equiangular polygon.  Rectangles, including squares, are the only equiangular quadrilaterals Equiangular polygon theorem. Each angle of an equiangular n-gon is  $$\Bigg(\frac{n-2}{n}\Bigg)180^{\circ} = 180^{\circ} -   \frac{360^{\circ}}{n} $$ Viviani's theorem   Vincenzo Viviani (1622 – 1703) was a famous Italian mathematician. With his exceptional intelligence in math...

Circular Permutations

Circular Permutations are type of arrangements where the objects are to be arranged around a circle or in a circular order. Observe that in circular permutations the order around the circle (or the relative positions ) alone need to be taken into consideration and not the actual positions. For example, suppose $5$ different things are arranged around a circle. Consider the 5 positions around a circle. $A$, $B$, $C$, $D$, $E$ can be arranged in 5 different positions in 5! ways. Consider one such arrangement say $ABCDE$ in that order around the circle. This arrangement and the $4$ new arrangements $BCDEA$, $CDEAB$, $DEABC$, and  $EABCD$ are not only really different arrangements because the same relative positions around the circle are maintained by the $5$ letters. Therefore, the number of different ways of arranging the  $5$ letters around a circle is $ \cfrac {5!}{5} = 4!$ Also, in the above we are considering the clockwise and anti-clockwise arrangements on the circle ...

Circular Permutations

In circular permutations, things are to be arranged in the form of a ring or a circle, e.g. arrangements of people around a circular table. In circular permutation there are no end points, i.e. there are no beginning or ending positions. So, the number of circular permutations of n objects are $$\frac{n!}{n}=(n-1)!$$ Thus in a circular permutation, one thing is kept fixed and the remaining  $(n-1)$ things are arranged in $(n-1)!$ ways. If the clockwise and counter clockwise orders are not distinguishable, then the number of ways = $\frac{1}{2}(n-1)!$ Let us look at a few examples.  Ex:   In how many ways can $6$ boys be seated at a circular table? Sol:   We keep one boy in a fixed position and to find the number of permutations to arrange the remaining 5 boys, we simply take $5!$, which gets us to our answer $\boxed {120} $.  Ex:  In how many ways can $6$ boys be arranged at a round table so that $2$ particular boys can be seat...

Popular posts from this blog

Equilateral and Equiangular Polygons

Incenter/Excenter Lemma

Common Factorizations