We visualize the equation as a circle on the coordinate plane.
Graph: https://www.desmos.com/calculator/swjzoksjmi
The circle is centered at (12,12) and has a radius 3√22. Therefore, for the largest value of x, we find the maximum possible x-coordinate on the circle, i.e., the x-coordinate of the right-most point.
maxx=12+radius of circle=1+3√22
Further explanations are typed in the graph.
Note that 168|a and 88|a by the property of gcd.
Take a=lcm(168,88)=1848.
Then b=168 and c=88 satisfies the conditions. You can check that gcd(b, c) is minimum in this case because for any positive integers k,l, gcd(kb,lc)=gcd(k,l)gcd(b,c)gcd(kgcd(k,l),cgcd(b,c))gcd(bgcd(b,c),lgcd(k,l))≥gcd(b,c), and b = 168k for some positive integer k and c = 88l for some positive integer l.
mingcd(b,c)=gcd(168,88)=8.
For the proof of the gcd identity I used, see here: https://math.stackexchange.com/questions/1394801/prove-that-ab-cd-a-cb-d-left-fracaa-c-fracdb-d-right-left?noredirect=1&lq=1