Answer:
B and C
Step-by-step explanation:
Required
Select graphs that are dilated by a scale factor greater than 1
For graph A:
Graph A is smaller than the original graph. This indicates dilation with a scale factor less than 1
For graph B:
Graph B is bigger than the original graph and is dilated over (0,0). This indicates dilation with a scale factor greater than 1
For graph C:
Graph C is bigger than the original graph; however, it is not dilated over (0,0). This indicates dilation with a scale factor greater than 1
For graph D:
Graph D is bigger than the original graph; however, it is not only dilated but also flipped over (i.e. rotated).
<em>Hence, b and c is true</em>
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:
ab+xy−5
Step-by-step explanation:
yx+ab−5 = xy+ab+−5
Simplify-
ab+xy−5
Step-by-step explanation:
1. 
(chain rule)
2 
