[MATH] Method to reduce both sides of an equation?

[TheouAegis]

My work around was to say "screw it to scaling!"

But I'll show you what I was hoping to find some way of doing.

So, basic equation
X=3b/2 - d/3 (just using the same variables without a and c this time)

B Set={24,26,29,32,33,38,42,56,78} (making numbers up but they're close to that)
D Set={13,24,27,39,52,68,70,88,96}

So, let's pick a value from each set. I know my max value will have an ideal limit, so let's take the max of B Set and compare it to the lowest value of the D Set.
B=78
D=13

So in this case...
Xmax=112

However, I want Xmax to be no greater than 50, trying to keep my values as small as reasonably possible (50 seems workable considering the sizes of the actual sets, not the ones listed here).

So X=112 --> Aop --> 50, where Aop is some operation A that X undergoes to yield a result of 50.
Aop(112)=50

[i]EDIT: I deleted everything i wrote after this point. I need sleep. I confused even myself. Let me collect and sort my thoughts and then maybe my samples won't mae it even more confusing. But before then, one little thing to add that might clear some things up:

There is also a 3rd set, we'll call it K. I won't type it out, but K would include all pairings of B Set and D Set (in other words, K Set is huuuuge). What I want is to reduce each value in K Set so that Aop(Kmax)=50 and Aop(Kmin)=1 and Aop(Kmid)/Aop(Kmax)=Kmid/Kmax

I'll leave it there for now.