For some given positive integers A, B, and C, how can I find the lowest value of x such that:
where x,y also positive integers.
For example 10x+6=7y the lowest value of x is x=5 where y=8.
I thought I could use Euclidean algorithm, but I haven't figured out how I could apply it here. Is there a different general algorithm for solving this?
(Not homework, just related something I'm working on)