Proiect didactic-Probleme de numarare-2023

404.
Prove that the numbers Y n satisfy the relations:
1 1
¿ (a) Y n + Y 1 Y n−1+ Y 2 Y n−2 +…
2 3
1 1
¿ ⋯+ Y n= Y n+1
n+1 2
n
(b) Y 0 Y n +Y 1 Y n−1+ Y 2 Y n −2 +…+ Y n Y 0=4 ,
Y 0 Y n Y 1 Y n−1 Y 2 Y n−2
¿ (c) + + +…
1(n+1) 2 ×n 3(n−1)
YnY0 Y
¿ …+ = n+1
(n+1)×1 n+2
405.
In the numerical triangle
1
111
1 2 3 2 1
F 3 6 7 6 3 I
. . . . . . . . . . .
each number is equal to the sum of the numbers located in the preceding row above that
number and above the adjacent numbers to the right and to the left (if some of these numbers
are absent, they are taken to be zero). Prove that in every row, beginning with the third, there
is an even number.
406.
The first row of the numerical triangle
0123................... 1957 1958
3 5 . . . . . . . . . . . . . . . . . . . . 3915
..................................
eonsists of the numbers 0, 1, ..., 1958. The elements of each subsequent row consist of the
sums of the elements of the preceding row on the left and on the right of the given number.
Prove that the element of the last row of the triangle is divi- sible by 1958.
407.
Consider the Fibonacci sequence of numbers un :u0=0 ,u 1=1 ,u2 =1, u3=2, u 4=3 ,
u5=5 etc. (we began it with the terms 0 and 4, and not 4 and 2, as in Chapter VI). Prove that
(a) For any m and n we have un +m=u n−1 um +u n um +1

148
 Proiect didactic-Probleme de numarare-2023
(b) For any m and n= km the number un , is divisible by up. um

(c) Two successive terms of the Fibonacci sequence are relatively prime.
408.
Find the largest common divisor of the 1,000th and 770th terms of the Fibonacci sequence.
409.
Is there a number ending in four zeros among the first 100,000,001 terms of the Fibonacci
sequence?
410.
Eight numbers are taken in succession from the Fibonacci sequence. Prove that their sum is
not in the sequence.
441.
Prove that
(a) u 2+u 4 +…+u 2 n=u2 n+1−1,

(b) u1 +u3 +…+ u2 n−1=u2 n ,

(c) u21 +u22 +…+ u2n=un un +1 ,

(d) u2n +1=un un+ 2+¿

(e) u1 u2+ u2 u 3+ …+u2 n−1 u 2n =u22 n

(f) u1 u2+ u2 u 3+ …+u2 n u 2 n+1=u22 n +1−1

(g) ¿ n u1 +(n−1)u 2+(n−2) u3 +…+ 2u n−1 +¿∧+un=u n+ 4−(n+3)

(h) u3 n+2 −1
u3 +u6 + …+u3 n=
2
(i) u3 n=u 3n+1 +u3n−u3n−1

412.
Prove that any natural number NW can he repre- sented as a sum of Fibonacci numbers, each
number entering the sum at most once and no two successive numbers entering together.
413.
Let p ⩾q ⩾ r be integers such that p< q-+r and p + q+ r= 2s. There are p black, q white and r
red balls. Show that the number of ways of dividing these balls-between two persons so that
each gets s balls is
1 2 2 2
s + s+1− ( p + q +r )
2
2
414.
If g + r < p, then the answer in the preceding problem is increased by 1
( p−s )(p−s−1)
2

149
 Proiect didactic-Probleme de numarare-2023
415.
There are pg + r distinct objects, where 0 ⩽r < p. They are divided among p persons as
equally as possible (all receive either g or q + 1 objects). Show that the number of ways of
making such a division is equal to
( pq+ r)!
C ∼p
¿¿
416.
Compute the sum
m in i2 i1

∑❑ ∑ ❑ ⋯ ∑ ❑∑ ❑ 1
¿=1 ¿−1=1 i1=1 i 0=1

417.
Prove the identity
m
C n+m =∑ P ( k 1 , … , k m ,n−k 1 −…−k m +1 )

where the summation is extended over all nonnegative integral solutions of the equation
k 1+2 k 2 + …+m k m=m .

418.
Find the general solution of the recurrence relations:
(a) a n+2−7 an+1 +12 an =0 ,

(b) a n+2 +3 an +1−10 an =0

(c) a n+2−4 a n+1 +13 an=0

(d) a n+2 +9 a n=0

(e) a n+2 +4 an +1+ 4 a n=0 ,

(f) a n+3−9 an+ 2+26 an+1 −24 a n=0

(g) a n+3 +3 a n+2 +3 an +1+ an=0

(h) a n+4 + 4 a n=0

419.
Find a,, knowing the recurrence relation and the initial terms:
(a) a n+2−5 a n+1 +6 a n=0 , a1=1 , a 2=−7 ,

(b) a n+2−4 a n+1 +4 an=0 , a1=2 , a2=4 ,

(c) −1 −1
a n+2 +a n+1 +an =0 , a1= , a 2= ,
4 2
(d) a n+3−9 an+ 2+26 an+1 −24 a n=0 , a1=1,
a 2=−3 , a3=−29

150
 Proiect didactic-Probleme de numarare-2023

420.
Find a sequence such that a 1=cos ⁡α , a2=cos ⁡2 α and a n+2−2 cos ⁡α a n+1 +a n=0

421.
Prove that a sequence with the general term a n=nk satisfies the relation
1 2
a n+k −Ck an +k−1 +C k a n+k−2−…+¿

422.
Find a sequence such that
n
a n+2 +2 an +1−8 a n=2

423.
From the identity ¿ infer that
∑ ¿ (here and henceforth the sum is extended over nonnegative integral values of s for which
the left member of the equality is defined).
425.
From the identity ¿ infer that

∑ ❑¿
s=0

426.
From the identity ¿ infer that

∑ ❑C k−2
n
s s k
Cn +s−1=C n+ k−1
s=0

427.
From the identity ( 1−x 2 )− p−1=¿ infer that

∑ ❑¿
s=0

428.
From the identities
¿
And
¿
Infer that

∑ ❑C sp+ 8 C 22 pp +2+ms+ 1=2m−1 C mp + p−1

s=0

And

151
 Proiect didactic-Probleme de numarare-2023
∑ ❑¿
s=0

429.
Prove that
2 p+ m p
∑ ❑C sp+ s C 22 p+2 s
p+m =2
m−1
m
Cm + p−1
s=0

430.
From the identities
( 1−x ) ± 2 p ¿ ¿
Derive the formulas

∑ ❑¿
s=0

∑ ❑¿
s=0

∑ ❑¿
s=0

∑ ❑¿
s=0

Using them prove that

( p+2 m−1)!
∑ ❑C 22 sp+2 m C pp +m−s =22 m ( p +m) p !(2m)!
s=0

( p+2 m)!
∑ ❑C 22 s+1 p 2m
p+2 m +1 C p+m− s=2 (2 p +2 m+1)
p !(2 m+1)!
s=0

∑ ❑C 22 s−1 p
p+2 m C p +m−s =2
2 m−1 p
C p+2 m−1
s=1

∑ ❑C 22 sp+2 m +1 C pp+m− s=22 m C pp+ 2m

2

s=0

431.
Considering the formulas
¿

for positive and negative values of p, prove that

432.

Considering the expression

for all possible combinations of signs, derive the formulas

152
 Proiect didactic-Probleme de numarare-2023
¿
p−1 p 2p p −1 p 2p p
2 ∑ s=0 C p+2 s−1 C p +2 m−2 s=C 2 p+2 m +C p , ¿ 2∑ s=0 C p +2 s−1 C p +2m −2 s+1=C 2 p+2 m +1+C p+ m ,
¿

p −1 p 2p p
2 ∑s=0 C p +2 s C p +2 m−2 s=C 2 p+2 m+ 1−C p +m ,
p−1 p 2p p
2 ∑ s=0 C p+ 2 s C p+2 m−2 s +1=C 2 p +2 m+2 −C p +m+1

