Let x be a string of length n, and let y be a string of length n − k, for 1 ≤ k < n. We wish to line up the symbols in x with the symbols in y by adding k blanks to y. Suppose that we add two separate blocks of blanks, one of size i and one of size k − i, for 1 ≤ i < k. How many ways are there to do this?

answer: 5100 just subtract

step-by-step explanation:

c

step-by-step explanation:

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:

p< -25

t> 12

r> 17

step-by-step explanation: