subject
Mathematics, 18.07.2019 18:00 hunterbesch03

There are 18 students, three (disjnct) students each from 6 different high schools. there are 6 admissions officers, one from each of 6 colleges. each of the officers successively picks a subset of three of the 18 students to go to their college (once a student is chosen, another college cannot chose her later). how many ways are there to do this so that no officer picks 3 students from the same high

ansver
Answers: 1

Another question on Mathematics

question
Mathematics, 20.06.2019 18:04
About 400,000 people visited an art museum in december. what could be the exact number of people who visited the art museum?
Answers: 3
question
Mathematics, 21.06.2019 17:00
How many credit hours will a student have to take for the two tuition costs to be equal? round the answer to the nearest tenth of an hour.
Answers: 1
question
Mathematics, 21.06.2019 19:00
Me with geometry ! in this figure, bc is a perpendicular bisects of kj. dm is the angle bisects of bdj. what is the measure of bdm? •60° •90° •30° •45°
Answers: 2
question
Mathematics, 21.06.2019 19:30
Julian wrote the following numeric pattern on the board3,10,17,24,31,38.what numbers of julian's pattern are compound numbers.
Answers: 2
You know the right answer?
There are 18 students, three (disjnct) students each from 6 different high schools. there are 6 admi...
Questions
question
Mathematics, 18.03.2021 01:40
question
Mathematics, 18.03.2021 01:40
question
Mathematics, 18.03.2021 01:40
question
Computers and Technology, 18.03.2021 01:40
question
History, 18.03.2021 01:40
Questions on the website: 13722367