Answer:
Dude
Step-by-step explanation:
There's nothing here
Answer: 12 friends.
Step-by-step explanation:
the data we have is:
Mei Su had 80 coins.
She gave the coins to her friends, in such a way that every friend got a different number of coins, then we have that:
The maximum number of friends that could have coins is when:
friend 1 got 1 coin
friend 2 got 2 coins
friend 3 got 3 coins
friend N got N coins
in such a way that:
(1 + 2 + 3 + ... + N) ≥ 79
I use 79 because "she gave most of the coins", not all.
We want to find the maximum possible N.
Then let's calculate:
1 + 2 + 3 + 4 + 5 = 15
15 + 6 + 7 + 8 + 9 + 10 = 55
now we are close, lets add by one number:
55 + 11 = 66
66 + 12 = 78
now, we can not add more because we will have a number larger than 80.
Then we have N = 12
This means that the maximum number of friends is 12.
(4y-3)(2y²+3y-5)
First , let's start with "4y"
4y*2y² = 8y³
4y*3y = 12y²
4y*-5 = -20y
Next, let's multiply by "-3"
-3*2y² = -6y²
-3*3y = -9y
-3*-5 = 15
Now, let's combine all of our values.
8y³+12y²-6y²-20y-9y+15 = 8y³+6y²-29y+15
32 it’s as simple as 4(5) + 12
Answer:
Image A shows a reflection.
