# Is there a game or analogy for searching for a number $R$ that is multiple of some number $A$ but not multiple of another $B$?

$$\DeclareMathOperator{\lcm}{lcm}$$There are many applications for finding the GCD or LCM of two numbers. I'm now interested in finding anything that could be used to illustrate the following mathematical relationship.

Let $$r = \lcm(r_1, r_2)$$. Find a divisor $$c$$ of $$r$$ such that $$r/c$$ is a multiple of $$r_1$$ but not a multiple of $$r_2$$ (or a multiple of $$r_2$$ but not a multiple of $$r_1$$). Notice there are cases in which no such $$c$$ can be found. For example, when $$r_1 = r_2 = \lcm(r_1, r_2)$$.

Is there any interesting motivation that [can] be put on this?

• This doesn't quite fit, but the question somehow reminds me of Conway's Sylver Coinage game.
• Not sure if this helps, but it's equivalent to asking for a set $C$ such that $C \subseteq B-A$. Such an $A$, $B$, and $C$ would satisfy $C \subseteq A \cup B$ (equivalent to $c \mid r$), $A \subseteq (A \cup B) - C$ (equivalent to $r_1 \mid r/c$), but $B \not\subseteq (A \cup B)-C$ (equivalent to $r_2 \nmid r/c$). Feb 6, 2020 at 19:00
• @Aeryk, how is "$c$ divides $r$" equivalent to "$C \subseteq A \cup B$"? Feb 7, 2020 at 14:52
• @user724963 That is not the only case in which no $c$ can be found (though I notice now that I had a typo: I meant $r_1|r_2$, not the reverse). Feb 11, 2020 at 9:39