Levels Tought:
Elementary,Middle School,High School,College,University,PHD
Teaching Since: | May 2017 |
Last Sign in: | 249 Weeks Ago, 1 Day Ago |
Questions Answered: | 19234 |
Tutorials Posted: | 19224 |
MBA (IT), PHD
Kaplan University
Apr-2009 - Mar-2014
Professor
University of Santo Tomas
Aug-2006 - Present
In a word where no letters are repeated, such as FRANCE, the number of distinguishable ways of arranging the letters could be calculated by 5!, which gives 120. However, when letters are repeated, you must use the formula ##(n!)/((n_1!)(n_2!)...)##
There are 4 s's, 3 a's and a total of 9 letters.
##(9!)/((4!)(3!))##
= ##362880/(24 xx 6)##
= 2520
There are 2520 distinguishable ways of arranging the letters.
Practice exercises:
Find the number of distinguishable ways of arranging the letters in the word EXERCISES.
Find the number of distinguishable ways of arranging letters in the word AARDVARK.
Good luck!
 H-----------ell-----------o S-----------ir/-----------Mad-----------amT-----------han-----------k y-----------ou -----------for----------- vi-----------sit-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on -----------ple-----------ase----------- pi-----------ng -----------me -----------on -----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill-----------