Mei Su had 80 coins. She gave most of them to her friends in such a way that each of her friends got at least one coin and no two of her friends got the same number of coins. What is the largest number of friends to whom Mei Su could have given coins?

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.

step-by-step explanation:

y = | -2(-2) |     →     y = | 4 |     →     y = 4       ⇒   (-2, 4)

y = | -2(-1) |     →     y = | 2 |     →       y =   2       ⇒   (-1, 2)    

y = | -2(0) |     →     y = | 0 |     →       y = 0         ⇒   (0, 0)

y = | -2(1) |   c →     y = | -2 |     →     y =   2         ⇒   (1, 2)    

y = | -2(2) |     →     y = | - 4 |     →     y =   4         ⇒   (2, 4)  

i think it might be a but you might want a second opinion