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:
for a a) {(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}
for b
b) {(1, 1), (1, 4), (2, 2), (3, 3), (4, 1)}
for c) {(1, 2), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (3, 4), (4, 1), (4, 2), (4, 3)}
for d d) {(2, 4), (3, 1), (3, 2), (3, 4)}
Step-by-step explanation:
in matrix, arrays are placed in rows , which represents the horizontal sides from left to right, while arrays in the column are placed vertically from top to bottom. Here, we placed the arrays in a 4x4 matrix
for a a) {(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}
for b
b) {(1, 1), (1, 4), (2, 2), (3, 3), (4, 1)}
for c) {(1, 2), (1, 3), (1, 4), (2, 1), (2, 3), (2, 4), (3, 1), (3, 2), (3, 4), (4, 1), (4, 2), (4, 3)}
for d d) {(2, 4), (3, 1), (3, 2), (3, 4)}