HELP ASAP

Mathematics

2 answers:

galben [10]3 years ago

3 0

I don’t have a very detailed explanation, however the answer should be “A 90-degree counterclockwise rotation about the origin followed by a translation 1 unit to the left”.

You can clearly see a 90° angle here, it’s obvious. Also, the polygon switch counterclockwise. so, you can see.

hope I helped ^^

WARRIOR [948]3 years ago

3 0

The person above is correct

You might be interested in

Please answer quickly

Marta_Voda [28]

Answer:

1. hexagon

2. 4

4. H

5. 6

6-8. count how many sides there are in the shape and multiply the given area to the number of sides you counted. for 6 it's a pentagon. 5 sides. Multiply 8.5 X 5. use calculator for the rest of that section if needed

9-11. they are equilateral triangles. Search up the formula and plug in and solve

Step-by-step explanation:

6 0

3 years ago

Lily is in the business of manufacturing phones. She must pay a daily fixed cost to rent the building and equipment, and also pa

Nesterboy [21]

Answer:

<h2>The slope is 100</h2>

Step-by-step explanation:

Given that the equation that represents the total cost is given as

C=900+100p--------1

this equation is the same as the equation of a straight line, and we can deduce from it when we compare it the straight line equation

the equation of a line is given as

y=mx+c------2

comparing equation 1 and 2 we have the slope as

m=100

In the context of this problem m=100 means that the cost of producing a phone per material and labour cost is $100

7 0

3 years ago

Give a combinatorial proof that if n is a positive integer, then

gregori [183]

The Empire is attacking a Rebel base that is stocked with $n$ X-wings and $n$ Y-wings. The Rebels need to build a fleet consisting of $n$ ships (with at least 1 X-wing), to be led by 1 pilot in an X-wing.

There are $\binom n1=n$ ways of picking the leader, and $\binom{2n-1}{n-1}$ ways of building the rest of the fleet, so there's a total of

$n\dbinom{2n-1}{n-1}$

ways of building such a fleet.

In the other direction, suppose we build a fleet comprising of $k$ X-wings and $n-k$ Y-wings. We have $\binom nk$ ways of picking X-wings and $\binom n{n-k}$ ways of picking Y-wings. Also from the $k$ X-wings we pick 1 to be the leader, which we can do in $\binom k1=k$ ways. So there are