There are 25 students that would like to go on a field trip, but only 18 may go. how many different combinations of students could go on the trip.

480700. The different combinations of students that could go on the trip with a total of 25 student, but only 18 may go, is 480700.

The key to solve this problem is using the combination formula . This mean the number of ways to choose a sample of r elements from a set of n distinct objects where order does not matter and replacements are not allowed.

The total of students is n and the only that 18 students may go is r:

∠1≅∠2 by the alternate exterior angles theorem.

step-by-step explanation:

given, a ∥ b and ∠1 ≅ ∠3 .we have to prove that e ∥ f

we know that ∠1≅∠3 and that a || b because they are given. we see that by the alternate exterior angles theorem. therefore, ∠2≅∠3 by the transitive property. so, we can conclude that e || f by the converse alternate exterior angles theorem.

we have to fill the missing statement.

transitivity property states that if a = b and b = c, then a = c.

now, given ∠1≅∠3 and by transitivity property ∠2≅∠3 .

hence, to apply transitivity property one angle must be common which is not in result after applying this property which is ∠1.

the only options in which ∠1 is present are ∠1 and ∠2, ∠1 and ∠4

∠1 and ∠4 is not possible ∵ after applying transitivity we didn't get ∠4.

hence, the missing statement is ∠1≅∠2.

so, ∠1≅∠2 by the alternate exterior angles theorem.

2 2/3 hours duhh silly

step-by-step explanation: