7.4.

1.
Mathematical Induction:
a) For n = 1 we have: 2  1  1  1  2  the formula is true.
b) If for n = k it’s true we have: 2  4  6  ...  2 k  k   k  1 .
c) We need to prove that for n = k + 1 it is true too:
n  k 1
2  4  6  ...  2k  2   k  1 
 k   k  1  2   k  1 
  k  1   k  2   n   n  1  the formula is true for n = k+1.
So, according to the mathematical induction method we have, that formula is true for every positive
integer n.

3.
Mathematical Induction:
2
a) For n = 1 we have: 1  1  1  the formula is true.
2
b) If for n = k it’s true we have: 1  3  5  ...   2k  1  k .
c) We need to prove that for n = k + 1 it is true too:
n  k 1
1  3  5  ...   2k  1   2   k  1  1 
 k 2   2k  2  1  k 2   2k  1  k 2  2k  1 
2
  k  1  n 2  the formula is true for n = k+1.
So, according to the mathematical induction method we have, that formula is true for every positive
integer n.

9.
Mathematical Induction:
2 1  1  1   2  1  1 1  2  3
a) For n = 1 we have: 1    1  the formula is true.
6 6
2 2 2 2 k   k  1   2k  1
b) If for n = k it’s true we have: 1  2  3  ...  k  .
6
c) We need to prove that for n = k + 1 it is true too:
n  k 1
2
12  2 2  32  ...  k 2   k  1 
k   k  1   2k  1 2  k   2 k  1 
   k  1   k  1     k  1  
6  6 
 2k 2  k  6k  6   k  1
  k  1      2k 2  7 k  6  
 6  6
 k  1   k  1    k  1  1   2  k  1  1
  k  2    2k  3  
6 6
n   n  1   2n  1
  the formula is true for n = k+1.
6
So, according to the mathematical induction method we have, that formula is true for every positive
integer n.

19.
3
 2

Look for the formula: n  n  3  n  n  1  3   n  1  n   n  1  3 , so number is has 3
as a factor and what about  n  1  n   n  1 , - it has 3 as a factor too, because this is a product of
three consecutive numbers and it is divisible by 3 in any case, so all the sum is divided by 3. In ither
3
words the formula n  n  3 has 3 as a factor. Proved.

7.5.
2.
3!4!  1  2  3  1  2  3  4  6  24  144 .
Answer: 144.

6.
6! 3! 4  5  6
  4  5  6  120.
3! 3!
Answer: 120.

10.
8 8! 5 6  7 8 5 6 7 8
 4   4! 8  4 !    5  2  7  70.
    4! 1 2  3  4
Answer: 70.

23.
According to the binomial theorem:
 1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
1 6 15 20 15 6 1
1 7 21 35 35 21 7 1
1 8 28 56 70 56 28 8 1
We will have:
4 4 0 3 1 2 2 1 3
 3t  5s   1   3t    5s   4   3t    5s   6   3t    5s   4   3t    5s  
0 4
1   3t    5s   81t 4  540t 3 s  1350t 2 s 2  1500ts 3  625s 4 .
4 3 2 2 3 4
Answer: 81t  540t s  1350t s  1500ts  625s .

31.
According to the binomial theorem the first three coefficients are:
 25  25! 25!
0    1;
  0!  25  0 ! 1  25!
 25  25! 25! 24! 25
 1     25;
  1!  25  1! 1  24! 1  24!
 25  25! 25! 23! 24  25 24  25
 2   2! 25  2 !  2! 23!  1  2  23!  2  12  25  300;
   
So, we will have:
25 25 0 24 1 23 2
 3c 2/5
 c 4/5   1   3c 2/5    c 4/5   25   3c 2/5    c 4/5   300   3c 2/5    c 4/5  
 325 c10  25  324 c 48/5  c 4/5  300  323 c 46/5  c8/5 
 325 c10  25  324 c52/5  300  323 c54/5 .
25 10 24 52/5
Answer: 3 c  25  3 c  300  323 c 54/5 .
34.
According to the binomial theorem the last three coefficients are:
12  12! 12! 10! 11  12 11  12
10       6 11  66;
  10! 12  10 ! 10! 2! 1  2  10! 2
12  12! 12! 11! 12
 11      12;
  11! 12  11! 11! 1! 1  11!
12  12! 12! 12!
12   12! 12  12 !  0! 12!  1  12!  1;
   
So, we will have:
3 12 2 10 1 11 0 12
 s  2t   66   s    2t 3   12   s    2t 3   1   s    2t 3  
 66 s 2  210 t 30  12 s  211  t 33  1  212  t 36 
 67584  s 2  t 30  24576  s  t 33  4096  t 36 .
2 30 33 36
Answer: 67584  s  t  24576  s  t  4096  t .

7.6.
1.
7! 7! 4! 5  6  7
P  7,3      5  6  7  210.
 7  3! 4! 4!
Answer: 210.

4.
5! 5! 2! 3  4  5
P  5,3     3  4  5  60.
 5  3! 2! 2!
Answer: 60.

13.
a) If repetitions are not allowed we can formed three-digits number from five digits by:
5! 5! 2! 3  4  5
P  5,3     3  4  5  60 variants.
 5  3! 2! 4!
b) If repetitions are allowed then we can formed three-digits number from five digits by:
53  125 variants.
Answer: a) 60 variants. b) 125 variants.

15.
4! 4! 3! 4
One-digits number: P  4,1     4.
 4  1! 3! 3!
4! 4! 2! 3  4
Two-digits number: P  4,2      3  4  12.
 4  2 ! 2! 2!
 4! 4! 1! 2  3  4
Three-digits number: P  4,3      2  3  4  24.
 4  3! 1! 1!
4! 4! 4!
Four-digits number: P  4,4      4!  1  2  3  4  24.
 4  4 ! 0! 1
So, the all numbers:
P  4,1  P  4,2   P  4,3  P  4,4   4  12  24  24  64 variants.
Answer: 64 variants.

7.7.
3.
9! 8! 9 9
C  9,8      9.
8! 9  8 ! 8! 1! 1
Answer: 9.

4.
6! 4! 5  6 5  6
C  6,2      15.
2! 6  2 ! 2! 4! 2
Answer: 15.

9.
If the one-colored disks need not to be grouped together:
12! 5! 6  7  8  9  10  11  12
  7  8  9  10  11  3  166320.
5! 3! 2! 2! 5! 6  2  2
Answer: 166320 ways.

11.
The number of letter “b” is 1.
The number of letter “o” is 2.
The number of letter “k” is 2.
The number of letter “e” is 3.
The number of letter “p” is 1.
The number of letter “r” is 1.
Total number of letters in word “bookkeeper” is 10.
So, we will have:
10! 3! 4  5  6  7  8  9 10
  5  6  7  8  9  10  151200.
1! 2! 2! 3! 1!1! 3! 2  2
Answer: 151200.

13.
Total number of player is 10. We need to choose 5 players for two command, so we will have:
10! 5! 6  7  8  9  10 6  7  8  9 10
C 10,5      7  2  9  2  252.
5! 10  5 ! 5! 5! 1 2  3  4  5
Answer: 252.

17.
Three commands from 8 different commands:
8! 8!
P  8,3    6  7  8  336.
8  3! 5!
25.
10
By 2  1024 different ways.
Answer: 1024.

28.
10 books from 10 books:
10!
P 10,10    10!  3682800.
10  10 !
Answer: 3682800.

32.
a) If repetitions are not allowed we can:
24! 24! 21! 22  23  24
P  24,3     22  23  24  12144. variants.
 24  3! 21! 21!
b) If repetitions are allowed then we can:
243  13824 variants.
Answer: a) 12144 variants. b) 13824 variants.

21.
A committee of 3 men from 12 men:
12! 9! 10 11  12 10 11  12
C 12,3     10  11  2  220.
3! 12  3! 3! 9! 1 2  3
A committee of 2 women from 8 women:
8! 6! 7  8 7  8
C  8,2      7  4  28.
2!  8  2 ! 2! 6! 1  2
Total number of different two committee:
C 12,3  C  8, 2   220  28  6160.
Answer: 6160.

25.
(a) We have 49 numbers and choose from them only 6, so, we will have:
49! 43! 44  45  46  47  48  49 44  45  46  47  48  49
C  49,6     
6!  49  6 ! 6! 43! 1 2  3  4  5  6
 11  3  23  47  8  49  13983816.
(b) We have only 24 even numbers in interval from 1 to 49, so, we will have:
24! 18!19  20  21  22  23  24 19  20  21  22  23  24
C  24,6     
6!  24  6 ! 6! 18! 1 2  3  4  5  6
 19  7  11  23  4  134596.
Answer: (a) 13983816. (b) 134596.