Application of FCP to Counting Problems (Grade 12 NSC Matric Mathematics): Flashcards

📚Flashcards
Application of FCP to Counting Problems
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

10 cards from this deck

Show

FCP for sequential choices

Multiply the number of available options at each step

Strategy for objects that must be together

Treat them as a single unit

Complementary counting formula

Total valid = All possible - Forbidden arrangements

Formula for arrangements with identical objects

n!n1!×n2!×...×nk!\frac{n!}{n_1! \times n_2! \times ... \times n_k!}

Race: 8 athletes, first 3 places calculation

8×7×6=3368 \times 7 \times 6 = 336 ways

7 boys, youngest & oldest together, arrangements

6!×2!=14406! \times 2! = 1440 ways

Arrangements of OMO (2 identical O's)

3!2!=3\frac{3!}{2!} = 3 arrangements

Arrangements of BASSOON (2 S's, 2 O's)

7!2!×2!=1260\frac{7!}{2! \times 2!} = 1260 arrangements

3-digit numbers from digits 1-6, no repetition

6×5×4=1206 \times 5 \times 4 = 120 numbers

Strategy for objects that must NOT be together

Use complementary counting: all - unwanted

Explore Grade 12 NSC Matric Mathematics Revision Notes by Topics

Explore Grade 12 NSC Matric Mathematics Model Answers by Topics

Explore Grade 12 NSC Matric Mathematics Quizzes by Topics

Explore Grade 12 NSC Matric Mathematics Exam Questions by Topics

Join 100,000+ NSC Matric students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.