How many different positive integers can be represented as a difference of two distinct members of the set {1, 2, 3, 4, 5, 6}?

For the difference to be positive, when both the minuend and the subtrahend are positive, the former must be greater than the latter.

Therefore

minuend = 2 ⇒ subtrahend = 1 ← 1 number

minuend = 3 ⇒ subtrahend = 1,2 ← 2 numbers

minuend = 4 ⇒ subtrahend = 1,2,3 ← 3 numbers

minuend = 5 ⇒ subtrahend = 1,2,3,4 ← 4 numbers

minuend = 6 ⇒ subtrahend = 1,2,3,4,5 ← 5 numbers

1+2+3+4+5=15

the number of possible outcomes that do not show a 1 on the first spinner and show the number 4 on the second spinner is 2.

spinner 1 spinner 2

1                     1

1                     2

1                     3

1                     4

2                   1

2                   2

2                   3

2                   4   = not 1, and 4

3                   1

3                   2

3                   3

3                   4 = not 1, and 4

only 2 outcomes have passed the given condition.

step-by-step explanation: