Task 2: Recurrence relations and counting techniques.

River Benigno Hernandez Acosta

National Open and Distance University Unad

School of Basic Sciences, Technology and Engineering.
Discrete mathematics
Tutor Adonai Alba Carvajal
Group 204041_290
Facatativa, Cundinamarca
October 20, 2021

1
 Student a
Develop the five counting theory exercises given below. Each exercise must
show the step by step in a logical manner, and must be solved graphically
and/or analytically when possible.

1. In an educational establishment, 35 students take physics classes, 25

students take chemistry classes, and 10 students take both subjects. How
many students are there in total?

Draw-io: https://app.diagrams.net/#G1OGFzFJ7eLpLvHoh1Smx12lBZLQpiv-RK

2
 2. Automobile plates are to be produced under the following conditions:
each plate begins with two letters taken from the following set {A, B, C, D,
E, F, G} and must end with four digits. If no letter or digit can be repeated.
How many different plates are possible with the previous conditions?

Draw-io: https://app.diagrams.net/#G1ZlDkdZgiYFmcqzygbjFS2Vy1pdJQnam-

3. The menu of a cafeteria consists of two starters, four main dishes and
three drinks according to the following table:

Entrance Main dish Drinks

3
Nachos (N) Hot dog (P) Soda (G)
Salad (E) Hamburger (H) Lemonade (L)
Arepa with cheese (A) Beer (C.)
Tamale (T)

To solve the problem we use the tree method.

4
Draw-io: https://app.diagrams.net/#G1wSPY5GkD1ETiDUMFUV70yE28SkjJJ_Ta

5
 4. a) From a group of 15 people, a group made up of a president, a
secretary and a member must be chosen. In how many ways can such a
committee be formed?
15 ! 15 ! 12! 13.14 .15
15 V 3= = = =2730
( 15−3 ) ! 12 ! 12!

15 v =2730
3

b) Determine how many ways four different committees can be formed from
a group of 25 people, if the committees must have 4,5,8 and 6 people,
respectively.

N! 25 !
N=25= = = 9276201534600
m! r ! s ! t ! (k !) 4 ! 5 ! 6 ! 8 ! 2

M=4 k =N−(m+r + s+t)

R=5 k =25−(4+5+8+ 6)
S=8 k =25−23
T=6 k= 2

6
 5. a) In how many different ways can a committee of two women and four
men be chosen from a group of six women and five men?

M=6
H=5

n! 6! 4 ! .5 .6 6.5 30
nCm= =6 C 2= = = = =15
( n−m) ! m! ( 6−2 ) ! 2! 4 ! 2 ! 2! 2

There are 15 ways to choose the women's committee.

n! 5! 4 ! .5 5 5
nCm= =4 C 5= = = = =5
( n−m) ! m! ( 5−4 ) ! 4 ! 1! 4 ! 1! 1
There are 5 ways to choose the Men's committee.

Answer: 15 * 5 = 75

75 different ways to form the mixed committee (between men and women).

b) Determine how many ways it is possible to select 12 blue marbles in five

bags.

n+k −1 12+5−1 16
¿ = =
k 5 5

Combinatorics:

n!
nCm=
( n−m) ! m!

16 ! 16 ! 11! .12.13 .14 .15 .16 524160 524160

¿ = = = = =4368
( 16−5 ) ! 5 ! 11! 5 ! 11! 5 ! 5 120

7
8
 Concurrency exercises.

1 1
1) - In the geometric progression {an} = { , , 1, ...}, if it is assumed that it consists of only
25 5
10 terms.

1
a=
25
r=5

n=Term -1

n−1 1 n−1
a∗r = ∗5
25

1 1−1 1 2−1 1 3 −1 1 4−1 1 5−1 1 6−1 1 7 −1 1 8−1 1 9−1 1 10−1

=5 =5 =5 =5 =5 =5 =5 =5 =5 =5
25 25 25 25 25 25 25 25 25 25

1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9
=5 =5 =5 =5 =5 =5 =5 =5 =5 =5
25 25 25 25 25 25 25 25 25 25

1 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9
=5 =5 =5 =5 =5 =5 =5 =5 =5 =5
25 25 25 25 25 25 25 25 25 25
1 1
∗1=
25 25
1 1
∗5=
25 5
1 1
∗25=
25 25
1
∗125=5
25
1
∗625=25
25

9
 1
∗3125=125
25
1
∗15625=625
25
1
∗78125=3125
25
1
∗390625=15125
25
1
∗1953125=78125
25

Determine:

The sum of the 10 terms.

a10=78125

a n r −a n
sn=
r−1
1
78125∗5−
2
s10=
5−1
390624.96
s10=
4
s10=97656 ,2

The product of all terms.

pn=± ❑√ ( a1∗an )2

p10=± ❑ (√ 251 ∗78125) 10

p10=± √( 3.25 )10

❑

p10=± ❑√ 13147210297
p10=114661.285083501

10
Answers: Last term : 78125; Sum : 97656.2: Product : 114661.285083501

2) Match each recurrence sequence with its respective recurrence relation.

If any(s) do not apply, explain why.

Recurrence sequences: Recurrence relations:

a) -9, -3, 3, 9, ... 1) an = (-an-1) /3

b) -1, 3, 3, 15, ... 2) an = (12an-1 -12an-2+an-3) /8

c) -9, -3, 9, -2457, ... 3) an = 2an-1 - an-2

d) -9, 3, -1, 1/3, ... 4) an = -3an-1+81an-2-243an-3

e) -9, -3, 3, 45/8, ... 5) an = 2an-1+3an-2

Verification:

a) -9, -3, 3, 9,….

a1= -9

a2= -3

a3= 3

11
a4= 9

a0= -15

a-1= -21

-9, -3, 3, 9,…. a n=2 an−1−an−2

a 1=2 a1−1−a 1−2

a 1=2∗(−15 )−(−21)

a 1=−30+21

a 1=−9

b) -1, 3, 3, 15, ...

Find: a3

-1, 3, 3, 15, ... an=2 an−1 +3 an−2

a 3=2 (−1−(−1 ) ) +3 (−1−(−2 ) )

a 3=0+3

a 3=3

d.) -9, 3, -1, 1/3, ... a n=(−an−1 )/3

(−(−9))
Find: a-1 a−9=
3
−3
a−9=
3
a−9=−1

Recurrence sequences: Recurrence relations:

12
a) -9, -3, 3, 9, ... 1) an = (-an-1) /3

b) -1, 3, 3, 15, ... 2) an = (12an-1 -12an-2+an-3) /8

c) -9, -3, 9, -2457, ... 3) an = 2an-1 - an-2

d) -9, 3, -1, 1/3, ... 4) an = -3an-1+81an-2-243an-3

e) -9, -3, 3, 45/8, ... 5) an = 2an-1+3an-2

Recurrence successions that do not correspond:

C) -9, -3, 9, -2457, ...

e) -9, -3, 3, 45/8, ...

Because no recurrence relationship was found trying the different formulas.

https://drive.google.com/file/d/1RbJnuPWCaX7yIqMsqLNMVa-enqnBXNSJ/view?usp=drivesdk

13
 Conclusions
This work shows the progress with the different study guides that were
consulted to carry out the activity, using different mathematical methods.
The different proposed exercises are carried out, checking formulas and
attaching graphs from the geometric program.
The concurrent exercises are also carried out where the self-feeding is done
with the video explanation in which the two mathematical problems are
presented.

The mathematical progress is evident in this work.

14
 Bibliographic references

Villalpando, B. J. F. (2014). Recurrence relationship and recurrence succession. Discrete

Mathematics Applications and exercises. (pp. 112- 136) Mexico: Larousse -

Grupo Editorial Patria. Retrieved from: https://elibro-

net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

Villalpando, B. J. F. (2014). Sum and product rules. Discrete Mathematics Applications and

exercises. (pp. 144- 150) Mexico: Larousse - Grupo Editorial Patria. Retrieved

from: https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

Villalpando, B. J. F. (2014). Counting resources: lists and trees. Discrete Mathematics

Applications and exercises. (pp. 150- 152) Mexico: Larousse - Grupo Editorial

Patria. Recovered from

https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

15
Villalpando, B. J. F. (2014). Permutations and combinations. Discrete Mathematics

Applications and exercises. (pp. 152- 158) Mexico: Larousse - Grupo Editorial

Patria. Recovered from

https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

Villalpando, B. J. F. (2014). Generalized permutations and combinations. Discrete

Mathematics Applications and exercises. (pp. 158- 162) Mexico: Larousse -

Grupo Editorial Patria. Recovered from https://elibro-

net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

Villalpando, B. J. F. (2014). Inclusion-exclusion principle. Discrete Mathematics

Applications and exercises. (pp. 163- 167) Mexico: Larousse - Grupo Editorial

Patria. Recovered from

https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

Villalpando, B. J. F. (2014). Dirichlet principle. Discrete Mathematics Applications and

exercises. (pp. 167- 169) Mexico: Larousse - Grupo Editorial Patria. Recovered

from https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

16