(i) With repetition allowed, each of the three places can be filled in 5 ways, so the number is $5^3=125$. (ii) Without repetition, the places can be filled in $5,4,3$ ways, so the number is $5\times4\times3=60$.
(i) $125$ (ii) $60$.
The units digit must be even, so it can be $2,4$ or $6$: 3 choices. Since repetition is allowed, the hundreds and tens places each have 6 choices. Total numbers $=6\times6\times3=108$.
$108$.
The four positions can be filled in $10,9,8,7$ ways. Hence the number of codes is ${}^{10}P_4=10\times9\times8\times7=5040$.
$5040$.
The first two digits are fixed as 6 and 7. The remaining three places must be filled from the remaining 8 digits without repetition, so the number is ${}^{8}P_3=8\times7\times6=336$.
$336$.
Each toss has 2 possible outcomes. For 3 tosses, the number of possible outcomes is $2^3=8$.
$8$.
Order matters because one flag is below the other. The upper flag can be chosen in 5 ways and the lower flag in 4 ways, so the number of signals is $5\times4=20$.
$20$.
$8!=1\times2\times3\times4\times5\times6\times7\times8=40320$. Also $4!-3!=24-6=18$.
(i) $8!=40320$ (ii) $4!-3!=18$.
$3!=6$ and $4!=24$, so $3!+4!=30$. This is not equal to $7!=5040$.
No. $3!+4!=30$, while $7!=5040$.
$\dfrac{8!}{6!2!}=\dfrac{8\times7\times6!}{6!\times2}=28$.
$28$.
$\dfrac{1}{6!}+\dfrac{1}{7!}=\dfrac{7+1}{7!}=\dfrac{8}{7!}=\dfrac{64}{8!}$. Hence $x=64$.
$x=64$.
(i) $\dfrac{6!}{(6-2)!}=\dfrac{6!}{4!}=6\times5=30$. (ii) $\dfrac{9!}{(9-5)!}=\dfrac{9!}{4!}=9\times8\times7\times6\times5=15120$.
(i) $30$ (ii) $15120$.
Fill the three positions from 9 digits without repetition: ${}^{9}P_3=9\times8\times7=504$.
$504$.
The thousands place has 9 choices, from 1 to 9. The remaining three places have 9, 8 and 7 choices from the remaining digits, including 0 where allowed. Total $=9\times9\times8\times7=4536$.
$4536$.
The units digit must be one of $2,4,6$: 3 choices. After that, the hundreds and tens places have 5 and 4 choices. Total $=3\times5\times4=60$.
$60$.
Total 4-digit numbers are ${}^{5}P_4=5\times4\times3\times2=120$. For even numbers, the units digit is 2 or 4: 2 choices. The remaining three positions can be filled in ${}^{4}P_3=24$ ways. Thus even numbers $=2\times24=48$.
Total $=120$; even numbers $=48$.
The chairman can be chosen in 8 ways and the vice chairman in 7 ways. Since the posts are different, total ways $=8\times7=56$.
$56$.
$\dfrac{{}^{n-1}P_3}{{}^nP_4}=\dfrac{(n-1)(n-2)(n-3)}{n(n-1)(n-2)(n-3)}=\dfrac1n$. Since this ratio is $\dfrac19$, $n=9$.
$n=9$.
(i) $\dfrac{5!}{(5-r)!}=2\dfrac{6!}{(7-r)!}$ gives $(7-r)(6-r)=12$, so $r=3$ is the valid value. (ii) $\dfrac{5!}{(5-r)!}=\dfrac{6!}{(7-r)!}$ gives $(7-r)(6-r)=6$, so $r=4$ is the valid value.
(i) $r=3$ (ii) $r=4$.
The word EQUATION has 8 distinct letters. The number of arrangements is $8!=40320$.
$40320$.
MONDAY has 6 distinct letters. (i) Four-letter arrangements: ${}^{6}P_4=360$. (ii) All letters: $6!=720$. (iii) The first letter can be one of the two vowels A or O, and the remaining 5 letters can be arranged in $5!$ ways, giving $2\times5!=240$.
(i) $360$ (ii) $720$ (iii) $240$.
MISSISSIPPI has 11 letters: I appears 4 times, S appears 4 times and P appears 2 times. Total distinct permutations $=\dfrac{11!}{4!4!2!}=34650$. If the four I's come together, treat them as one block; then there are 8 objects with S repeated 4 times and P repeated 2 times, giving $\dfrac{8!}{4!2!}=840$. Therefore, not together $=34650-840=33810$.
$33810$.
PERMUTATIONS has 12 letters with T repeated twice. (i) Fix P first and S last; arrange the remaining 10 letters with two T's: $\dfrac{10!}{2!}=1814400$. (ii) Treat the 5 vowels E, U, A, I, O as one block. Then arrange this block and 7 consonants, with T repeated twice: $\dfrac{8!}{2!}\times5!=2419200$. (iii) P and S must occupy positions differing by 5. There are 7 such position-pairs and 2 orders for P and S, so 14 choices. The remaining 10 letters can be arranged in $\dfrac{10!}{2!}$ ways. Total $=14\times\dfrac{10!}{2!}=25401600$.
(i) $1814400$ (ii) $2419200$ (iii) $25401600$.
Since ${}^{n}C_8={}^{n}C_2$, either $8=2$ or $8=n-2$. Hence $n=10$. Therefore ${}^{n}C_2={}^{10}C_2=45$.
${}^{n}C_2=45$.
$\dfrac{{}^{2n}C_3}{{}^{n}C_3}=\dfrac{2n(2n-1)(2n-2)}{n(n-1)(n-2)}=\dfrac{4(2n-1)}{n-2}$. (i) Set this equal to 12: $4(2n-1)=12(n-2)$, so $n=5$. (ii) Set it equal to 11: $4(2n-1)=11(n-2)$, so $n=6$.
(i) $n=5$ (ii) $n=6$.
A chord is determined by choosing any 2 of the 21 points. Hence the number of chords is ${}^{21}C_2=210$.
$210$.
Choose 3 boys from 5 and 3 girls from 4: ${}^{5}C_3\times{}^{4}C_3=10\times4=40$.
$40$.
Select 3 red from 6, 3 white from 5 and 3 blue from 5. The number of ways is ${}^{6}C_3\times{}^{5}C_3\times{}^{5}C_3=20\times10\times10=2000$.
$2000$.
Choose 1 ace from 4 and 4 non-aces from the remaining 48 cards. Number of hands $={}^{4}C_1\times{}^{48}C_4=4\times194580=778320$.
$778320$.
Choose exactly 4 bowlers from 5 and the remaining 7 players from the 12 non-bowlers. Number of teams $={}^{5}C_4\times{}^{12}C_7=5\times792=3960$.
$3960$.
Choose 2 black balls from 5 and 3 red balls from 6: ${}^{5}C_2\times{}^{6}C_3=10\times20=200$.
$200$.
The 2 compulsory courses are fixed. The student must choose 3 more courses from the remaining 7, which can be done in ${}^{7}C_3=35$ ways.
$35$.
DAUGHTER has 3 vowels A, U, E and 5 consonants D, G, H, T, R. Choose 2 vowels and 3 consonants, then arrange the 5 selected letters: ${}^{3}C_2\times{}^{5}C_3\times5!=3\times10\times120=3600$.
$3600$.
EQUATION has 5 vowels and 3 consonants. Treat the vowels as one block and the consonants as another block; the two blocks can be arranged in $2!$ ways. The vowels can be arranged in $5!$ ways and consonants in $3!$ ways. Total $=2!\times5!\times3!=1440$.
$1440$.
(i) Exactly 3 girls: ${}^{4}C_3\times{}^{9}C_4=4\times126=504$. (ii) At least 3 girls means 3 girls or 4 girls: $504+{}^{4}C_4{}^{9}C_3=504+84=588$. (iii) At most 3 girls means 0,1,2 or 3 girls: ${}^{9}C_7+{}^{4}C_1{}^{9}C_6+{}^{4}C_2{}^{9}C_5+{}^{4}C_3{}^{9}C_4=36+336+756+504=1632$.
(i) $504$ (ii) $588$ (iii) $1632$.
In dictionary order, words before the first word starting with E must start with A. Fix A first. The remaining 10 letters contain A once, I twice and N twice. Hence the number of such words is $\dfrac{10!}{2!2!}=907200$.
$907200$.
A number divisible by 10 must end in 0. The remaining five positions are filled by 1, 3, 5, 7 and 9 in any order, giving $5!=120$ numbers.
$120$.
Choose 2 vowels from 5 and 2 consonants from 21, then arrange the 4 selected letters: ${}^{5}C_2\times{}^{21}C_2\times4!=10\times210\times24=50400$.
$50400$.
The possible splits are $(3,5)$, $(4,4)$ and $(5,3)$ from Part I and Part II. Number of choices $={}^{5}C_3{}^{7}C_5+{}^{5}C_4{}^{7}C_4+{}^{5}C_5{}^{7}C_3=10\times21+5\times35+1\times35=420$.
$420$.
Choose exactly 1 king from 4 and the remaining 4 cards from the 48 non-kings. Number of selections $={}^{4}C_1\times{}^{48}C_4=4\times194580=778320$.
$778320$.
In 9 places, the even places are 2, 4, 6 and 8. The 4 women can occupy these in $4!$ ways, and the 5 men can occupy the remaining 5 places in $5!$ ways. Total $=4!\times5!=2880$.
$2880$.
If the 3 students all join, choose the remaining 7 from the other 22: ${}^{22}C_7=170544$. If none of them joins, choose all 10 from the other 22: ${}^{22}C_{10}=646646$. Total $=170544+646646=817190$.
$817190$.
ASSASSINATION has 13 letters: A appears 3 times, S appears 4 times, I appears 2 times and N appears 2 times. Keep all S's as one block. Then there are 10 objects: the S-block, A,A,A, I,I, N,N, T, O. The number of arrangements is $\dfrac{10!}{3!2!2!}=151200$.
$151200$.