Equilateral triangle divided in equilateral triangles
up vote
-2
down vote
favorite
Let's consider an equilateral triangle which is divided in $100$ equilateral triangles. What is the maximum number of points which are vertices of these triangles such that each straight line that passes through any two of these points is parallel to any edge of the initial triangle? I'm trying to consider the coordinates of every point.
Any ideas? Thank you!
combinatorics
add a comment |
up vote
-2
down vote
favorite
Let's consider an equilateral triangle which is divided in $100$ equilateral triangles. What is the maximum number of points which are vertices of these triangles such that each straight line that passes through any two of these points is parallel to any edge of the initial triangle? I'm trying to consider the coordinates of every point.
Any ideas? Thank you!
combinatorics
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to thenon-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.
– achille hui
Nov 23 at 22:59
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50
add a comment |
up vote
-2
down vote
favorite
up vote
-2
down vote
favorite
Let's consider an equilateral triangle which is divided in $100$ equilateral triangles. What is the maximum number of points which are vertices of these triangles such that each straight line that passes through any two of these points is parallel to any edge of the initial triangle? I'm trying to consider the coordinates of every point.
Any ideas? Thank you!
combinatorics
Let's consider an equilateral triangle which is divided in $100$ equilateral triangles. What is the maximum number of points which are vertices of these triangles such that each straight line that passes through any two of these points is parallel to any edge of the initial triangle? I'm trying to consider the coordinates of every point.
Any ideas? Thank you!
combinatorics
combinatorics
edited Nov 24 at 3:45
Rócherz
2,7012721
2,7012721
asked Nov 23 at 19:48
rafa
555212
555212
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to thenon-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.
– achille hui
Nov 23 at 22:59
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50
add a comment |
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to thenon-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.
– achille hui
Nov 23 at 22:59
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to the
non-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.– achille hui
Nov 23 at 22:59
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to the
non-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.– achille hui
Nov 23 at 22:59
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50
add a comment |
active
oldest
votes
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',
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%2f3010760%2fequilateral-triangle-divided-in-equilateral-triangles%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3010760%2fequilateral-triangle-divided-in-equilateral-triangles%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
This is an interesting problem but your question has been stated in a way very difficult to understand. In any event, it equivalent to the
non-attacking queens on a triangle
problem for a triangle of side $n = 11$. Nivasch et al. has shown the maximum number is $leftlfloor frac{2n+1}{3}rightrfloor = leftlfloor frac{2(11)+1}{3}rightrfloor = 7$.– achille hui
Nov 23 at 22:59
Hmm... I didn't notice the original version of this question has a double negative about "no two points that is not parallel to...". So my previous comment didn't apply....
– achille hui
Nov 24 at 3:50