433.

From the relation

( )¿
m
1
1−
x

Infer that

∑ ❑¿
s=0

434.

Prove that,

∑ ❑¿
s=0

435.

From the equation

Infer that

∑ ❑¿
s=0

436.

From the identity,

Infer that for

m ⩾ hn

∑ ❑¿
s=0

437.

From the identity

( 1+ x ) ± p ( 1−x ) ± p=( 1−x 2 ) ± p

153
 Proiect didactic-Probleme de numarare-2023
Infer that

438.

Prove that

∑ ❑¿
s=0

439.

Denote the expression

a (a+1)(a+ 2)…(a+n−1)by ¿.Prove that

Solutions and answers

1.

By the rule of product, we get 5 X 3 = 15 routes.

2.

By the rule of product, we get 5 X 3 = 15 routes.

3.

20.

4.

8.

5.

9.

6.

48.

7.

25; 20.

8.

154
 Proiect didactic-Probleme de numarare-2023
480; 437.

9.

1,024; 4,032.

10.

We choose the white square in 32 ways and cross out the corresponding row and column.
There remain 24 black squares on the board. In all there are 32 X 24= 768 choices.

11.

By the rule of product, there_are 12 X 9 X 10 = = 1,080 ways

12.

In 6 X 5= 30 ways

13.

3 X 7 X 7 = 30 ways

13.

3X7X 7= 147.

14.

Either buy one copy of each novel or a set con- taining two novels and one copy of the third
novel. By the rules of sum and product, we get 6X3X4+5X4+7X 6= 134 ways.

15.

You can buy one more set containing the novels War and Peace and Fathers and Sons and one
copy of Crime and Punishment. We thus add 3 X 3 = 9 ways, bringing the total to 143 ways

16.

There is a greater number of choices when an apple is taken since 11 X 10 >12 x 9.

17.

6 X 8 X 10 = 480; if the first two teetotums fell on “4”, then the third can fall in 10 ways;
similarly for the cases when the other two teetotums fall on the same side; in all, we get 6+ 8+
+ 10 ways, but one way (when all three teetotums fall on “4”) is counted three times; and so
there are 22 ways left.

18.

Since the order of the colours plays no role, we have C 3b = 10 ways.

19.

155
 Proiect didactic-Probleme de numarare-2023
Here, the order of the colours is important; and so we have A85 =60 ways. If one of the bands
is red, then we have 3 × A 24=36 ways.

20.
2
A5 =20 dictionaries.

21.
2 2
A10− A 5=70

22.

We obtain permutations (with repetitions) of 13 cards four at a time. In all, 134 =28,561 ways.
4
If no pairs are allowed, we have permutations without repetitions: in all, A13 =17,160 .

23.

Since it suffices to draw one black and one white card, we have 132 = 169 choices.

24.

A child receives either one, two or three names, all different. The total is 300+ 300 x X 299 +
300 X 299 X 298 = 26,820,600 distinct names.

25.

Neighbours are preserved in cyclic permutations and in symmetric reflection. In the case of 4
persons, we have 2 X 4= 8 transformations that preserve the relation of being neighbours.
Since the total number of permutations of 4 per- sons is 4!= 24, we have 24/8 = 3 distinct se-
ating arrangements. If there are 7 persons at the table, we have 7!/14 = 360 ways; generally, in
the case of n persons, (n — 1)1/2 ways. The num- ber of ways in which 2 given persons are
together is twice the number of seating arrangements of 6 persons (since the people can
change places). Hence, it is 5! = 120. In exactly the same man- ner, the number of ways for a
given person to have two given neighbours is 4! = 24.

26.

One boy plays for one team, two for the other. The boys can be made into teams in 3 ways.
Then 3 girls out of 5 have to be chosen for the first team. This is done in C 25=10 ways. In all,
by the rule of product, we have 3 ×10 ¿ 30 ways of forming teams.

27.

The number of ways of partitioning n distinct objects into k groups is k n. In our case we have
6
3 =729 ways.

28.

By the rule of product, 7 X 9 = 63 ways.

156
 Proiect didactic-Probleme de numarare-2023
29.

The first can choose his books for exchanging in C 27=21 ways, the second in C 29=36 ways. In
all, 21 ×36=756 ways for exchanging books.

30.

Divide all modes of ordering the speakers into pairs, the modes consisting of the ways in
which A and B are obtained from one another by per- mutation. In each pair there is only one
mode that satisfies the stipulated condition. We there- fore have 5!/2 = 60 ways.

31.

If A speaks just before B, we can count them as one speaker. Therefore we get 4! = 24 ways.

32.
The choice of seats for the men and for the women can be made in two ways. Then the men
can be seated in their chosen places in 5! ways. There are just as many ways for seating the
women. We get a total of 2 ¿ ways.

33.

We get 10 times fewer ways than in the preceding problem, or 2,880 ways.

34.

The total number of ways of drawing 10 cards is C 10 52. The number of ways in which not a

single ace is drawn is C 48. Therefore, at least one ace will appear in C 18
10 10
32 −C 48 cases. Exactly

one ace in C 14 C948 cases, at least two aces in C 10 10 9

52 −C 48 −¿ 4 C 49 cases, and exactly two aces in
2 8 2 8
C 4 C 48 cases (we choose two aces in C 4 ways and another 8 cases out of 48 in C 48 ways).

35.
m
3 signals (see Problem 27).

36.

Denote each set of teeth by a sequence of zeros and ones (a zero indicates no tooth at a given
site, a one indicates the presence of a tooth). There are 232 such sequences. Since each
inhabitant has his own sequence, the number of inhabitants cannot exceed 22.

37.

First choose those passengers, of three, who are indifferent, and will be facing the front. This
can be done in 3 ways. On each row of seats there are 5 ! ways of reseating the passengers.
Hence, we get a total of 3 ¿ ways.

38.
4
A9 =3,024

157
 Proiect didactic-Probleme de numarare-2023
39.
5
C 52=2,598,960.

40.

There are 32 ×104 combinations containing one letter, 322 × 104 containing two letters, and
3 4 4
32 ×10 three letters. In all, by the rule of sum, there are 33,820 ×10 licence plate numbers.

41.

Of the five days, we have to choose two on which apples are given. There are C 25=10 ways in
all.

42.
m
C m+n .

43.

P (2, 3, 4) = 1,260.

44.

Since the oranges are distinct, we have A58 = 6,720 ways.

45.

Each orange goes to any one of the 8 sons. Therefore we get 85 =32,768 ways.

46.

P (4, 3, 3, 2, 1, 1);

P (3, 1, 1, 1, 4, 1);

P (2, 2, 2, 1, 4, 4).

47.
4 4
C 30=27,405 ; A 30=657,720.

48.

P (2, 2, 2, i, i) = 5,040.

49.

First choose 6 subscribers in C 8n ways. Arrange these subseribers in any order and divide them
up into pairs (first, second, then third, fourth and, finally, fifth and sixth). This can be done in
6 ! ways. Since the subscribers can be interchanged in each pair, and the order of the pairs is

158
 Proiect didactic-Probleme de numarare-2023
not important, the total number of ways must be divided by 23 ×31=48. We then get a total of
n!
ways.
48(n−6)!

50.
12 12 8 8 9
C 10=C21 ; C10=C 17 ; C 10 .

51.

We can choose two, three or four women. Two women may be chosen in C 24 ways. Then 4
men have to be chosen, which can be done in C 47 ways. By the rule of product, we get C 24 C74
ways. If three women are chosen, we get C 84 C37 ways, and if four women, then C 44 C3 ways.
The total is C 24 C74+ C34 C 37 +C 44 C 37=371 ways

52.

A number has to terminate in one out of 5 combinations: 12 , 24 , 32, 44 , 52. The first two
digits may be arbitrary. We get 52 ×5=125 numbers in all.

53.

Each one of n passengers can choose any one of m stops. We therefore have mn modes of
distribution. If we take into account only the number of passengers that get off at each of the
stops, have C m−1
m+n−1 ways.

54.

If a and b are adjacent, then we can combine them into a single symbol. Noting that a and b
can be interchanged, we get 2(n−1)! permutations in which a and b appear together.
Therefore, they fail to come together in n !−2(n−1)! permutations. Analogously, we find that
a , b , and c do not come together in n !−6( n−2)! permutations. No two elements a , b , c , stand
together in n !−6(n−1)!+ 6(n−2)! permutations (by the inclusion and exclusion formula).

55.

Three referees can choose the winner in 103 ways. They name three distinct candidates in
3
A10=¿ ¿ 720 cases. For this reason, in 280 cases at least two referees will have coincident
ratings. The portion of such cases is 0.28 .

56.

Since each student can receive three kinds of marks, we get 3 4=81 ways of passing the
examinations.

57.

Since the necklaces remain unchanged in cyclic permutations of the beads and when turned
7!
over, we can make =360 types of necklaces.
14

159
 Proiect didactic-Probleme de numarare-2023
58.

The kinds of necklaces differ as to the number of small beads between the two large beads. So
we get three types of necklace.

59.

The total number of different initials does not exceed 292=841, which is less than 2,000 .

60.
2 3 2
A10=604,800 ,C 10=120. If two girls are definitely invited to a dance, then there are A7 ways
of choosing their partners; the remaining 5 boys choose a partner out of 8 girls, which is done
in A58 ways; the total is A27 A58 =282,240 ways. Finally, if two given girls have been invited,
then another five girls can be chosen in C 68 ways.

61.

The officer may be chosen in C 3 ways, the sergeants in C 26 ways and the privates in C 20
60 ways.
1 2 20
By the rule of product, we get a total of C 3 C 8 C 60 choices. If the captain is included in the
detachment and the senior sergeant as well, we have C 15 C 20
60 choices.

62.

Four girls may be chosen in C 412 ways. We then choose boys in A15
4
ways (here, the order is
4 4
important). In all, there are C 12 A 15=17,417,400 choices.

63.

Each hen is either chosen or is not chosen. We thus get 23 choices of hens. Since at least one
hen has to be chosen we get 7 choices of hens. Analogously, there are 24 −1=15 choices of
ducks and 22−1=3 choices of geese, making a total of 7 ×15 × 3=315 choices.

64.

(m+ n+ p)!
This number is equal to P(m , n , p)= .
m! n! p !

65.

The books in black bindings can be permuted in m! ways, those in red, n! ways. In all, by the
rule of product, m! n! ways. If the black books: stand together, then we have also to choose
for them a place between the books in red bindings. This can be done in n+ 1 ways. The total
is m! n! (n-+4)=ml! (n + 1)! ways.

66.

Each one of the 15 men may either be included or not included. Since the group cannot be
empty, we have 215−1=32,767 ways. For n men, there are 2n−1 ways.

67.
160
 Proiect didactic-Probleme de numarare-2023
The number k can enter into the given divisor α with exponents 0 , 1 , … , α k in a total of α k +1
p
ways. By the rule of product, the number of divisors is equal to ( α 1 +1 ) ⋯ ( α n +1 ). To find the
sum of the divisors, consider the expression

(1+ p 1+ …+ p α1 ) … (1+ pn +…+ p αn )

1 n

Removing brackets, we get a sum which includes each divisor exactly once. By the furmula
for the sum of a geometric progression, we find that this sum is
α 1+1 αn +1
p 1 −1 pn −1
⋯
p1−1 pn−1

68.

First put one coin in each envelope. Then we have to distribute 7 coins into 5 envelopes. This
can be done in C 411=330 ways (see page 122 ).

69.

Add to the 20 books 4 identical dividing objects and consider all permutations of the obtained
entities. There are 24!/4!. To each permutation corresponds a definite arrangement of the
books.

70.

As in the preceding problem, we find the total number of ways to be 8!/3! = 6,720.

71.

Since only the number of votes cast for each proposal is taken into account, we have to distri-
bute 30 identical “objects” into 5 “cells”. To do this, append four identical dividing objects
and take all permutations of the entities obtained. The total number is P (30, 4) = 46,376.
With every permutation is associated a distinct distri- bution of votes.

72.

12 books can be bound in three colours in 312 ways. Of this number, there will be 3 ×212 cases
when the books appear in at most two colours, and three cases in one colour. By the inclusion
and exclusion formula, the books will appear in bindings of all three colours in 312−3 ×
12
×2 +3=519,156 cases.

73.

Append to the 32 letters 5 identical "dividing elements" and consider all permutations of the
resulting entities, in which not a single dividing element comes at the beginning or at the end
and ao two come together. The letters can be permuted in 32 ! ways, and there are 31
positions for the lividers, which can be placed in C 531 ways. Noting hat the order of the words
is of no importance, we get 32 ! C531 /6 ! ways of forming words.

74.

161
 Proiect didactic-Probleme de numarare-2023
12 persons can be chosen in C 12 12 ways. The two given persons are included in the chosen

group in C 15 cases. This leaves C 12

10 10
17 −C 15 admissible choices.

75.

If all the chosen precious stones are of one kind, then in three ways, if two kinds are chosen,
then in 2 C13 =6 ways, and if all three are distinct, then in 1 way: a total of 10 ways.

76.

If all the chosen precious stones are of one kind, then in three ways, if two kinds are chosen,
then in 2 C13 =6 ways, and if all three are distinct, then in 1 way: a total of 10 ways.

77.

The cups can be arranged in A34 ways, the saucers in A } ways and the spoons in A Ω ways,
which, by the rule of product, makes a total of A34 × × A 35 A 36=172,800 ways.

78.

If the husband invites k women, then he invites 6−k men. Then the wife invites 6−k women
and k men. By the rules of sum and product, this choice can be made in
5

∑ ❑ ( Ck5 ) ( C6−k
2 2
7 ) =267,148 ways
k=0

79.

The port side can accommodate 0, 1, 2, 3, or 4 persons from among those who are indifferent
to the choice. But if & persons are chosen among them, then it is necessary to choose another
4 —k persons from the 10 that prefer the port side. Then there remain 12 + (9 — k)
candidates, from among which we choose the 4 rowers for the starboard side. We have a total
of C k9 C 410−k C 421−k choices. Summing with respect to k , we get the answer:
4 4
9 ! 10 ! (21−k )!
∑ ❑C k
9 C k−k
10 C 4
21−k =¿= ∑ ❑
4 ! k=0 k ! (9−k )! (4−k ) !(6 +k )! (17−k )!
k=0

80.

The number 9 may be partitioned into three distinct parts in three ways: 9=1+2+6
¿ 1+3+5=2+3+4. A sum less than 9 will occur in 4 cases: 1+2+3=6 , 1+ 2+ ¿
+ 4=7 ,1+2+5=1+3+ 4=8. Since 3 counters may be drawn in C 310 ways, the sum is not less
than 9 in C 310−4=116 cases.

81.

First choose one card of each suit. This can be done in 134 ways. Then choose another two
cards. If they are of different suits, this can be done in C 24 ×122=864 ways. Combining these
choices with the distinct ways of choosing the first 4 cards and taking into account the
permutations of the order of choice of two cards of each suit, we obtain 216 ×13 4 ways. If the
162
 Proiect didactic-Probleme de numarare-2023
two new cards are of the same suit, then we get 4 ×C 212=264 choices. The same reasoning
leads to 88 ×13 4 choices of all cards. This yields 304 × 134 ways in all.

82.

On the first day, the participants may be chosen in C 610=210 ways, on the second, in
6 6
C 10−1=¿ ¿ 209 ways, on the third, in C 10−2=208 ways, making a total of 210 ×209 × 208=¿
¿ 9,129,120 ways.

83.

Since C 35=20, each choice of company will be utilized exactly once. The number of
permutations of these choices is equal to 201

84.

Each boy can choose from 5 jobs and each girl from 4 jobs. We get a total of 53 × 42=2,000
choices.

Bibliografie: N. Vilenkin, Combinatorial Mathematics for recreation, MIR publishers, 1972

Autor: Cornea David-Nicolas, Liceul Teoretic Callatis, Mangalia, Constanța, România, 2023.

163