Integer solutions for equations A * [(B + C)(D - E) - F(G*H) ] / J = 1

  • Thread starter Thread starter Ben Fido
  • Start date Start date
  • Tags Tags
    Integer
Click For Summary

Homework Help Overview

The problem involves finding integer solutions for a specific equation involving multiple variables, each representing a unique, single-digit, nonzero number. The equation is structured such that the left-hand side equals 10, with additional constraints on the relationships between certain variables.

Discussion Character

  • Exploratory, Assumption checking

Approaches and Questions Raised

  • Participants discuss the implications of having three equations with nine unknowns, suggesting that there may be many solutions. There are considerations about the uniqueness of the digits and the constraints provided, such as C - B = 1 and H - G = 3.

Discussion Status

There is an ongoing exploration of potential values for the variables, with some participants providing specific examples and calculations. However, there is no consensus on a definitive approach or solution, and the discussion reflects a mix of attempts and clarifications regarding the problem's requirements.

Contextual Notes

Participants note the constraints of the problem, including the requirement for unique, nonzero digits and the relationships between certain variables. There is also a mention of the tedious nature of finding solutions given these constraints.

Ben Fido
Messages
3
Reaction score
0
Could anyone please answer this


You are confronted with the following formula:

A * [(B + C)(D - E) - F(G*H) ] / J = 10

Knowing that each variable is a unique, single-digit, nonzero number, and that C - B = 1, and H - G = 3, what is the number ABCDEFGHJ, where each letter is a digit? For example, if A = 4, B = 2, and C = 7, ABC would equal 427.

Thanks
 
Physics news on Phys.org
You have 3 equations and 9 unknowns, so most likely, you have lots of solutions.

Let us set A=J, H=3, G=0, whereby we must have (B+C)(D-E)=10

Setting now B=2, C must be 3, and D-E=2.

These particular choices determine 720 distinct solutions to your problem.

Or should your numbers be non-repeating? (Your uniqueness condition?)

Okay, I forgot that none of your numbers should be zero, either.

Then your problem is difficult, in the sense of being tedious:
If I have counted correctly, there exist 26 different quadruples (B,C,G,H) so that C-B=1, H-G=3, and all 4 numbers are unique, single digit numbers.

You will solve your problem on a trial&error basis restricting yourself to these 26 special cases.
 
Last edited:
Aw come on, I just want the answer in a hurry!

It is Christmas, afer all.
 
Well, since there will exist for each such quadruple 10 combinations of D and E (since D-E must be positive), and the three remaining numbers can be placed in the A, J F positions, you are free to analyze the 26*10*6=1560 special cases occurring.

But don't count upon us to do it for you.
 
Ben Fido, please read and follow the rules for these forums.
 

Similar threads

  • · Replies 10 ·
Replies
10
Views
5K
  • · Replies 35 ·
2
Replies
35
Views
4K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
8K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K