There can be a maximum of 15 intersections. With two non-parallel lines, there will be one intersection, a third (non-parallel) line can be drawn to cut the other two, and that makes 2 more intersections for a total of 3. You can actually draw this out, and with a fourth, fifth and sixth line, you will create a maximum of 3, 4 and 5 more intersections (respectively), and this will bring your total to fifteentotal intersections for the six lines. You can get each successive line to cut all of the other existing lines if you draw them in a prejudicial (maximized) way.
no
The definition of maximum in regards of math is the biggest number in the set of numbers / data.Example:If you have the numbers 10,5,8,2,60,9,3,and 1 the maximum in this set of numbers/data is 60. How? It is 60 because in the set of numbers/data it is the highest number in the set.The word maximum in maths means the most or limit.
In Statistics the Five Number Summary is the sample's minimum, lower quartile, median, upper quartile and maximum.
Some people consider Royal Flushes to be the same as a Straight Flush, but that is wrong. The number of actual Straight Flushes in a 52 Card Deck is........ 36
The number of marbles that can fit into an empty bag would depend on the size of the marbles and the size of the bag. To calculate the maximum number of marbles that can fit, you would need to determine the volume of the bag and the volume of each marble. By dividing the volume of the bag by the volume of a single marble, you can find the maximum number of marbles that can fit into the bag.
4
Since there is no requirement for the line to be straight, the answer is infinitely many. Otherwise, 4.
7
Six.
8
a circle * * * * * No. A circle is not a polygon because a polygon MUST have straight sides. There is, however, no maximum number - just like infinity being the biggest number.
11
there are 5
no
The maximum number of "straight time" work hours in a calendar year.
Maximum 12 intersections are there! You can simply use the formula: No. of intersections = n(n-1)/2 [where 'n' is the number of lines] This is derived as each new line can intersect (at most) all the previously drawn lines. There if there is: 1 line => 0 intersections 2 lines => 1 intersection 3 lines => 3 intersections [1 that was there + 2 by the new line can intersect both the previous lines.] 4 lines => 6 intersections [3 that were already there + 3 because the new line can intersect all the 3 lines that were present previously.]
7