Are these permutation or combination problems?
1. suppose you need to choose a new combination for your combination lock. you have to choose three numbers, each different and between 0 and 40. how many combinations are there?
2. you want to construct a 3 digit number from the digits 4,6,8,9. how many possible numbers are there?

1. 63,960 total permutations

2. 24 or 64

Step-by-step explanation:

They are permutation problems, because the order of the elements matter (because 1-2-3 is different than 3-2-1).

In a combination, the order of the elements don't matter (so, 1-2-3 is the same as 3-2-1).

1. Lock combination.

You can choose from 41 different numbers and you have to pick 3. The formula is:

Where n is the total numbers possible (41) and r is the quantity of numbers you have to pick (3).

For the first number, you can choose from 41 different numbers, so there are 41 possibilities.

For the second number, you cannot choose the same as the first one, so you are now limited to 40 possibilities.

For the third number, you are down to 39 possibilities since you cannot pick the same as the first two ones.

So, you have 41 * 40 * 39 = 63,960 possibilities in total.

2. Construct a 3-digit number from digits 4,6,8,9

This question doesn't specify if you can pick the same digit twice or not.

If you cannot, then the same formula as above applies:

Where n is the total numbers possible (4) and r is the quantity of numbers you have to pick (3).

If you can choose the same digit twice, then the formula is:

64 different numbers if you can pick the same number twice... which is logic since for the first number you have a choice among 4, same for the second and third number... so 4 * 4 * 4 = 64.

the figures below are made out of circles, semicircles, quarter … find the area and the perimeter of each figure and give your answers as a completely simplified exact value in terms of π (no approximations). remember that we'll also have to cut whatever areas we get in half, since we're only dealing

step-by-step explanation:

answer: haha (: i’ll go see what it is

step-by-step explanation: