Answer:
4 units to the left
Step-by-step explanation:
y = a (x - h)² + k
The h is a horizontal translation of <em>h</em> units.
For h > 0, move right
For h < 0, move left
Answer:
1680 ways
Step-by-step explanation:
Total number of integers = 10
Number of integers to be selected = 6
Second smallest integer must be 3. This means the smallest integer can be either 1 or 2. So, there are 2 ways to select the smallest integer and only 1 way to select the second smallest integer.
<u>2 ways</u> <u>1 way</u> <u> </u> <u> </u> <u> </u> <u> </u>
Each of the line represent the digit in the integer.
After selecting the two digits, we have 4 places which can be filled by 7 integers. Number of ways to select 4 digits from 7 will be 7P4 = 840
Therefore, the total number of ways to form 6 distinct integers according to the given criteria will be = 1 x 2 x 840 = 1680 ways
Therefore, there are 1680 ways to pick six distinct integers.
Answer: <em>n </em>-<em> 4 = -15</em>
<em>n </em>= -11
Step-by-step explanation:
If -15 is the same as 4 less than <em>n, </em>that means that <em>n </em>- 4 = -15
Then you add 4 to each side of the equation to get <em>n </em>by itself. (-15 + 4 = -11)
That step leaves you with <em>n</em> = -11
