Respuesta :

konrad509

The order matters.

[tex]k [/tex] objects can be chosen out of [tex] n [/tex] objects, when the order matters, in [tex] P(n,k)=\dfrac{n!}{(n-k)!} [/tex] ways.

So, the answer is [tex] P(10,2)=\dfrac{10!}{8!}=9\cdot10=90 [/tex] ways.

The total number of ways that the students who go first and second be chosen is; 90 ways

How to solve Permutations?

We are given;

Total number of students participating; n = 10

Number of possible choices = 2

This is a permutation question and as such we will use the formula for permutation which is; nPr = n!/(n - r)!

Thus; 10P2 = 10!/(10 - 2)!

⇒ 90 ways

Read more about Permuation at; https://brainly.com/question/11732255

Otras preguntas