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.
It's the same as adding 2 fractions the product of 2 rational numbers is rational
Answer to your question : 12(4+1)
Answer:
120
Step-by-step explanation:
No of math books = 4
No of History books = 7
Since no two math books are next to each other, we can say each math book is sandwiched between two history books like
H⇔M⇔H
We can assume that this there books in system above is binded together, thus we will have
3 binded combinations H⇔M⇔H
1 single Math book M
1 single History book H
No of possible arrangements = (3+1+1)! =5! = 5 x 4 x 3 x 2 x 1 = 120
(1/5×12)×15
12/5×15
12×15=180
180/5=36
the is 36