All the dots in the array are 2 units apart vertically and horizontally. What is the length of the longest segment that can be drawn joining any two points in the array without passing through any other point?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
How can we generalize this result?
By taking few graphs, I noticed the longest segments are the ones joining the extreme points, for instance, in my problem, the ones that lie in the first and last row. Also, I have noticed that to calculate the value of the longest segment will be ( m − 1 ) 2 + ( n − 1 ) 2 for m = n . Otherwise, if m = n , the value of the longest segment is ( m − 1 ) 2 + ( n − 2 ) 2 . m : number of points in a row and n : number of points in a column.
Log in to reply
Are you sure? For m = n , I believe we could get m 2 + ( n − 1 ) 2 .
I took a 3 × 3 points and the longest segment between two points without touching another point was 2 2 + 1 2 . It was the point in the middle in the first row connected to either point of the last row.
Log in to reply
Ah yes, my bad. I forgot that with n points, the distance is only n − 1 . Yup, your conclusion was correct.
First, notice that the line must be the diagonal of a rectangle, as any horizontal or vertical line, or any diagonal of a square will pass through at least one other point. The logical conclusion then would be that the diagonal of the 3X4 rectangle is the answer, but 6 4 + 1 6 = 1 0 is not one of the answer choices, so the next largest rectangle (3X2) must be the answer. Thus, our answer is 3 6 + 1 6 = 5 2 .
No, actually Lukas is right. I don't know why at the beginning I thought the diagonal might hit a third point but when I graphed it again. The longest segment became clear to me.
Also, 6 4 + 1 6 = 1 0 0 , not 1 0 0 .
Pythagorean Theorem! a=6 (Left or Right Side) b=8 (Top or Bottom Side) and * c=longest line segment *, diagonally.
8^2+6^2=c^2.
64+36=c^2 SO c=sqrt(100)
Sorry abou tthe sloppiness, I'm new =D
Actually you can connect two opposite corner points without crossing any point in between!
This can be shown by following : The slope of a line equals the change in height divided by the change in length, better known as m = x 2 − x 1 y 2 − y 1
If we imagine the dots as points on a grid with coordinates from bottom-left ( 0 , 0 ) to upper-right ( 4 , 3 ) using a usual coordinate system and drawing a line through these corner points, then m = 4 − 0 3 − 0 = 4 3
All dots represent points with integers, therefore a point on this line has to have an x ,which is 1, 2 or 3 to let the point be on the line between 0 and 4, and a y = 1 + 4 3 x , which has to be an integer as well.
Only 0 and 4 would fullfill these requirements (or any other integer multiple of 4) and so no dot crosses the line !
You thought of a connection between ( 0 , 0 ) and ( 3 , 2 ) , which leads to 6 2 + 4 2 = 5 2
But the correct answer is 8 2 + 6 2 = 1 0 0 = 1 0
You are right, I just solved it again today and discovered that 10 is the correct answer. I am going to send a report to adjust the answer because I am unable to edit the answer.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Distance between Two Points