is this problem solvable?

Question

a * [ (b + c) ^ (d - e) - f ^( g * h)] / j = 10
given that (c-b=1) & (h-g=3)

find the value of each letter as in a= ? b=? c=? .... J=?

Answer 1

Nope

₢

Answer 2

In general, you need n equations to solve for n variables. The first equation has 9 variables, so you would need 8 additional equations to solve each variable, each equation solving one variable.

However, if the second equation were to read c+b=1, the substitution into the first would yield, a - [f^(g*h)]/j=10. This is because substituting 1 for b+c gives 1^(d-e), but 1^(x) is allways 1 for all x. In that case one equation would have eleminated 4 variables (1+3) so you would only need 6 equations to solve (9-3).

Another case is if one equation is the equivalent of saying x=x (for example x-1=2x-2) or two equations are really the same equation (x=y+1 and 2x=2y+2). In these cases, the redundant equation does not count.

Answer 3

No, it's not solvable. There's a basic rule in mathematics that states that you need one equation for each unknown. You have 9 unknowns, but only 3 equations.

Answer 4

No. There are simply too many unknowns. For example-- whatever values you find for b and c, (b+c)^(d-e) only gives you a value for (d-e)-- not a value for d or e, just their difference. So, if you decided (d-e)=2, you could say that d=2, e=0, or d=100002, e=100000. You can't get definite values for the unknowns. You could pick values, and show that they work in the equation, but there's no one set of values that are correct.

Answer 5

9 Variables.
3 Equations.
NO

Answer 6

Are you joking. This problem is unsolvable as there are simply too many variables and too less equations.