M2 A 11.1

Front

What is the Fundamental Counting Principle?

Back

The Fundamental Counting Principle states that if there are 'm' ways to do one thing and 'n' ways to do another, then there are m × n ways to do both.

Front

How do you calculate the number of combinations?

Back

The number of combinations of 'n' items taken 'r' at a time is calculated using the formula: C(n, r) = n! / (r!(n - r)!) where '!' denotes factorial.

Front

What is a permutation?

Back

A permutation is an arrangement of objects in a specific order. The number of permutations of 'n' objects is n!.

Front

How many different three-digit PINs can be created using digits 0-9?

Back

There are 1000 different three-digit PINs (from 000 to 999).

Front

What is the formula for calculating permutations of 'n' items taken 'r' at a time?

Back

The formula is P(n, r) = n! / (n - r)!.

Front

If Erik can choose from 5 cake flavors, 7 icing flavors, and 3 topping flavors, how many different cakes can he create?

Back

Erik can create 105 different cakes (5 × 7 × 3 = 105).

Front

What is the difference between combinations and permutations?

Back

Combinations are selections where order does not matter, while permutations are arrangements where order does matter.

Front

How many ways can 14 candy bars be chosen if Andy wants to select 5?

Back

Andy can choose 5 candy bars in 2002 different ways.

Front

What is the factorial of a number?

Back

The factorial of a number 'n', denoted as n!, is the product of all positive integers from 1 to n.

Front

How many ways can 125 juniors elect a president, vice president, and secretary?

Back

There are 1,906,500 ways to elect a president, vice president, and secretary.