The horizontal lines are AK, BJ, CI, DH and EG i.e. 5 in number. The vertical lines are AE, LF and KG i.e. 3 in number. The slanting lines are LC, CF, FI, LI, EK and AG i.e. 6 in number. Thus, there are 5 + 3 + 6 = 14 straight lines in the figure.
How many lines you need to make without lifting an arm to connect all the dots?
Imagine the pattern of dots below drawn on a sheet of paper. Your task is to join all nine dots using only four (or less) straight lines, without lifting your pencil from the paper and without retracing the lines.
Can you join 9 dots with four straight lines without taking your pencil off the paper you can not go over any line?
To solve the problem, you need to join all nine dots by drawing no more than four straight lines. The straight lines must be continuous – i.e. you must not lift your pen from the paper once you start drawing.
What is the minimum number of Colours required to fill the spaces?
Also the space X, V and W must be shaded with the color of the spaces S, T and U respectively i.e with the colors of the spaces R, P and Q respectively. Thus, minimum three colors are required.
What is the number of straight lines?
A straight line will be formed by any two of these ten points. Thus forming a straight line amounts to selecting any two of the 10 points. Two points can be selected out of the 10 points in nC2 ways. Since straight lines formed by these 4 points are sane, straight lines formed by them will reduce to only one.
What’s the minimum number of lines to connect all the dots?
A line of sufficient thickness can connect all the dots (by covering them) – March Ho Jan 13 ’15 at 7:28 Consider an arbitrary solution: it will use H horizontal lines, V vertical lines, and S skew lines (that are neither vertical nor horizontal). If H = 7, then we need at least 6 lines to connect these horizontal lines to each other.
What is the minimum number of straight lines to connect all?
If H = 6, there exist 7 points (on another horizontal line) that are NOT covered by the horizontal lines in the solution. Each of these 7 points must be covered by a separate line; this yields V + S ≥ 7 and H + V + S ≥ 13. If V = 6, we argue symmetrically to case 3. It remains to consider the case with H ≤ 5 and V ≤ 5.
How to calculate minimum number of lines to cover all points?
Given N points in 2-dimensional space, we need to print the count of the minimum number of lines which traverse through all these N points and which go through a specific (xO, yO) point also. If given points are (-1, 3), (4, 3), (2, 1), (-1, -2), (3, -3) and (xO, yO) point is (1, 0) i.e. every line must go through this point.
Can you draw 3 straight lines with 9 circles?
Draw 3 straight lines without removing pen from paper such that each of the 9 circles is in contact with at least one line. A similar problem is present here Connect 9 dots using 4 lines. The difference from above problem is that here there are 9 circles not 9 points. Also we can only draw 3 lines.
