A fair sortition trial is carried out, and one of the candidates is assigned the number 32,041. If each digit can be chosen from 0-4, and if each of the possible sequences is assigned to a candidate, how many candidates are there? a. 4

b. 5

c. 625

d. 1,024

e. 3,125

Question

Mathematics

Ryker Holden

2 December, 02:37

A fair sortition trial is carried out, and one of the candidates is assigned the number 32,041. If each digit can be chosen from 0-4, and if each of the possible sequences is assigned to a candidate, how many candidates are there? a. 4

b. 5

c. 625

d. 1,024

e. 3,125

+3

Answers (1)

Know the Answer?

Biscuit · Answer 1

We can use the fundamental counting theory to determine the number of possible ways in which a 5-digit can be assigned from zero to four. In this case, the first to fifth digit can be assigned from zero to four. Hence the sequence is 5*5*5*5*5 equal to D. 3125

A fair sortition trial is carried out, and one of the candidates is assigned the number 32,041. If each digit can be chosen from 0-4, and if each of the possible sequences is assigned to a candidate, how many candidates are there? a. 4b. 5c. 625d. 1,024e. 3,125

A fair sortition trial is carried out, and one of the candidates is assigned the number 32,041. If each digit can be chosen from 0-4, and if each of the possible sequences is assigned to a candidate, how many candidates are there? a. 4

b. 5

c. 625

d. 1,024

e. 3,125