3 years ago

Solve the linear inequality −6x+5>−1

Mathematics

1 answer:

Leto [7]3 years ago

7 0

The answer to this question is:

x<1

You might be interested in

Which is an advantage of using a checking account? You can pay only in cash, which can help you avoid splurging. You can pay by

Yuki888 [10]

You can pay in check

8 0

3 years ago

Read 2 more answers

Consider a melody to be 7 notes from a single piano octave, where 2 of the notes are white key notes and 5 are black key notes.

igor_vitrenko [27]

Answer:

35,829,630 melodies

Step-by-step explanation:

There are 12 half-steps in an octave and therefore $12^7$ arrangements of 7 notes if there were no stipulations.

Using complimentary counting, subtract the inadmissible arrangements from $12^7$ to get the number of admissible arrangements.

$\displaystyle \_\_ \:B_1\_\_ \:B_2\_\_ \:B_3\_\_ \:B_4\_\_ \:B_5\_\_$

$B_1$ can be any note, giving us 12 options. Whatever note we choose, $B_2, B_{...}$ must match it, yielding $12\cdot 1\cdot 1\cdot 1\cdot 1=12$ . For the remaining two white key notes, $W_1$ and $W_2$ , we have 11 options for each (they can be anything but the note we chose for the black keys).

There are three possible arrangements of white key groups and black key groups that are inadmissible:

$WWBBBBB\\WBBBBBW\\BBBBBWW$

White key notes can be different, so a distinct arrangement of them will be considered a distinct melody. With 11 notes to choose from per white key, the number of ways to inadmissibly arrange the white keys is $\displaystyle\frac{11\cdot 11}{2!}$ .