1
a

Een manier van oplossen is als volgt.

  • Ada mag als eerste kiezen; zij heeft keuze uit vijf plaatsen.

  • Betty heeft dan nog keuze uit vier stoelen.

  • Christiane kan nog uit drie stoelen kiezen.

  • Voor Diana zijn er nog twee mogelijkheden.

  • En Ellen rest slechts één stoel.

Het aantal rangschikkingen is:
keus 1 keus 2 keus 3 keus 4 geen keus ↓ ↓ ↓ ↓ ↓ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 120

b

6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 720  rangschikkingen

2
a

6 ! = 720

8 ! = 40320

7 ! = 5040

9 ! = 362880

b

Ja, want 10 ! = 9 ! ⋅ 10 .

c

n ! = n ⋅ ( n − 1 ) !

3

10 ! ⋅ 11 ⋅ 12 = 479.001.600

4
a

15 . Ja, dit klopt.

b

25 ! 23 ! = 25 ⋅ 24 ⋅ 23 ⋅ 22 ⋅ 21 ⋅ ... ⋅ 2 ⋅ 1                 23 ⋅ 22 ⋅ 21 ⋅ ... ⋅ 2 ⋅ 1 = 25 ⋅ 24 = 600

5
a

12 ⋅ 11 ⋅ 10 ⋅ 9 ⋅ 8 = 12 ! : 7 !

b

41 ⋅ 40 ⋅ 39 ⋅ 38 ⋅ 37 ⋅ 36 = 41 ! : 35 !

c

n ⋅ ( n − 1 ) ⋅ ( n − 2 ) ⋅ ( n − 3 ) ⋅ ( n − 4 ) = n ! : ( n − 5 ) !

6
a

6 ⋅ 5 ⋅ 4 ⋅ 3 = 360  rangschikkingen ; 6 - 5 - 4 - 3 -wegendiagram

b

6 ⋅ 6 ⋅ 6 ⋅ 6 = 6 4 = 1296  rangschikkingen ; 6 - 6 - 6 - 6 -wegendiagram

7

10 ⋅ 9 ⋅ 8 ⋅ 7 = 5040

8
a

9 ⋅ 8 ⋅ 7 ⋅ 6 = 3024

b

9 ! 5 ! = 9 ⋅ 8 ⋅ 7 ⋅ 6 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1             5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 1 = 9 ⋅ 8 ⋅ 7 ⋅ 6

c

26 ! 13 ! ; 26 ! 6 !

9
a

6,48 ⋅ 10 16

b

5,60 ⋅ 10 23 ; 4,03 ⋅ 10 26

c

Je kunt geen permutatie van 30 uit 26 nemen; het is zonder terugleggen.

10

9 ! = 362.880 ; 9 P 9 = 362.880

11
a

7 ! = 5040  roosters

b

5040 : 2 = 2520  roosters

c

2 ! ⋅ 2 ! ⋅ 3 ! = 24  roosters

12
a

100 P 4 = 100 ⋅ 99 ⋅ 98 ⋅ 97 = 94.109.400  trekkingslijsten

b

50 P 4 = 50 ⋅ 49 ⋅ 48 ⋅ 47 = 5.527.200  trekkingslijsten

c

Dat kan op vier manieren: oeee, eoee, eeoe, eeeo
4 ⋅ 50 ⋅ 50 ⋅ 49 ⋅ 48 = 23.520.000  trekkingslijsten

13
a

17 2 ⋅ 17 2 ⋅ 10 2 = 8.352.100  nummerborden

b

2 ⋅ 17 ⋅ 17 2 ⋅ 10 2 = 982.600  nummerborden

c

17 ⋅ 16 ⋅ 15 ⋅ 14 ⋅ 10 ⋅ 9 = 5.140.800  nummerborden

d

5.140.800 8.352.100 ⋅ 100 % = 61,55... % ; 61,55... % van  25 = 15  auto’s

e

17 2 = 289  nummerborden