How to determinate the convergence the start and the finish points?
up vote
1
down vote
favorite
I have found the Gridpatterns page.
One can apply the next algoritm and obtaine the grid pattern "1-2-3".
- On square grid paper start in the middle.
- Draw a line 1-unit long.
- Turn a right angle clockwise.
- Draw a line 2-unit long.
- Turn a right angle clockwise.
- Draw a line 3-unit long.
- Repeat steps 1-6 four times.
Result is below on the left figure. As you can see we returned to the start point (red).
Edit. After the lesnik's answer. Your positions after step 6 will be four points forming a square (right figure).
Question. Is there a rule by which it can be determined that the pattern "a-b-c" will return (convergence) to the starting point? Here a, b, c are integer.
geometry algorithms vectors invariant-theory
add a comment |
up vote
1
down vote
favorite
I have found the Gridpatterns page.
One can apply the next algoritm and obtaine the grid pattern "1-2-3".
- On square grid paper start in the middle.
- Draw a line 1-unit long.
- Turn a right angle clockwise.
- Draw a line 2-unit long.
- Turn a right angle clockwise.
- Draw a line 3-unit long.
- Repeat steps 1-6 four times.
Result is below on the left figure. As you can see we returned to the start point (red).
Edit. After the lesnik's answer. Your positions after step 6 will be four points forming a square (right figure).
Question. Is there a rule by which it can be determined that the pattern "a-b-c" will return (convergence) to the starting point? Here a, b, c are integer.
geometry algorithms vectors invariant-theory
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I have found the Gridpatterns page.
One can apply the next algoritm and obtaine the grid pattern "1-2-3".
- On square grid paper start in the middle.
- Draw a line 1-unit long.
- Turn a right angle clockwise.
- Draw a line 2-unit long.
- Turn a right angle clockwise.
- Draw a line 3-unit long.
- Repeat steps 1-6 four times.
Result is below on the left figure. As you can see we returned to the start point (red).
Edit. After the lesnik's answer. Your positions after step 6 will be four points forming a square (right figure).
Question. Is there a rule by which it can be determined that the pattern "a-b-c" will return (convergence) to the starting point? Here a, b, c are integer.
geometry algorithms vectors invariant-theory
I have found the Gridpatterns page.
One can apply the next algoritm and obtaine the grid pattern "1-2-3".
- On square grid paper start in the middle.
- Draw a line 1-unit long.
- Turn a right angle clockwise.
- Draw a line 2-unit long.
- Turn a right angle clockwise.
- Draw a line 3-unit long.
- Repeat steps 1-6 four times.
Result is below on the left figure. As you can see we returned to the start point (red).
Edit. After the lesnik's answer. Your positions after step 6 will be four points forming a square (right figure).
Question. Is there a rule by which it can be determined that the pattern "a-b-c" will return (convergence) to the starting point? Here a, b, c are integer.
geometry algorithms vectors invariant-theory
geometry algorithms vectors invariant-theory
edited Nov 14 at 7:04
asked Nov 14 at 6:00
Nick
296112
296112
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
Looks like for any $a$, $b$ and $c$ following your algorithm you will return to the starting point.
After steps 1-6 you shift from original position by some vector $vec{x_1}$ and turn by 90 degrees. Now you repeat steps 1-6, and shift from your current position by some vector $vec{x_2}$. Which is exactly like $vec{x_1}$, but turned by 90 degrees. And so on. Sum of vectors $vec{x_1}$, $vec{x_2}$, $vec{x_3}$ and $vec{x_4}$ is zero because all of them have the same length, and each one is turned by 90 degrees.
Your positions after step 6 will be four points forming a square.
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Looks like for any $a$, $b$ and $c$ following your algorithm you will return to the starting point.
After steps 1-6 you shift from original position by some vector $vec{x_1}$ and turn by 90 degrees. Now you repeat steps 1-6, and shift from your current position by some vector $vec{x_2}$. Which is exactly like $vec{x_1}$, but turned by 90 degrees. And so on. Sum of vectors $vec{x_1}$, $vec{x_2}$, $vec{x_3}$ and $vec{x_4}$ is zero because all of them have the same length, and each one is turned by 90 degrees.
Your positions after step 6 will be four points forming a square.
add a comment |
up vote
1
down vote
accepted
Looks like for any $a$, $b$ and $c$ following your algorithm you will return to the starting point.
After steps 1-6 you shift from original position by some vector $vec{x_1}$ and turn by 90 degrees. Now you repeat steps 1-6, and shift from your current position by some vector $vec{x_2}$. Which is exactly like $vec{x_1}$, but turned by 90 degrees. And so on. Sum of vectors $vec{x_1}$, $vec{x_2}$, $vec{x_3}$ and $vec{x_4}$ is zero because all of them have the same length, and each one is turned by 90 degrees.
Your positions after step 6 will be four points forming a square.
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Looks like for any $a$, $b$ and $c$ following your algorithm you will return to the starting point.
After steps 1-6 you shift from original position by some vector $vec{x_1}$ and turn by 90 degrees. Now you repeat steps 1-6, and shift from your current position by some vector $vec{x_2}$. Which is exactly like $vec{x_1}$, but turned by 90 degrees. And so on. Sum of vectors $vec{x_1}$, $vec{x_2}$, $vec{x_3}$ and $vec{x_4}$ is zero because all of them have the same length, and each one is turned by 90 degrees.
Your positions after step 6 will be four points forming a square.
Looks like for any $a$, $b$ and $c$ following your algorithm you will return to the starting point.
After steps 1-6 you shift from original position by some vector $vec{x_1}$ and turn by 90 degrees. Now you repeat steps 1-6, and shift from your current position by some vector $vec{x_2}$. Which is exactly like $vec{x_1}$, but turned by 90 degrees. And so on. Sum of vectors $vec{x_1}$, $vec{x_2}$, $vec{x_3}$ and $vec{x_4}$ is zero because all of them have the same length, and each one is turned by 90 degrees.
Your positions after step 6 will be four points forming a square.
answered Nov 14 at 6:49
lesnik
1,400611
1,400611
add a comment |
add a comment |
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%2f2997857%2fhow-to-determinate-the-convergence-the-start-and-the-finish-points%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