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.
Answer:
will be the fraction.
Step-by-step explanation:
Here the recurring decimal number is 0.0343434....
To convert this recurring decimal to fraction we assume,
x = 0.03434.... -------(1)
Now multiply both the sides with 100.
100x = 3.43434.... ------(2)
Now subtract equation (1) from equation (2).
100x = 3.43434
<u> x = 0.03434</u>
99x = 3.4
x = 
= 
x =
Therefore, fraction that represents the decimal number is
1/9=0.11111.....
so the correct option is (a).
