The wording of the question leaves room for two interpretations, but I believe the expected answer is six. Think of the "Star of David" (also known as the Magen David). See the "Web Link" at the bottom left. But that's for only one orientation. There are an infinite number of points on each line segment, so if you rotate one triangle with respect to the other, different pairs of points will be involved.
In three-dimensional space, two planes can either:* not intersect at all, * intersect in a line, * or they can be the same plane; in this case, the intersection is an entire plane.
If it's a line it would only be 1, but if it's a parabola, or something with a curve, it could be multiple times.
You need numbers from the sides of the triangles. Take numbers from the corresponding (matching) sides, one number from the small triangle, and one number from the big triangle. Then divide the big number by the small number. The answer is the scale factor. Put another way, the scale factor is the number that multiplies the small triangle to create the large triangle.
The area of a triangle can be a rational number or an irrational number depending on its dimensions.
Yes, except when the line is in the plane. In the latter case, they intersect at each point on the line (an infinite number).
one
5
1.
A triangle can have only one obtuse angle
32
Just the one
6 maximum points of intersection
In three-dimensional space, two planes can either:* not intersect at all, * intersect in a line, * or they can be the same plane; in this case, the intersection is an entire plane.
"The sum of a number and three times another number is 18. find the numbers if their product is a maximum?"
Another name for base is the number on the bottom of the triangle.
false they intersect at a single point
You initially assume that the first number you want to compare is the maximum. Call this "maximum", for example. Then you iterate through all the other numbers you want to compare, and if you find a number that is larger than "maximum", copy this number to "maximum". To iterate through all the elements of a matrix, you have to use two "for" loops with indices, which are traditionally called "i" and "j". To restrict to an upper triangle for example, you need to calculate the corresponding range for the indices.