We have two Kangaroos. First one starts from point S1 and jumps for distance D1 in one jump. Second one starts from point S2 and jumps for distance D2 in one jump. Both will jump along the number line, S1 and S2 both are positive numbers on the number line.


closed as off-topic by elias, Oray, Jaap Scherphuis, w l, Bass Sep 24 '18 at 7:34

This question appears to be off-topic. The users who voted to close gave these specific reasons:

  • "This question is off-topic as it appears to be a mathematics problem, as opposed to a mathematical puzzle. For more info, see "Are math-textbook-style problems on topic?" on meta." – Jaap Scherphuis, w l, Bass
  • "This looks like a puzzle you found elsewhere. For content you did not create yourself, proper attribution is required. If you have permission to repost this, please edit to include (at minimum) where it came from, then vote to reopen. Posts which use someone else's content without attribution are generally deleted." – elias, Oray
If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ What do you want? We can't really tell if the kangaroos meet unless you give us S1, etc. and the directions they hop in. Do you want a criteria for determining if they meet or something? $\endgroup$ – greenturtle3141 Sep 24 '18 at 5:19
  • 1
    $\begingroup$ where is the question? $\endgroup$ – Oray Sep 24 '18 at 5:20
  • 1
    $\begingroup$ Is this an original problem of yours? If not, could you please post a reference? $\endgroup$ – elias Sep 24 '18 at 5:20
  • $\begingroup$ greenturtle3141 & Oray, I think the problem with this question is not that it is unclear or underdetermined. It is easy to come up with exact criteria to answer the question in the title. In my opinion this is a standard problem, which is not original and hardly qualifies as a puzzle. $\endgroup$ – elias Sep 24 '18 at 5:24
  • $\begingroup$ A simple websearch gives lot of copies of this problem, e.g.: codechef.com/problems/JMPKANG $\endgroup$ – elias Sep 24 '18 at 5:27

The question is basically asking for when 2 Arithmetic Progressions intersect, for which a detail solution can be found in this answer

  • $\begingroup$ I wanted to post that as a comment, I dunno why it got posted as an answer. Oh well... $\endgroup$ – nikki Sep 24 '18 at 5:37
  • $\begingroup$ That answers the much more difficult question of finding places that both kangaroos visit, not necessarily at the same time. Finding out whether they ever land in the same spot at the same time is almost trivial, yet that seems to be what this question is asking for (given that it is this codechef problem that elias found). Solving that is just finding the intersection of two lines, and checking whether it happens after a whole number of jumps. $\endgroup$ – Jaap Scherphuis Sep 24 '18 at 6:35

Not the answer you're looking for? Browse other questions tagged or ask your own question.