Answer:
k=-j=15
Step-by-step explanation:
See attachment for step by step :)
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:
A
Step-by-step explanation:
Just multiply 1166 by 0.2879
<span>x=number of brown shoes
2x=number of black shoes (twice as many black shoes as brown shoes)
so x+2x=66
add like terms 3x=66
solve for x by dividing 3; x=22
so there are 22 brown shoes and 44 black shoes (2 x 22= 44)</span>
