A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that only...
$begingroup$
A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is a acute angled.
geometry
edited Jan 19 at 8:45
idriskameni
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
$endgroup$
add a comment |
$begingroup$
A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is a acute angled.
geometry
edited Jan 19 at 8:45
idriskameni
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
$endgroup$
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19
add a comment |
$begingroup$
A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is a acute angled.
geometry
edited Jan 19 at 8:45
idriskameni
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
$endgroup$
A regular $2017$-gon is partitioned into triangles by a set of non-intersecting diagonals. Prove that among those triangles only one is a acute angled.
geometry
geometry
edited Jan 19 at 8:45
idriskameni
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
edited Jan 19 at 8:45
idriskameni
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
edited Jan 19 at 8:45
idriskameni
644319
edited Jan 19 at 8:45
idriskameni
644319
edited Jan 19 at 8:45
idriskameni
644319
644319
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
asked Jan 19 at 5:15
Anson ChanAnson Chan
162
162
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19
add a comment |
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Since $2017$ is odd there is no diagonal going through the centre of the circle. Therefore there is exactly one triangle containing $M$ in its interior. This triangle is acute, all others are obtuse.
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
$endgroup$
add a comment |
$begingroup$
A triangle will have $k$ vertices to one side and $n-3-k$ to the other, for $0le kle n-3$. The inscribed angle theorem says that the angles of this triangle are
$$
left{fracpi{n},,,(k+1)fracpi{n},,,(n-2-k)fracpi{n}right}
$$
This means that every such triangulation of a regular $n$-gon will have an identical set if triangles, just oriented and positioned differently. Each triangle is labeled with its $k$ value:
If $n$ is odd, only when $k=frac{n-3}2$ will the triangle be acute, with angles
$$
left{fracpi{n},,,frac{n-1}2fracpi{n},,,frac{n-1}2fracpi{n}right}
$$
If $n$ is even, when $k=frac{n-2}2$ or $k=frac{n-4}2$, the triangle will be right, with angles
$$
left{fracpi{n},,,frac{n-2}2fracpi{n},,,fracpi2right}
$$
and there will be no acute triangles.
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
$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%2f3079044%2fa-regular-2017-gon-is-partitioned-into-triangles-by-a-set-of-non-intersecting%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$
Since $2017$ is odd there is no diagonal going through the centre of the circle. Therefore there is exactly one triangle containing $M$ in its interior. This triangle is acute, all others are obtuse.
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
$endgroup$
add a comment |
$begingroup$
Since $2017$ is odd there is no diagonal going through the centre of the circle. Therefore there is exactly one triangle containing $M$ in its interior. This triangle is acute, all others are obtuse.
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
$endgroup$
add a comment |
$begingroup$
Since $2017$ is odd there is no diagonal going through the centre of the circle. Therefore there is exactly one triangle containing $M$ in its interior. This triangle is acute, all others are obtuse.
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
$endgroup$
Since $2017$ is odd there is no diagonal going through the centre of the circle. Therefore there is exactly one triangle containing $M$ in its interior. This triangle is acute, all others are obtuse.
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
answered Jan 19 at 9:18
Christian BlatterChristian Blatter
173k8113326
173k8113326
add a comment |
add a comment |
$begingroup$
A triangle will have $k$ vertices to one side and $n-3-k$ to the other, for $0le kle n-3$. The inscribed angle theorem says that the angles of this triangle are
$$
left{fracpi{n},,,(k+1)fracpi{n},,,(n-2-k)fracpi{n}right}
$$
This means that every such triangulation of a regular $n$-gon will have an identical set if triangles, just oriented and positioned differently. Each triangle is labeled with its $k$ value:
If $n$ is odd, only when $k=frac{n-3}2$ will the triangle be acute, with angles
$$
left{fracpi{n},,,frac{n-1}2fracpi{n},,,frac{n-1}2fracpi{n}right}
$$
If $n$ is even, when $k=frac{n-2}2$ or $k=frac{n-4}2$, the triangle will be right, with angles
$$
left{fracpi{n},,,frac{n-2}2fracpi{n},,,fracpi2right}
$$
and there will be no acute triangles.
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
$endgroup$
add a comment |
$begingroup$
A triangle will have $k$ vertices to one side and $n-3-k$ to the other, for $0le kle n-3$. The inscribed angle theorem says that the angles of this triangle are
$$
left{fracpi{n},,,(k+1)fracpi{n},,,(n-2-k)fracpi{n}right}
$$
This means that every such triangulation of a regular $n$-gon will have an identical set if triangles, just oriented and positioned differently. Each triangle is labeled with its $k$ value:
If $n$ is odd, only when $k=frac{n-3}2$ will the triangle be acute, with angles
$$
left{fracpi{n},,,frac{n-1}2fracpi{n},,,frac{n-1}2fracpi{n}right}
$$
If $n$ is even, when $k=frac{n-2}2$ or $k=frac{n-4}2$, the triangle will be right, with angles
$$
left{fracpi{n},,,frac{n-2}2fracpi{n},,,fracpi2right}
$$
and there will be no acute triangles.
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
$endgroup$
add a comment |
$begingroup$
A triangle will have $k$ vertices to one side and $n-3-k$ to the other, for $0le kle n-3$. The inscribed angle theorem says that the angles of this triangle are
$$
left{fracpi{n},,,(k+1)fracpi{n},,,(n-2-k)fracpi{n}right}
$$
This means that every such triangulation of a regular $n$-gon will have an identical set if triangles, just oriented and positioned differently. Each triangle is labeled with its $k$ value:
If $n$ is odd, only when $k=frac{n-3}2$ will the triangle be acute, with angles
$$
left{fracpi{n},,,frac{n-1}2fracpi{n},,,frac{n-1}2fracpi{n}right}
$$
If $n$ is even, when $k=frac{n-2}2$ or $k=frac{n-4}2$, the triangle will be right, with angles
$$
left{fracpi{n},,,frac{n-2}2fracpi{n},,,fracpi2right}
$$
and there will be no acute triangles.
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
$endgroup$
A triangle will have $k$ vertices to one side and $n-3-k$ to the other, for $0le kle n-3$. The inscribed angle theorem says that the angles of this triangle are
$$
left{fracpi{n},,,(k+1)fracpi{n},,,(n-2-k)fracpi{n}right}
$$
This means that every such triangulation of a regular $n$-gon will have an identical set if triangles, just oriented and positioned differently. Each triangle is labeled with its $k$ value:
If $n$ is odd, only when $k=frac{n-3}2$ will the triangle be acute, with angles
$$
left{fracpi{n},,,frac{n-1}2fracpi{n},,,frac{n-1}2fracpi{n}right}
$$
If $n$ is even, when $k=frac{n-2}2$ or $k=frac{n-4}2$, the triangle will be right, with angles
$$
left{fracpi{n},,,frac{n-2}2fracpi{n},,,fracpi2right}
$$
and there will be no acute triangles.
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
edited Jan 20 at 3:03
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
answered Jan 19 at 9:54
robjohn♦robjohn
268k27308633
268k27308633
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%2f3079044%2fa-regular-2017-gon-is-partitioned-into-triangles-by-a-set-of-non-intersecting%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
$begingroup$
Draw a picture and prove it with a pentagon first.
$endgroup$
– fleablood
Jan 19 at 6:19