There are 2013 random points on the plain, prove exactly 8 lies within a circle
$begingroup$
This was posed as a homework problem to me and I have made progress, but I don't think I have a solution.
So there are a lot of random points on the plane and we need to find a circle that contains exactly eight of them. The way I would attack this is to list the distances of each point pairs. Now take a pair (among perhaps several) that has a minimal distance.
I think that even if the minimal distances are equal, the most you can do with equal minimal distances without having a circle covering them is seven points (suspiciously one short of that eight!) by picking the centre of a circle and then six equidistant points on the circle (belonging to a 60 degree central degree).
geometry
$endgroup$
add a comment |
$begingroup$
This was posed as a homework problem to me and I have made progress, but I don't think I have a solution.
So there are a lot of random points on the plane and we need to find a circle that contains exactly eight of them. The way I would attack this is to list the distances of each point pairs. Now take a pair (among perhaps several) that has a minimal distance.
I think that even if the minimal distances are equal, the most you can do with equal minimal distances without having a circle covering them is seven points (suspiciously one short of that eight!) by picking the centre of a circle and then six equidistant points on the circle (belonging to a 60 degree central degree).
geometry
$endgroup$
add a comment |
$begingroup$
This was posed as a homework problem to me and I have made progress, but I don't think I have a solution.
So there are a lot of random points on the plane and we need to find a circle that contains exactly eight of them. The way I would attack this is to list the distances of each point pairs. Now take a pair (among perhaps several) that has a minimal distance.
I think that even if the minimal distances are equal, the most you can do with equal minimal distances without having a circle covering them is seven points (suspiciously one short of that eight!) by picking the centre of a circle and then six equidistant points on the circle (belonging to a 60 degree central degree).
geometry
$endgroup$
This was posed as a homework problem to me and I have made progress, but I don't think I have a solution.
So there are a lot of random points on the plane and we need to find a circle that contains exactly eight of them. The way I would attack this is to list the distances of each point pairs. Now take a pair (among perhaps several) that has a minimal distance.
I think that even if the minimal distances are equal, the most you can do with equal minimal distances without having a circle covering them is seven points (suspiciously one short of that eight!) by picking the centre of a circle and then six equidistant points on the circle (belonging to a 60 degree central degree).
geometry
geometry
asked Oct 11 '13 at 3:25
chxchx
823720
823720
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You can find such a circle with almost any center in the plane you want. Imagine picking some point and slowly expanding the radius of a circle until you have eight points inside the circle. The only time you fail is when there are at least two points equidistant from the center you pick, and as you expand the circle they take you from less than eight points within the circle to nine or more. Each pair of points has a line of points they are equidistant from. There are a little more than 2 million pairs of points. Pick any point not on any of these two million lines as a center and as the radius expands you will cross the points one at a time. As the lines have zero area, there are still plenty of centers to choose from. When you have crossed eight and not nine, you have your circle.
$endgroup$
add a comment |
$begingroup$
Pick an extremal line passing through two points $A$ and $B$ in this set.
We can do this by picking the two points with the least y coordinates say.
Now consider the angles formed by joining $A$ and $B$ to any point in the set.
Each of these points will form a different angle.
Sort these angles.
Let the 9th largest angle have vertex $P_9$.
Now the 8 angles greater than this angle must necessarily lie within the circumcircle of $ABP_9$.
Now, we pick the circle with its center the same as the circumcentre of $ABP_9$ but with a radius that is just infinitesimally smaller than that of $ABP_9$.
We have constructed a circle that contains exactly 8 points.
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f522178%2fthere-are-2013-random-points-on-the-plain-prove-exactly-8-lies-within-a-circle%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can find such a circle with almost any center in the plane you want. Imagine picking some point and slowly expanding the radius of a circle until you have eight points inside the circle. The only time you fail is when there are at least two points equidistant from the center you pick, and as you expand the circle they take you from less than eight points within the circle to nine or more. Each pair of points has a line of points they are equidistant from. There are a little more than 2 million pairs of points. Pick any point not on any of these two million lines as a center and as the radius expands you will cross the points one at a time. As the lines have zero area, there are still plenty of centers to choose from. When you have crossed eight and not nine, you have your circle.
$endgroup$
add a comment |
$begingroup$
You can find such a circle with almost any center in the plane you want. Imagine picking some point and slowly expanding the radius of a circle until you have eight points inside the circle. The only time you fail is when there are at least two points equidistant from the center you pick, and as you expand the circle they take you from less than eight points within the circle to nine or more. Each pair of points has a line of points they are equidistant from. There are a little more than 2 million pairs of points. Pick any point not on any of these two million lines as a center and as the radius expands you will cross the points one at a time. As the lines have zero area, there are still plenty of centers to choose from. When you have crossed eight and not nine, you have your circle.
$endgroup$
add a comment |
$begingroup$
You can find such a circle with almost any center in the plane you want. Imagine picking some point and slowly expanding the radius of a circle until you have eight points inside the circle. The only time you fail is when there are at least two points equidistant from the center you pick, and as you expand the circle they take you from less than eight points within the circle to nine or more. Each pair of points has a line of points they are equidistant from. There are a little more than 2 million pairs of points. Pick any point not on any of these two million lines as a center and as the radius expands you will cross the points one at a time. As the lines have zero area, there are still plenty of centers to choose from. When you have crossed eight and not nine, you have your circle.
$endgroup$
You can find such a circle with almost any center in the plane you want. Imagine picking some point and slowly expanding the radius of a circle until you have eight points inside the circle. The only time you fail is when there are at least two points equidistant from the center you pick, and as you expand the circle they take you from less than eight points within the circle to nine or more. Each pair of points has a line of points they are equidistant from. There are a little more than 2 million pairs of points. Pick any point not on any of these two million lines as a center and as the radius expands you will cross the points one at a time. As the lines have zero area, there are still plenty of centers to choose from. When you have crossed eight and not nine, you have your circle.
edited Oct 11 '13 at 3:53
answered Oct 11 '13 at 3:37
Ross MillikanRoss Millikan
295k23198371
295k23198371
add a comment |
add a comment |
$begingroup$
Pick an extremal line passing through two points $A$ and $B$ in this set.
We can do this by picking the two points with the least y coordinates say.
Now consider the angles formed by joining $A$ and $B$ to any point in the set.
Each of these points will form a different angle.
Sort these angles.
Let the 9th largest angle have vertex $P_9$.
Now the 8 angles greater than this angle must necessarily lie within the circumcircle of $ABP_9$.
Now, we pick the circle with its center the same as the circumcentre of $ABP_9$ but with a radius that is just infinitesimally smaller than that of $ABP_9$.
We have constructed a circle that contains exactly 8 points.
$endgroup$
add a comment |
$begingroup$
Pick an extremal line passing through two points $A$ and $B$ in this set.
We can do this by picking the two points with the least y coordinates say.
Now consider the angles formed by joining $A$ and $B$ to any point in the set.
Each of these points will form a different angle.
Sort these angles.
Let the 9th largest angle have vertex $P_9$.
Now the 8 angles greater than this angle must necessarily lie within the circumcircle of $ABP_9$.
Now, we pick the circle with its center the same as the circumcentre of $ABP_9$ but with a radius that is just infinitesimally smaller than that of $ABP_9$.
We have constructed a circle that contains exactly 8 points.
$endgroup$
add a comment |
$begingroup$
Pick an extremal line passing through two points $A$ and $B$ in this set.
We can do this by picking the two points with the least y coordinates say.
Now consider the angles formed by joining $A$ and $B$ to any point in the set.
Each of these points will form a different angle.
Sort these angles.
Let the 9th largest angle have vertex $P_9$.
Now the 8 angles greater than this angle must necessarily lie within the circumcircle of $ABP_9$.
Now, we pick the circle with its center the same as the circumcentre of $ABP_9$ but with a radius that is just infinitesimally smaller than that of $ABP_9$.
We have constructed a circle that contains exactly 8 points.
$endgroup$
Pick an extremal line passing through two points $A$ and $B$ in this set.
We can do this by picking the two points with the least y coordinates say.
Now consider the angles formed by joining $A$ and $B$ to any point in the set.
Each of these points will form a different angle.
Sort these angles.
Let the 9th largest angle have vertex $P_9$.
Now the 8 angles greater than this angle must necessarily lie within the circumcircle of $ABP_9$.
Now, we pick the circle with its center the same as the circumcentre of $ABP_9$ but with a radius that is just infinitesimally smaller than that of $ABP_9$.
We have constructed a circle that contains exactly 8 points.
answered Jan 5 at 20:33
ArchimedesprincipleArchimedesprinciple
34417
34417
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f522178%2fthere-are-2013-random-points-on-the-plain-prove-exactly-8-lies-within-a-circle%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown