IMO 2016 Problem 3
$begingroup$
Let $P = A_1 A_2 cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
I tried using the formula for area of a polygon in cartesian plane, after assuming coordinates, but to no avail.
geometry elementary-number-theory contest-math analytic-geometry polygons
$endgroup$
add a comment |
$begingroup$
Let $P = A_1 A_2 cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
I tried using the formula for area of a polygon in cartesian plane, after assuming coordinates, but to no avail.
geometry elementary-number-theory contest-math analytic-geometry polygons
$endgroup$
$begingroup$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
3
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02
add a comment |
$begingroup$
Let $P = A_1 A_2 cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
I tried using the formula for area of a polygon in cartesian plane, after assuming coordinates, but to no avail.
geometry elementary-number-theory contest-math analytic-geometry polygons
$endgroup$
Let $P = A_1 A_2 cdots A_k$ be a convex polygon in the plane. The vertices $A_1, A_2, ldots, A_k$ have integral coordinates and lie on a circle. Let $S$ be the area of $P$. An odd positive integer $n$ is given such that the squares of the side lengths of $P$ are integers divisible by $n$. Prove that $2S$ is an integer divisible by $n$.
I tried using the formula for area of a polygon in cartesian plane, after assuming coordinates, but to no avail.
geometry elementary-number-theory contest-math analytic-geometry polygons
geometry elementary-number-theory contest-math analytic-geometry polygons
edited Jul 2 '18 at 7:45
rabota
14.3k32782
14.3k32782
asked Jul 11 '16 at 19:59
user313479
$begingroup$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
3
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02
add a comment |
$begingroup$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
3
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02
$begingroup$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
$begingroup$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
3
3
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Incomplete proof
Since $P$ is convex, we can uniquely truncate $P$ with right-angled triangles with hypotenuses equal to the side lengths of $P$ and the remaining rectilinears inside.
Let reducible triangle be a right-angled triangle with Pythagorean triple $(a,b,c)$ where both $a$,$b$ and $c$ are divisible by $n$.
If all triangles above truncating $P$ is reducible triangles, area of each triangle and rectilinear is divisible by $n^2$. Thus, $2S$ must be divisible by $n$.
Please figure out the case with $P$ truncated by some non-reducible triangles.
$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%2f1856323%2fimo-2016-problem-3%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Incomplete proof
Since $P$ is convex, we can uniquely truncate $P$ with right-angled triangles with hypotenuses equal to the side lengths of $P$ and the remaining rectilinears inside.
Let reducible triangle be a right-angled triangle with Pythagorean triple $(a,b,c)$ where both $a$,$b$ and $c$ are divisible by $n$.
If all triangles above truncating $P$ is reducible triangles, area of each triangle and rectilinear is divisible by $n^2$. Thus, $2S$ must be divisible by $n$.
Please figure out the case with $P$ truncated by some non-reducible triangles.
$endgroup$
add a comment |
$begingroup$
Incomplete proof
Since $P$ is convex, we can uniquely truncate $P$ with right-angled triangles with hypotenuses equal to the side lengths of $P$ and the remaining rectilinears inside.
Let reducible triangle be a right-angled triangle with Pythagorean triple $(a,b,c)$ where both $a$,$b$ and $c$ are divisible by $n$.
If all triangles above truncating $P$ is reducible triangles, area of each triangle and rectilinear is divisible by $n^2$. Thus, $2S$ must be divisible by $n$.
Please figure out the case with $P$ truncated by some non-reducible triangles.
$endgroup$
add a comment |
$begingroup$
Incomplete proof
Since $P$ is convex, we can uniquely truncate $P$ with right-angled triangles with hypotenuses equal to the side lengths of $P$ and the remaining rectilinears inside.
Let reducible triangle be a right-angled triangle with Pythagorean triple $(a,b,c)$ where both $a$,$b$ and $c$ are divisible by $n$.
If all triangles above truncating $P$ is reducible triangles, area of each triangle and rectilinear is divisible by $n^2$. Thus, $2S$ must be divisible by $n$.
Please figure out the case with $P$ truncated by some non-reducible triangles.
$endgroup$
Incomplete proof
Since $P$ is convex, we can uniquely truncate $P$ with right-angled triangles with hypotenuses equal to the side lengths of $P$ and the remaining rectilinears inside.
Let reducible triangle be a right-angled triangle with Pythagorean triple $(a,b,c)$ where both $a$,$b$ and $c$ are divisible by $n$.
If all triangles above truncating $P$ is reducible triangles, area of each triangle and rectilinear is divisible by $n^2$. Thus, $2S$ must be divisible by $n$.
Please figure out the case with $P$ truncated by some non-reducible triangles.
edited Jan 25 '17 at 18:55
nosyarg
352215
352215
answered Jul 19 '16 at 2:33
Jacky NgaiJacky Ngai
1
1
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%2f1856323%2fimo-2016-problem-3%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$
the solutions I have seen do it for $n=p^a$ with $p$ an odd prime and induction over $k$.
$endgroup$
– Jorge Fernández Hidalgo
Jul 11 '16 at 20:15
3
$begingroup$
Duplicate of math.stackexchange.com/questions/1855759/…
$endgroup$
– Arthur
Jul 11 '16 at 20:18
$begingroup$
link
$endgroup$
– Ricardo Largaespada
Nov 8 '16 at 5:02