project euler #577 confusion
$begingroup$
Problem Link.
An equilateral triangle with integer side length $n≥3$ is divided into $n^2$ equilateral triangles with side length 1 as shown in the diagram in the above link.
The vertices of these triangles constitute a triangular lattice with $frac{(n+1)(n+2)}{2}$ lattice points.
Let $H(n)$ be the number of all regular hexagons that can be found by connecting 6 of these points.
$H(3)=1,H(6)=12...H(20)=966$
I can't understand why $H(6)=12$. I can only count $11$ regular hexagons.
What I do is, whenever $n=3m$, it is the first triangle with a regular hexagon of size $m$. And on each successive $n$, the number by which hexagons of size $x$ increase, increments.
This also follows that for $n=6=3.2$, it will have only $1$ regular hexagon of size $2$, and number of hexagons of size $1=10$.
$therefore H(6) =11 ne 12$. Where am I wrong?
geometry project-euler
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
$endgroup$
add a comment |
$begingroup$
Problem Link.
An equilateral triangle with integer side length $n≥3$ is divided into $n^2$ equilateral triangles with side length 1 as shown in the diagram in the above link.
The vertices of these triangles constitute a triangular lattice with $frac{(n+1)(n+2)}{2}$ lattice points.
Let $H(n)$ be the number of all regular hexagons that can be found by connecting 6 of these points.
$H(3)=1,H(6)=12...H(20)=966$
I can't understand why $H(6)=12$. I can only count $11$ regular hexagons.
What I do is, whenever $n=3m$, it is the first triangle with a regular hexagon of size $m$. And on each successive $n$, the number by which hexagons of size $x$ increase, increments.
This also follows that for $n=6=3.2$, it will have only $1$ regular hexagon of size $2$, and number of hexagons of size $1=10$.
$therefore H(6) =11 ne 12$. Where am I wrong?
geometry project-euler
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
$endgroup$
add a comment |
$begingroup$
Problem Link.
An equilateral triangle with integer side length $n≥3$ is divided into $n^2$ equilateral triangles with side length 1 as shown in the diagram in the above link.
The vertices of these triangles constitute a triangular lattice with $frac{(n+1)(n+2)}{2}$ lattice points.
Let $H(n)$ be the number of all regular hexagons that can be found by connecting 6 of these points.
$H(3)=1,H(6)=12...H(20)=966$
I can't understand why $H(6)=12$. I can only count $11$ regular hexagons.
What I do is, whenever $n=3m$, it is the first triangle with a regular hexagon of size $m$. And on each successive $n$, the number by which hexagons of size $x$ increase, increments.
This also follows that for $n=6=3.2$, it will have only $1$ regular hexagon of size $2$, and number of hexagons of size $1=10$.
$therefore H(6) =11 ne 12$. Where am I wrong?
geometry project-euler
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
$endgroup$
Problem Link.
An equilateral triangle with integer side length $n≥3$ is divided into $n^2$ equilateral triangles with side length 1 as shown in the diagram in the above link.
The vertices of these triangles constitute a triangular lattice with $frac{(n+1)(n+2)}{2}$ lattice points.
Let $H(n)$ be the number of all regular hexagons that can be found by connecting 6 of these points.
$H(3)=1,H(6)=12...H(20)=966$
I can't understand why $H(6)=12$. I can only count $11$ regular hexagons.
What I do is, whenever $n=3m$, it is the first triangle with a regular hexagon of size $m$. And on each successive $n$, the number by which hexagons of size $x$ increase, increments.
This also follows that for $n=6=3.2$, it will have only $1$ regular hexagon of size $2$, and number of hexagons of size $1=10$.
$therefore H(6) =11 ne 12$. Where am I wrong?
geometry project-euler
geometry project-euler
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
asked Apr 2 '17 at 13:49
maverickmaverick
1,099415
1,099415
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
You get one hexagon of side length $sqrt3$ by joining the midpoint of the big triangle's base to the upper vertex of the second and fifth triangles on that base. Then go straight up to the midpoints of the sides of the big triangle. Then complete the hexagon. Remember, you're allowed to join any six points of the lattice that produce a regular hexagon. Does that help?
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
$endgroup$
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
add a comment |
$begingroup$
Observe that 6 is the smallest side length which can contain hexagon of side length 2, similar to side length 3 which will contain hexagon of side 1.
In this hexagon for side length 2, connect all the midpoints of sides of the hexagon, this will form another regular hexagon.
Considering hexagon of side length $x$, you can choose $x-1$ points from all the sides to form $x-1$ extra regular hexagons in addition to 1 which we already have. This hint is enough for the problem.
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
$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%2f2214496%2fproject-euler-577-confusion%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 get one hexagon of side length $sqrt3$ by joining the midpoint of the big triangle's base to the upper vertex of the second and fifth triangles on that base. Then go straight up to the midpoints of the sides of the big triangle. Then complete the hexagon. Remember, you're allowed to join any six points of the lattice that produce a regular hexagon. Does that help?
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
$endgroup$
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
add a comment |
$begingroup$
You get one hexagon of side length $sqrt3$ by joining the midpoint of the big triangle's base to the upper vertex of the second and fifth triangles on that base. Then go straight up to the midpoints of the sides of the big triangle. Then complete the hexagon. Remember, you're allowed to join any six points of the lattice that produce a regular hexagon. Does that help?
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
$endgroup$
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
add a comment |
$begingroup$
You get one hexagon of side length $sqrt3$ by joining the midpoint of the big triangle's base to the upper vertex of the second and fifth triangles on that base. Then go straight up to the midpoints of the sides of the big triangle. Then complete the hexagon. Remember, you're allowed to join any six points of the lattice that produce a regular hexagon. Does that help?
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
$endgroup$
You get one hexagon of side length $sqrt3$ by joining the midpoint of the big triangle's base to the upper vertex of the second and fifth triangles on that base. Then go straight up to the midpoints of the sides of the big triangle. Then complete the hexagon. Remember, you're allowed to join any six points of the lattice that produce a regular hexagon. Does that help?
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
answered Apr 2 '17 at 15:48
Edward PorcellaEdward Porcella
1,4311511
1,4311511
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
add a comment |
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
:| I am also working on it. And I thought a hexagon of even length will give rise to other such hexagon like you described. Still my answer is incorrect.
$endgroup$
– maverick
Apr 2 '17 at 15:52
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
@maverick--After verifying that H(n) = 966 for n = 20, and working out H(n) for n = 4 to 19, I've derived three general expressions for H(n). They're identical in their first three terms, but differ in the remaining term(s) depending on whether n = 0, 1, or 2 (mod 3). I'm not sure how I'd go about doing the summation for n = 3 to 12345 when each expression is valid only for one in three values of n. Are you still working on it? Is the answer published yet? Good problem.
$endgroup$
– Edward Porcella
Apr 6 '17 at 23:38
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
No i haven't solved this yet. Can you elaborate on your approach?
$endgroup$
– maverick
Apr 7 '17 at 7:52
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
$begingroup$
@maverick--Besides integer sides > 1, and the diagonal of the rhombus noted above, diagonals of other parallelograms become sides of possible hexagons. E.g. the diagonal of a pl-gram with sides 2,1 is the side of a possible hexagon beginning with n= 9. (Putting a hexagon into each corner of the big triangle, it's easy to count how many fit by noting the size of the triangle formed by their centers. Note that if the diagonal is not of a rhombus, two hexagons fit around each center.) The totals for n = 3-20 are enough to infer the three expressions I mentioned. Does this make sense so far?
$endgroup$
– Edward Porcella
Apr 7 '17 at 16:14
add a comment |
$begingroup$
Observe that 6 is the smallest side length which can contain hexagon of side length 2, similar to side length 3 which will contain hexagon of side 1.
In this hexagon for side length 2, connect all the midpoints of sides of the hexagon, this will form another regular hexagon.
Considering hexagon of side length $x$, you can choose $x-1$ points from all the sides to form $x-1$ extra regular hexagons in addition to 1 which we already have. This hint is enough for the problem.
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
$endgroup$
add a comment |
$begingroup$
Observe that 6 is the smallest side length which can contain hexagon of side length 2, similar to side length 3 which will contain hexagon of side 1.
In this hexagon for side length 2, connect all the midpoints of sides of the hexagon, this will form another regular hexagon.
Considering hexagon of side length $x$, you can choose $x-1$ points from all the sides to form $x-1$ extra regular hexagons in addition to 1 which we already have. This hint is enough for the problem.
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
$endgroup$
add a comment |
$begingroup$
Observe that 6 is the smallest side length which can contain hexagon of side length 2, similar to side length 3 which will contain hexagon of side 1.
In this hexagon for side length 2, connect all the midpoints of sides of the hexagon, this will form another regular hexagon.
Considering hexagon of side length $x$, you can choose $x-1$ points from all the sides to form $x-1$ extra regular hexagons in addition to 1 which we already have. This hint is enough for the problem.
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
$endgroup$
Observe that 6 is the smallest side length which can contain hexagon of side length 2, similar to side length 3 which will contain hexagon of side 1.
In this hexagon for side length 2, connect all the midpoints of sides of the hexagon, this will form another regular hexagon.
Considering hexagon of side length $x$, you can choose $x-1$ points from all the sides to form $x-1$ extra regular hexagons in addition to 1 which we already have. This hint is enough for the problem.
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
answered Dec 20 '18 at 8:21
madhur4127madhur4127
112
112
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%2f2214496%2fproject-euler-577-confusion%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
