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

im alright what do you need

step-by-step explanation:

x + y = 90 5x – 10y = 90 90 – 10y = 5x 90 + 10y = 5x

step-by-step explanation:

last month maria hiked the 5-mile mountain trail a number of times and she hiked the 10-mile canal trail several times. let x represent the number of times she hiked the 5-mile trail, and let y represent the number of times she hiked the 10-mile trail. if she hiked a total of 90 miles, which equation can be used to find the number of times maria hiked each trail? x + y = 90 5x – 10y = 90 90 – 10y = 5x 90 + 10y = 5x