Permutations - practice problems - page 2 of 12
Number of problems found: 230
- Natural numbers
Determine the number of all natural numbers greater than 200 in which the digits 1, 2, 4, 6, and 8 occur at most once each. - Different 79704
Thirty-two boys and 34 girls came to the dance. How many different dance pairs can they make, given that each team is given: they can only dance for 1 minute and then take turns in 5 seconds? Calculate how long the dance evening would last for all the pai - Completely 79274
Kitchen cabinets are sold in widths of 80 cm, 60 cm, and 40 cm. Which assembly can we choose if we have a wall 3.5 m long and we want to completely fill it with an assembly that also includes a dishwasher, the width of which is 60 cm, and the stove is 50 - Socks
Ben's favorite colors are blue and green. He has six blue socks and six green socks in his sock drawer. Unfortunately, they are completely mixed up, and one day, he has to grab some socks to wear in complete darkness. How many socks (minimum) does he have - Non equivalent ints
Two n-digit integers are said to be equivalent if one is a permutation of the other. Find the number of 5-digit integers such no two are equivalent. If the digit 5,7,9 can appear at most one, how many non-equivalent five-digit integers are there? - A fair coin
A fair coin is tossed twice. Write down the set of possible outcomes. What is the probability of obtaining it? I. Exactly one head ii. No head - Equilateral 75284
Given are 6 line segments with lengths of 3 cm, 4 cm, 5 cm, 7 cm, 8 cm, and 9 cm. How many equilateral triangles can make from them? List all the options. - Four digit codes
Given the digits 0-7. If repetition is not allowed, how many four-digit codes that are greater than 2000 and divisible by 4 are possible? - Indistinguishable 74294
We have eight compartments where we put three indistinguishable balls and two distinguishable ones. How many options do we have? - Seven segments display
Electronic devices sometimes use the type of digits below, where each digit uses some short stripes. For example, seven uses three small stripes. What is the largest three-digit number that you can make if you use twenty stripes? - Competition 73174
There are 10 students in the class, of which 8 are girls and two are boys. We want to select three for the competition. What is the probability that they will be: a) 2 girls and 1 boy b) 1 girl and 2 boys c) 3 girls d) 3 boys e) at least 2 girls - Parking 72644
How many ways can ten cars park side by side in a parking lot? - Numbers 72404
How many numbers are less than 200, the digit sum of which is 6? - Probability 72324
We used the digits 2, 3, 4, 5, and 7 when entering the PIN code, and we only used each digit once. What is the probability that someone will guess our PIN code on the first try? - Three-digit 72184
How many three-digit numbers can be created from the numbers 1, 2, 3, and 4 if you can repeat them? - Identical 71234
How many ways can you divide two identical apples and: a) 3, b) 4, c) 5 identical pears between Janka and Mařenka? - Assemble 70414
How many ways can we assemble five wagons when sand is in three wagons and cement in two? - Distribute 70244
We have to distribute the keys to the safe among four people so that no two of them can open the safe but in such a way that any three can open the safe. How many minimum keys do we need? How to divide them? How many minimum locks must be on the safe? All - Together 70124
Twins Ela and Nela came to the cinema together with their friend Hela. Only the first 10 seats in the third row are free. How many ways can they be seated if the twins want to sit next to each other, with Nela always to Ela's left and Hel right next to on - Altogether 69994
Twelve players signed up for the squash tournament. Based on the lottery, they formed pairs, and in the first round, each pair played one match. The winners advanced to the second round, where they played each other one game at a time. How many matches we
Do you have homework that you need help solving? Ask a question, and we will try to solve it.