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:
Step-by-step explanation:
Given is a differential equation as

Divide this by t to get in linear form

This is of the form
y' +p(t) y = Q(t)
where p(t) = 1/t
So solution would be

siubstitute y(1) = 16

It’s unsolvable with out more context. What’s the rest of the problem.
Answer:
-3x
Step-by-step explanation: