Answer:
B) {(−2, −3), (−3, −2), (2, 3), (3, 2)}
Step-by-step explanation:
each input of x (-2), (-3), (2), (3) does not have duplicated output value
The answer is -a-bc+43
Pull terms out from under the radical, assuming positive real numbers
Answer: The GREATEST number of bookmarks that Logan can make = 31.
GIven: Total petals = 95
Number of petals required for each bookmark = 3
Number the number of bookmarks can be prepared from 95 petals = 95 ÷ (Petals required of each bookmark)
= 95÷3
i.e. The GREATEST number of bookmarks that Logan can make = 31.
126.
This is the number of combinations of 4 cards from 9 cards:
= 9C4
= 9! / 4! 5!.
A quick way of calculating this is
9*8*7*6
----------- = 9*2*7 = 126 combinations.
4*3*2*1
Since ∆AFB is similar to ∆ABC.
<u>In </u><u>∆</u><u>A</u><u>BC,</u>
⇛< A + < B + < C = 180°
⇛37° + 65° + < C = 180°
⇛102° + < C = 180°
⇛< C = 78°
We know that, < AGF / < G = < C
So, Measure of angle < AGF = <u>7</u><u>8</u><u>°</u><u> </u><u>(</u><u>ans)</u>