Answer: 4
Step-by-step explanation:
We know that a plane is 2 dimensional surface that extends infinitely far.
The number of points required to define a plane = 3
Here , we have 4 points A, B, C, and D.
So, the number of possible combinations of 3 points to make a plane from 4 points = 
[ 
]
Hence, the greatest number of planes determined using any three of the points A, B, C, and D if no three points are collinear = 4.
Answer:
it is False
Step-by-step explanation:
Answer:
Step-by-step explanation:
so when remembering how to write ordered pairs, think of the monkey bars. you have to get there before you can climb up, x being walking to the monkey bars and y being climbing up them. Think of the steps to get to the monkey bars compared to the fact that x is before y. getting to the monkey bars comes before climbing them, is x (run) and climbing them would be y (rise), and not the other way around because like the question said; x comes before y.
I really hope this wasn't too confusing. I'm really sorry if it was!
Hope this helps! :)
