How to know if people ever meet when they are walking two different routes at the same time which intersect.

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












So there are two people, person A and person B, walking their own route at the same time. These routes take an arbitrary amount of time to walk and they start at an arbitrary point along this route. So if we take an intersection point p, I would like to know if they ever meet on that point.



So I thought of the problem like this:



There is a certain intersection time in a round $I_A$ at which person A is at the intersection point. So if $r_A$ is the time it takes for A to finish one route then $I_A equiv t mod r_A$ (where $t$ is the time, with $t = 0$ being at the start of the hike).



For B this would be the same, so: $I_B equiv t mod r_B$. I have also rewritten this expression to $t = r_B cdot k + I_B = r_A cdot l + I_A$ where $k, l in mathbbN$



However, I couldn't really find any solutions. (Or the infinite set of solutions that should be there or not).







share|cite|improve this question
























    up vote
    0
    down vote

    favorite












    So there are two people, person A and person B, walking their own route at the same time. These routes take an arbitrary amount of time to walk and they start at an arbitrary point along this route. So if we take an intersection point p, I would like to know if they ever meet on that point.



    So I thought of the problem like this:



    There is a certain intersection time in a round $I_A$ at which person A is at the intersection point. So if $r_A$ is the time it takes for A to finish one route then $I_A equiv t mod r_A$ (where $t$ is the time, with $t = 0$ being at the start of the hike).



    For B this would be the same, so: $I_B equiv t mod r_B$. I have also rewritten this expression to $t = r_B cdot k + I_B = r_A cdot l + I_A$ where $k, l in mathbbN$



    However, I couldn't really find any solutions. (Or the infinite set of solutions that should be there or not).







    share|cite|improve this question






















      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      So there are two people, person A and person B, walking their own route at the same time. These routes take an arbitrary amount of time to walk and they start at an arbitrary point along this route. So if we take an intersection point p, I would like to know if they ever meet on that point.



      So I thought of the problem like this:



      There is a certain intersection time in a round $I_A$ at which person A is at the intersection point. So if $r_A$ is the time it takes for A to finish one route then $I_A equiv t mod r_A$ (where $t$ is the time, with $t = 0$ being at the start of the hike).



      For B this would be the same, so: $I_B equiv t mod r_B$. I have also rewritten this expression to $t = r_B cdot k + I_B = r_A cdot l + I_A$ where $k, l in mathbbN$



      However, I couldn't really find any solutions. (Or the infinite set of solutions that should be there or not).







      share|cite|improve this question












      So there are two people, person A and person B, walking their own route at the same time. These routes take an arbitrary amount of time to walk and they start at an arbitrary point along this route. So if we take an intersection point p, I would like to know if they ever meet on that point.



      So I thought of the problem like this:



      There is a certain intersection time in a round $I_A$ at which person A is at the intersection point. So if $r_A$ is the time it takes for A to finish one route then $I_A equiv t mod r_A$ (where $t$ is the time, with $t = 0$ being at the start of the hike).



      For B this would be the same, so: $I_B equiv t mod r_B$. I have also rewritten this expression to $t = r_B cdot k + I_B = r_A cdot l + I_A$ where $k, l in mathbbN$



      However, I couldn't really find any solutions. (Or the infinite set of solutions that should be there or not).









      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Aug 26 at 22:23









      Yadeses

      1114




      1114




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          In general there does not need to be a solution. Assume that person A walks on the real line between 0 and 1 back and forth with speed 1 and person B walks between 1 and $1+pi$ back and forth with speed 1. Now depending on the starting point of person A and B they will meet either never or once. Assume that they meet a second time, then person B has walked a distance $2npi$ with some $nin mathbbNsetminus 0$ and person A has traveled a distance $min mathbbNsetminus0$. As both are moving with the same speed the two distances have to be equal, but this implies $pi=fracm2nin mathbbQ$, which is a contradiction. Hence, they can meet at most once. Meeting once is easy, just let them both start at the intersection point. If on the other hand person A starts at 0 and person B starts at $1+pi$ then they will never meet (by essentially the same argunent like before that they can meet at most once).



          Added: If you want to attack this problem in full generality, you will realise that it is not so easy. If $I_A=I_B$ then you are asking whether $r_A$ and $r_B$ are linearly independent over $mathbbQ$. It is for example not so easy to prove that $pi$ and $ln(2)$ are not linearly independent over $mathbbQ$ (check Are $pi$ and $ln(2)$ linearly independent over rational numbers?).






          share|cite|improve this answer






















          • Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
            – Yadeses
            Aug 29 at 2:10










          • Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
            – Severin Schraven
            Aug 29 at 7:30











          • @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
            – Severin Schraven
            Aug 30 at 22:04










          • And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
            – Yadeses
            Aug 30 at 23:24











          • Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
            – Yadeses
            Aug 30 at 23:30










          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: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













           

          draft saved


          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895590%2fhow-to-know-if-people-ever-meet-when-they-are-walking-two-different-routes-at-th%23new-answer', 'question_page');

          );

          Post as a guest






























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          1
          down vote



          accepted










          In general there does not need to be a solution. Assume that person A walks on the real line between 0 and 1 back and forth with speed 1 and person B walks between 1 and $1+pi$ back and forth with speed 1. Now depending on the starting point of person A and B they will meet either never or once. Assume that they meet a second time, then person B has walked a distance $2npi$ with some $nin mathbbNsetminus 0$ and person A has traveled a distance $min mathbbNsetminus0$. As both are moving with the same speed the two distances have to be equal, but this implies $pi=fracm2nin mathbbQ$, which is a contradiction. Hence, they can meet at most once. Meeting once is easy, just let them both start at the intersection point. If on the other hand person A starts at 0 and person B starts at $1+pi$ then they will never meet (by essentially the same argunent like before that they can meet at most once).



          Added: If you want to attack this problem in full generality, you will realise that it is not so easy. If $I_A=I_B$ then you are asking whether $r_A$ and $r_B$ are linearly independent over $mathbbQ$. It is for example not so easy to prove that $pi$ and $ln(2)$ are not linearly independent over $mathbbQ$ (check Are $pi$ and $ln(2)$ linearly independent over rational numbers?).






          share|cite|improve this answer






















          • Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
            – Yadeses
            Aug 29 at 2:10










          • Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
            – Severin Schraven
            Aug 29 at 7:30











          • @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
            – Severin Schraven
            Aug 30 at 22:04










          • And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
            – Yadeses
            Aug 30 at 23:24











          • Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
            – Yadeses
            Aug 30 at 23:30














          up vote
          1
          down vote



          accepted










          In general there does not need to be a solution. Assume that person A walks on the real line between 0 and 1 back and forth with speed 1 and person B walks between 1 and $1+pi$ back and forth with speed 1. Now depending on the starting point of person A and B they will meet either never or once. Assume that they meet a second time, then person B has walked a distance $2npi$ with some $nin mathbbNsetminus 0$ and person A has traveled a distance $min mathbbNsetminus0$. As both are moving with the same speed the two distances have to be equal, but this implies $pi=fracm2nin mathbbQ$, which is a contradiction. Hence, they can meet at most once. Meeting once is easy, just let them both start at the intersection point. If on the other hand person A starts at 0 and person B starts at $1+pi$ then they will never meet (by essentially the same argunent like before that they can meet at most once).



          Added: If you want to attack this problem in full generality, you will realise that it is not so easy. If $I_A=I_B$ then you are asking whether $r_A$ and $r_B$ are linearly independent over $mathbbQ$. It is for example not so easy to prove that $pi$ and $ln(2)$ are not linearly independent over $mathbbQ$ (check Are $pi$ and $ln(2)$ linearly independent over rational numbers?).






          share|cite|improve this answer






















          • Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
            – Yadeses
            Aug 29 at 2:10










          • Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
            – Severin Schraven
            Aug 29 at 7:30











          • @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
            – Severin Schraven
            Aug 30 at 22:04










          • And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
            – Yadeses
            Aug 30 at 23:24











          • Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
            – Yadeses
            Aug 30 at 23:30












          up vote
          1
          down vote



          accepted







          up vote
          1
          down vote



          accepted






          In general there does not need to be a solution. Assume that person A walks on the real line between 0 and 1 back and forth with speed 1 and person B walks between 1 and $1+pi$ back and forth with speed 1. Now depending on the starting point of person A and B they will meet either never or once. Assume that they meet a second time, then person B has walked a distance $2npi$ with some $nin mathbbNsetminus 0$ and person A has traveled a distance $min mathbbNsetminus0$. As both are moving with the same speed the two distances have to be equal, but this implies $pi=fracm2nin mathbbQ$, which is a contradiction. Hence, they can meet at most once. Meeting once is easy, just let them both start at the intersection point. If on the other hand person A starts at 0 and person B starts at $1+pi$ then they will never meet (by essentially the same argunent like before that they can meet at most once).



          Added: If you want to attack this problem in full generality, you will realise that it is not so easy. If $I_A=I_B$ then you are asking whether $r_A$ and $r_B$ are linearly independent over $mathbbQ$. It is for example not so easy to prove that $pi$ and $ln(2)$ are not linearly independent over $mathbbQ$ (check Are $pi$ and $ln(2)$ linearly independent over rational numbers?).






          share|cite|improve this answer














          In general there does not need to be a solution. Assume that person A walks on the real line between 0 and 1 back and forth with speed 1 and person B walks between 1 and $1+pi$ back and forth with speed 1. Now depending on the starting point of person A and B they will meet either never or once. Assume that they meet a second time, then person B has walked a distance $2npi$ with some $nin mathbbNsetminus 0$ and person A has traveled a distance $min mathbbNsetminus0$. As both are moving with the same speed the two distances have to be equal, but this implies $pi=fracm2nin mathbbQ$, which is a contradiction. Hence, they can meet at most once. Meeting once is easy, just let them both start at the intersection point. If on the other hand person A starts at 0 and person B starts at $1+pi$ then they will never meet (by essentially the same argunent like before that they can meet at most once).



          Added: If you want to attack this problem in full generality, you will realise that it is not so easy. If $I_A=I_B$ then you are asking whether $r_A$ and $r_B$ are linearly independent over $mathbbQ$. It is for example not so easy to prove that $pi$ and $ln(2)$ are not linearly independent over $mathbbQ$ (check Are $pi$ and $ln(2)$ linearly independent over rational numbers?).







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Aug 30 at 22:03

























          answered Aug 28 at 22:13









          Severin Schraven

          4,9211831




          4,9211831











          • Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
            – Yadeses
            Aug 29 at 2:10










          • Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
            – Severin Schraven
            Aug 29 at 7:30











          • @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
            – Severin Schraven
            Aug 30 at 22:04










          • And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
            – Yadeses
            Aug 30 at 23:24











          • Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
            – Yadeses
            Aug 30 at 23:30
















          • Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
            – Yadeses
            Aug 29 at 2:10










          • Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
            – Severin Schraven
            Aug 29 at 7:30











          • @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
            – Severin Schraven
            Aug 30 at 22:04










          • And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
            – Yadeses
            Aug 30 at 23:24











          • Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
            – Yadeses
            Aug 30 at 23:30















          Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
          – Yadeses
          Aug 29 at 2:10




          Hmm that is true indeed. Though that still would not answer the question of how to find a solution (if there is one given) some random input variables. Like finding the lowest t for which the equation holds true.
          – Yadeses
          Aug 29 at 2:10












          Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
          – Severin Schraven
          Aug 29 at 7:30





          Well, yes, that's a question you did not ask :) I just answered the question whether they will meet in the intersection point. I am not sure whether it is possible to give an algorithm for finding the smallest solution. If all the coefficients were rational, the problem would be easier as you could use methods from diophantine equations
          – Severin Schraven
          Aug 29 at 7:30













          @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
          – Severin Schraven
          Aug 30 at 22:04




          @Yadeses I added some argument why you should not expect to have an algorithm to solve your equation in the generality you proposed.
          – Severin Schraven
          Aug 30 at 22:04












          And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
          – Yadeses
          Aug 30 at 23:24





          And if we just think about integers? I have searched diophante equations and I get their idea, but how to find a solution I do not see. Could you maybe explain how that would work?
          – Yadeses
          Aug 30 at 23:24













          Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
          – Yadeses
          Aug 30 at 23:30




          Okay, google apparently had the answer as this form has already been solved. So basically write it as the from a*x + b * y = 1, and then use euclides algorithm, right?
          – Yadeses
          Aug 30 at 23:30

















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2895590%2fhow-to-know-if-people-ever-meet-when-they-are-walking-two-different-routes-at-th%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          Is there any way to eliminate the singular point to solve this integral by hand or by approximations?

          Why am i infinitely getting the same tweet with the Twitter Search API?

          Carbon dioxide