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.
The variable <em>x </em>is equal to 0.5
I have a sum because it is an addition problem
<h2>For the number 1<u>.</u><u>.</u></h2>
<h2><u>angle </u><u>at </u><u>center </u><u>=</u><u> </u><u>2</u><u>×</u><u>a</u><u>n</u><u>g</u><u>l</u><u>e</u><u> </u><u>at </u><u>circumference</u></h2><h2><u>the </u><u>angle </u><u>at </u><u>center </u><u>(</u><u>o)</u><u> </u><u>is </u><u>equal</u><u> </u><u>to</u><u> </u><u>1</u><u>4</u><u>1</u></h2>
<u>therefore:</u>
<h2><u>1</u><u>4</u><u>1</u><u> </u><u>=</u><u> </u><u>2</u><u>x</u></h2><h2><u>divide</u><u> </u><u>both </u><u>sides </u><u>by </u><u>2</u></h2><h2><u>x </u><u>=</u><u> </u><u>7</u><u>0</u><u>.</u><u>5</u></h2>
<u>option</u><u> </u><u>(</u><u>A)</u><u>.</u>
<u>(</u><u> </u><u>the </u><u>number </u><u>2</u><u> </u><u>and </u><u>3</u><u> </u><u>questions</u><u> </u><u>aren't</u><u> </u><u>correct </u><u>)</u>