(A+xB)/C = y

An algorithm to find x, when A, B, C and y are integers.

YAML 来源 问题

Is there an already is such an algorithm out there, to generically and efficiently find a place where an integer summation series such as A+B+B+B+... becomes exactly divisible by some other integer C.


没有子分类。

投票 (可选) (别通知) (可选)
请,登录

我认为,Halfbakery 的 [notexactly] 有一点:

“除非我误解了问题陈述,否则这似乎是最小公倍数问题的一个微不足道的变体,可以通过几种算法 [链接] 来解决。(A xB)/C = y 在我看来等同于 y = LCM(A - C, B)。”

也许解决方案很简单,但我还没有验证这一点(稍后待定)。

I think, [notexactly] from Halfbakery has a point:

"Unless I'm misunderstanding the problem statement, this seems like a trivial variant of the least common multiple problem, which can be solved by several algorithms [link]. (A+xB)/C = y seems to me to be equivalent to y = LCM(A - C, B)."

Perhaps the solution is simple, but I had not yet verified this (TBD later).


语言