# How do you determine the number of ways a computer can randomly generate two integers whose sum is 8 from 1 through 12?

Then teach the underlying concepts
Don't copy without citing sources
preview
?

#### Explanation

Explain in detail...

#### Explanation:

I want someone to double check my answer

1
Nimo N. Share
Jan 24, 2018

Some comments to get you started. The problem may not have been well-enough defined.

#### Explanation:

First, the problem has to be well defined.

A) If the problem is to generate random integers, will the choice of numbers used to generate the sum only be in the set of values: ${N}_{A} = \left\{1 , 2 , 3 , \ldots , 12\right\}$?

• This leads to another important mathematical question:
Does "sum" mean simply "addition", or is it the mathematical "sum", which includes both adding and subtracting?

If that is the case, none of the numbers ${X}_{A} = \left\{8 , 9 , 10 , 11 , 12\right\}$ can be selected, since all of the numbers are positive and there is no other number in the set ${N}_{A}$ that can be added to any of the numbers in ${X}_{A}$ to obtain 8.

Suppose the problem is as described in A), and that "sum" only means "addition". Then, the solution is easy to find - just make a list of the possible combinations, then count them.

Okay, we shall to do this the easy way...
List:
$\left(1 + 7\right)$, $\left(2 + 6\right)$, $\left(3 + 5\right)$, $\left(4 + 4\right)$, $\left(5 + 3\right)$, $\left(6 + 2\right)$, $\left(7 + 1\right)$.
It looks as though we have all the possible combinations.
There are only 7 ways.

• NB All the computer needs to do is pick one of the numbers in the set ${S}_{A} = \left\{1 , 2 , 3 , , , , , 7\right\}$. The second number can't be random, since once the first one is generated, the second one is determined.

We really may not be finished with the problem.

B) If the problem is really asking about integers (including both positive and negative values) and the list given should really be ${N}_{B} = \left\{\pm 1 , \pm 2 , \pm 3 , \ldots , \pm 12\right\}$, we have a little longer list to make, but the solution can be found just as easily.

There are 24 numbers from which to choose in set ${N}_{B}$. But, at least two of them can't be used, since there is no way to obtain a sum of 8 if chosen.

For example, we can't use 8, since zero is not in the set and there is no positive number in the set ${N}_{B}$ large enough to add to (-8) to produce a sum of 8.

The solution is, as above: make a list of the combinations from set ${N}_{B}$ that will produce a sum of 8, then count them. And, remember the comment in NB, above.

• 20 minutes ago
• 23 minutes ago
• 24 minutes ago
• 29 minutes ago
• A minute ago
• 3 minutes ago
• 11 minutes ago
• 19 minutes ago
• 19 minutes ago
• 19 minutes ago
• 20 minutes ago
• 23 minutes ago
• 24 minutes ago
• 29 minutes ago